Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative-Reference-Cited by-同舟云学术

Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative

Published:2006-03-16 Issue:2 Volume:2 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Støvring Kristian

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. Pairing Without Conventional Restraints

2. Henk Barendregt.The Lambda Calculus: Its Syntax and Semantics, volume 103 ofStudies in Logic and the Foundation of Mathematics. North-Holland, revised edition, 1984.

3. Henk Barendregt. Lambda calculi with types. In Samson Abramsky, Dov M. Gabbay, and Thomas S. E. Maibaum, editors,Handbook of Logic in Computer Science, Vol. 2, chapter 2, pages 118-309. Oxford University Press, Oxford, 1992.

4. A confluent reduction for the λ-calculus with surjective pairing and terminal object

5. Theoretical Pearl Yet yet a counterexample for λ+SP

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extensional proofs in a propositional logic modulo isomorphisms;Theoretical Computer Science;2023-10

2. CERTIFYING CONFLUENCE PROOFS VIA RELATIVE TERMINATION AND RULE LABELING;LOG METH COMPUT SCI;2017

3. How to Think of Intersection Types as Cartesian Products;Electronic Notes in Theoretical Computer Science;2016-10

4. Levy Labels and Recursive Types;Logical Foundations of Computer Science;2015-12-10

5. Polarised Intermediate Representation of Lambda Calculus with Sums;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07