Structural logical relations

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 69-80

  Schürmann, Carsten ^a   Sarnat, Jeffrey ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS;

LOGIC IN COMPUTER SCIENCE; LOGICAL RELATIONS; PROOF ASSISTANTS;

COMPUTERS;

EID: 51549089075     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.44     Document Type: Conference Paper

References (18)

1. Andreas Abel. Normalization for the simply-typed lambda-calculus in Twelf. In Carsten Schürmann, editor, Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages, pages 3-16. El-sevier, ENTCS 199, February 2008.
2. B. Aydemir, A. Bohannon, M. Fairbairn, J. Foster, B. Pierce, P. Sewell, D. Vytiniotis, G. Washburn, S. Weirich, and S. Zdancewic. Mechanized metatheory for the masses: The POPLmark challenge. In Joe Hurd and Tom Melham, editors, Proceedings of the Eighteenth International Conference on Theorem Proving in Higher Order Logics, pages 50-65, Oxford, UK, August 2005. Springer Verlag, LNCS 3603.
3. Thorsten Altenkirch. A formalization of the strong normalization proof for System F in LEGO. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 13-28, Utrecht, The Netherlands, March 1993. Springer-Verlag LNCS 664.
4. B. Barras and B. Werner. Coq in Coq. Soumis, 1997.
5. Karl Crary. Logical relations and a case study in equivalence checking. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, pages 223-244. MIT Press, 2005.
6. Kevin Donnelly and Hongwei Xi. A formalization of strong normalization for simply-typed lambda calculus and System F. In Alberto Momigliano and Brigitte Pientka, editors, Proceedings of Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, pages 109-125, Seattle, WA, August 2006. El-sevier, ENTCS 174, Issue 5.
7. Georges Gonthier. A computer-checked proof of the four colour theorem. unpublished, 2005.
8. John Harrison. HOL Light: A tutorial introduction. In Mandayam Srivas and Albert Camilleri, editors, Proceedings of the First International Conference on Formal Methods in Computer-Aided Design, pages 265-269, 1996.
9. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
10. Daniel K. Lee, Karl Crary, and Robert Harper. Towards a mechanized metatheory of standard ML. In Proceedings of the 34th Annual Symposium on Principles of Programming Languages, pages 173-184, New York, NY, USA, 2007. ACM Press.
11. Sam Lindley and Ian Stark. Reducibility and TT-lifting for computation types. In Pawel Urzyczyn, editor, Proceedings of the Seventh International Conference of Typed Lambda Calculi and Applications, pages 262-277, Nara, Japan, April 2005. Springer-Verlag, LNCS 3461.
12. Raymond McDowell and Dale Miller. A logic for reasoning with higher-order abstract syntax: An extended abstract. In Glynn Winskel, editor, Proceedings of the Twelfth Annual Symposium on Logic in Computer Science, pages 434-445, Warsaw, Poland, June 1997. IEEE Computer Society Press.
13. George C. Necula. Proof-carrying code. In Neil D. Jones, editor, Proceedings of the 24th Annual Symposium on Principles of Programming Languages, pages 106-119, Paris, France, January 1997. ACM Press.
14. Julien Narboux and Christian Urban. Formalising in Nominal Isabelle Crary's completeness proof for equivalence checking. In Brigitte Pientka and Carsten Schürmann, editors, Proceedings of the Second International Workshop on Logical Frameworks and Meta-Languages, pages 3-18. Elsevier, ENTCS 196, January 2008.
15. Frank Pfenning. Computation and deduction. Unpublished lecture notes, 277 pp. Revised May 1994, April 1996, May 1992.
16. Frank Pfenning. Structural cut elimination. In D. Kozen, editor, Proceedings of the Tenth Annual Symposium on Logic in Computer Science, pages 156-166, San Diego, California, June 1995. IEEE Computer Society Press.
17. Jeffrey Sarnat and Carsten Schürmann. Structural logical relations. Project page available at http://www.twelf.org/slr, January 2008.
18. W. W. Tait. Intensional interpretation of func-tionals of finite type I. Journal of Symbolic Logic, 32:198-212, 1967.