Separation with streams in the Λμ-calculus

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 356-365

  Saurin, Alexis ^a  

^a INRIA   (France)

Author keywords

B hm Theorem; Calculus of Streams; Separation Property; Untyped calculus

Indexed keywords

CLASSICAL LOGIC; CURRY-HOWARD ISOMORPHISM; SEPARATION PROPERTY;

FORMAL LANGUAGES; SYNTACTICS; THEOREM PROVING;

FORMAL LOGIC;

EID: 26844528554     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Z. Ariola and H. Herbelin. Minimal classical logic and control operators. In ICALP'03, volume 2719 of LNCS. Springer, 2003.
2. H. Barendregt. The Lambda Calculus, its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics. Elsevier publishers, 1984.
3. C. Böhm. Alcune proprietà delle forme βη-normali nel λk-calcolo. Publicazioni dell' Istituto per le Applicazioni del Calcolo, 696, 1968.
4. G. Bierman. A computational interpretation of the λμ-calculus. In MFCS'98, volume 1450 of LNCS, pages 336-345. Springer, 1998.
5. R. David and W. Py. λμ-calculus and Böhm's theorem. Journal of Symbolic Logic, 66(1):407-413, 2001.
6. P. de Groote. On the relation between the lambda-mu-calculus and the syntactic theory of sequential control. In LPAR'94, volume 822 of LNAI, pages 31-43, 1994.
7. P. de Groote. An environment machine for the λμ-calculus. MSCS, 8:637-669, 1998.
8. M. Felleisen and R. Hieb. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 103(2):235-271, September 1992.
9. J.-Y. Girard. A new constructive logic: classical logic. MSCS, 1(3):255-296, 1991.
10. J.-Y. Girard. Locus solum. MSCS, 11:301-506, 2001.
11. T. Griffin. A formulae-as-types notion of control. In POPL'90, pages 47-58, 1990.
12. T. Joly. Codages, séparabilité et représentation de fonctions en λ-calcul simplement typé et dans d'autres systèmes de types. PhD thesis, Université Paris VII, 2000.
13. J.-L. Krivine. Lambda-calculus, Types and Models. Ellis Horwood, 1993.
14. O. Laurent. Krivine's abstract machine and the λμ-calculus (an overview). unpublished note, September 2003.
15. O. Laurent. Polarized proof-nets and λμ-calculus. Theoretical Computer Science, 290(1):161-188, 2003.
16. C.-H. Ong and C. A. Stewart. A Curry-Howard foundation for functional computation with control. In POPL'97, pages 215-227, 1997.
17. M. Parigot. λμ-calculus: an algorithmic interpretation of classical natural deduction. In International Conference on Logic Programming and Automated Deduction, volume 624 of LNCS, pages 190-201. Springer, 1992.
18. W. Py. Confluence en λμ-calculus. PhD thesis, Université de Savoie, 1998.
19. T. Streicher. Laird domains. Manuscipt, 2003.