A confluent reduction for the λ-calculus with surjective pairing and terminal object-Reference-Cited by-同舟云学术

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

Published:1991 Issue: Volume: Page:291-302
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Curien Pierre-Louis,Cosmo Roberto

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54233-7_142.pdf

Reference18 articles.

1. Henk Barendregt. The Lambda Calculus; Its syntax and Semantics (revised edition). North Holland, 1984.

2. Kim Bruce, Roberto Di Cosmo, and Giuseppe Longo. Provable isomorphisms of types. Technical Report 90–14, LIENS — Ecole Normale Supérieure, 1990. To appear in Proc. of Symposium on Symbolic Computation, ETH, Zurich, March 1990: MSCS.

3. Pierre-Louis Curien and Roberto Di Cosmo. A confluent reduction system for the λ-calculus with surjective pairing and terminal object. Technical Report, LIENS — Ecole Normale Supérieure, 1991. To appear.

4. Pierre-Louis Curien and Giorgio Ghelli. Subtyping and extensionality: decidability of βηtop≤ on F≤. 1990. Draft.

5. Roberto Di Cosmo. Invertibility of terms and valid isomorphisms. A proof theoretic study on second order λ-calculus with surjective pairing and terminal object. Technical Report, LIENS — Ecole Normale Supérieure, 1991. To appear.

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

1. Confluence of extensional and non-extensional λ-calculi with explicit substitutions;Theoretical Computer Science;2000-05

2. Structures definable in polymorphism;Journal of Computer Science and Technology;1998-11

3. Rewriting with extensional polymorphic λ-calculus;Computer Science Logic;1996

4. Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract);Rewriting Techniques and Applications;1996

5. Expanding extensional polymorphism;Lecture Notes in Computer Science;1995