Extensional embedding of a strongly stable model of PCF
Proceedings of the 18th international colloquium on Automata, languages and programming
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Sequentiality in an extensional framework
Papers presented at the IEEE symposium on Logic in computer science
Kripke logical relations and PCF
Information and Computation
A relative PCF-definability result for strongly stable functions and some corollaries
Information and Computation
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Full Abstraction and the Context Lemma
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Logical Reconstruction of Bi-domains
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
We introduce a technique based on logical relations, which, given two models M and N of a simply typed lambda-calculus L, allows us to construct a model M/N whose L-theory is a superset of both Th(M) and Th(N). By means of some examples, we show that classic bi-domain constructions lack this property, in general.