Comparing models of the non-extensional typed λ-calculus extended abstract
In this paper we consider “powerset models” of the non-extensional typed lambda calculus. Although the interpretation of the type constructor ⇒ is in general not uniquely determined, we can make a canonical choice in this particular ase; there exists a minimal interpretation of ⇒ (with respect to a certain class of interpretations) which yields models with a maximal theory (in that class).
Unable to display preview. Download preview PDF.
- Gunther, C. A., Comparing Categories of Domains, in: A. Melton (Ed.), Mathematical Foundations of Programming Semantics, Proceedings Int. Conference 1985, Lect. Notes in Comp. Sci., vol. 239, Springer-Verlag, Berlin, 1986, pp. 101–121.Google Scholar
- Hayashi, S., Adjunction of Semifunctors: Categorical Structures in Non-Extensional Lambda-Calculus, Theor. Comput. Sci. 41 (1985), 95–104.Google Scholar
- Hoofman, R., The Theory of Semi-Functors, Mathematical Structures in Computer Science, 3 (1993), 93–128.Google Scholar
- Plotkin, G. D., Set-Theoretical and other Elementary Models of the λ-calculus, Theoretical Computer Science, 121 (1993), 351–409.Google Scholar