A third-order representation of the λμ-calculus

Electronic Notes in Theoretical Computer Science

Volumn 58, Issue 1, 2001, Pages 97-114

  Abel, Andreas ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; ENCODING (SYMBOLS); ERROR ANALYSIS; SEMANTICS; THEOREM PROVING;

ABSTRACT SYNTAX; BISIMULATIONS; FUNCTIONAL PROGRAMMING; NORMALIZATION;

FORMAL LOGIC;

EID: 8344260845     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00281-6     Document Type: Conference Paper

References (17)

1. Abel A. A third-order representation of the λμ-calculus. 2001;Twelf code. URL http://www.tcs.informatik.uni-muenchen.de/~abel/merlin01. tar.gz
2. Altenkirch T., A formalization of the strong normalization proof for System F in LEGO, in: M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, TLCA'93, Lecture Notes in Computer Science 664 (1993), pp. 13-28. URL http://www.tcs.informatik.uni-muenchen.de/~alti/publications.html
3. Baba K., S. Hirokawa and K. Fujita, Parallel reduction in type free λμ-calculus, in: Proceedings of CATS 2001 (Computing: the Australasian Theory Symposium), Electronic Notes in Theoretical Computer Science 42 (2001), also appeared as Technical Report DOI-TR-177, Kyushu University, Fukuoka, Japan. URL http://zk.cc.kyushu-u.ac.jp/~baba/
4. also appeared as Technical Report DOI-TR-177, Kyushu University, Fukuoka, Japan. URL http://zk.cc.kyushu-u.ac.jp/~baba/
5. Bierman, G. M., A computational interpretation of the λμ-calculus, in: L. Brim, J. Gruska and J. Zlatuska, editors, Proceedings of Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1450, Brno, Czech Republic, 1998, pp. 336-345. URL http://www.cl.cam.ac.uk/~gmb/
6. de Groote P., A simple calculus of exception handling, in: M. Dezani and G. Plotkin, editors, Second International Conference on Typed Lambda Calculi and Applications, TLCA'95, Lecture Notes in Computer Science 902 (1995), pp. 201-215. URL http://www.loria.fr/~degroote/bibliography.html# 1995
7. de Groote P., An environment machine for the λμ-calculus (1998), to appear in MSCS. URL http://www.loria.fr/~degroote/bibliography. html#wp
8. Felleisen M., Friedman D.P., Kohlbecker E., Duba B.F. A syntactic theory of sequential control. Theoretical Computer Science. 52:1987;205-237
9. Griffin, T. G., A formulæ-as-types notion of control, in: Proceedings of the Seventeenth ACM/SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) (1990). URL http://www.research.att.com/~griffin/ pubs.html
10. Harper R., Honsell F., Plotkin G. A Framework for Defining Logics. Journal of the Association of Computing Machinery. 40:1993;143-184
11. Ong C.-H. L. and C. A. Stewart, A Curry-Howard foundation for functional computation with control, in: Proceedings of ACM SIGPLAN-SIGACT Symposium on Principle of Programming Languages (1997), pp. 215-227. URL http://users.comlab. ox.ac.uk/luke.ong/publications/index.html
12. Parigot M., λμ-calculus: An algorithmic interpretation of classical natural deduction, in: A. Voronkov, editor, Logic Programming and Automated Reasoning: Proc. of the International Conference LPAR'92, Springer, Berlin, Heidelberg, 1992 pp. 190-201.
13. Pfenning F., Intensionality, extensionality, and proof irrelevance in modal type theory, in: LICS 2001: IEEE Symposium on Logic in Computer Science, 2001. URL http://www.cs.cmu.edu/~fp/publications.html
14. Pfenning F. Logical frameworks. Robinson A., Voronkov A. Handbook of Automated Reasoning. 2001;. URL http://www.cs.cmu.edu/~fp/publcations.html
15. Pfenning F. and C. Schürmann, Twelf user's guide, Technical report, Carnegie Mellon University (1998). URL http://www.cs.cmu.edu/~twelf
16. Shankar N. A mechanical proof of the Church-Rosser theorem. Journal of the ACM. 35:1988;475-522. URL http://dev.acm.org/pubs/citations/journals/jacm/ 1988-35-3/p475-shankar/
17. Streicher T., Reus B. Classical logic, continuation semantics and abstract machines. Journal of Functional Programming. 8:1998;543-572. URL http://www.mathematik.tu-darmstadt.de/~streicher/