State-Dependent Representation Independence (Technical Appendix)

A relational realizability model for higher-order stateful ADTs

We present a realizability model for reasoning about contextual equivalence of higher-order programs with impredicative polymorphism, recursive types, and higher-order mutable state. The model combines the virtues of two recent earlier models: (1) Ahmed, Dreyer, and Rossberg’s step-indexed logical relations model, which was designed to facilitate proofs of representation independence for “state...

Technical Appendix for: Intertemporal Labor Supply with Search Frictions

This technical appendix is a companion of main article. In Section 2 we show how to rewrite the Bellman equations in steady state in terms of de-trended variables. In Section 3 we detail the computational algorithm to solve for the policy functions of the problem faced by employed and unemployed workers, for given equilibrium quantities. Then, in subsections 3.2 and 3.1 we discuss how we solve ...

G G r Machine Repair Problem with Spares and Additional Repairman (TECHNICAL NOTE)

The machine repair problem with spares and additional repairman is analyzed. The interfailure and repair times of the units are general identical and independently distributed. The failure and repair rates are assumed to be state dependent. Using diffusion approximation technique, we obtain the queue size distribution under steady state. The average number of failed units, average number of ope...

Technical Appendix for "Gaussian Tests of Extremal White Noise for Dependent, Heterogeneous Processes with an Application"

Impredicative Concurrent Abstract Predicates (technical Appendix) Introduction

state AState ∈ Sets AState def = LState× SState