Theoretical Computer Science
Fully abstract semantics for observably sequential languages
Information and Computation
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Information and Computation
A New Characterization of Lambda Definability
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Logical Predicates for Intuitionistic Linear Type Theories
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Decidability of All Minimal Models
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Studying the Fully Abstract Model of PCF within its Continuous Function Model
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Decidability of Linear Affine Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
A finite model property for fully complete denotational models of propositional logics is investigated using fully complete translations to compare programming languages and logics. The main result is that there can be no finite and fully complete models of linear or affine propositional logics. This is shown to be a consequence of Loader's result that contextual equivalence for finitary PCF is not decidable by giving a fully complete translation from finitary PCF into a Λ(Ω)ωbda-calculus for a dual affine/non-linear logic. It is shown that the non-linear part of this logic does have a finite and fully complete model, and a conservative extension of the above translation is given from finitary PCF with control (µPCF) into the non-linear fragment which shows that the fully abstract modelof µPCF is effectively presentable.