Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Plotkin, G.D.: Lambda-definability and logical relations. Memorandum SAI–RM–4. University of Edinburgh, Edinburgh, Scotland (1973)
2. Statman, R.: Logical relations and the typed λ-calculus. Information and Control 65(2–3), 85–97 (1985)
3. Pitts, A.M.: Relational properties of domains. Information and Computation 127(2), 66–90 (1996)
4. Tait, W.W.: Intensional interpretations of functionals of finite type i. Journal of Symbolic Logic 32(2), 198–212 (1967)
5. Girard, J.Y.: Interprétation Fonctionnelle et Élimination des Coupures de l’Arithm étique d’Ordre Supérieur. Thèse de doctorat d’état, Université Paris VII, Paris, France (1972)
Cited by
120 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Logical Approach to Type Soundness;Journal of the ACM;2024-07-10
2. Bialgebraic Reasoning on Higher-order Program Equivalence;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Probabilistic Programming with Programmable Variational Inference;Proceedings of the ACM on Programming Languages;2024-06-20
4. Taypsi: Static Enforcement of Privacy Policies for Policy-Agnostic Oblivious Computation;Proceedings of the ACM on Programming Languages;2024-04-29
5. Gradually Typed Languages Should Be Vigilant!;Proceedings of the ACM on Programming Languages;2024-04-29