An ideal model for recursive polymorphic types
Information and Control
Typing and computational properties of lambda expressions
Theoretical Computer Science
Domains and lambda-calculi
Theories of programming languages
Theories of programming languages
A semantic model of types for applicative languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Theoretical Computer Science - Mathematical foundations of programming semantics
Coherence of subsumption for monadic types
Journal of Functional Programming
A typed semantics of higher-order store and subtyping
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Typed vs. Untyped Realizability
Electronic Notes in Theoretical Computer Science (ENTCS)
Polymorphic functions with set-theoretic types: part 1: syntax, semantics, and evaluation
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
A definition of a typed language is said to be "intrinsic" if it assigns meanings to typings rather than arbitrary phrases, so that ill-typed phrases are meaningless. In contrast, a definition is said to be "extrinsic" if all phrases have meanings that are independent of their typings, while typings represent properties of these meanings.For a simply typed lambda calculus, extended with integers, recursion, and conditional expressions, we give an intrinsic denotational semantics and a denotational semantics of the underlying untyped language. We then establish a logical relations theorem between these two semantics, and show that the logical relations can be "bracketed" by retractions between the domains of the two semantics. From these results, we derive an extrinsic semantics that uses partial equivalence relations.