Untyped algorithmic equality for martin-löf's logical framework with surjective pairs

Lecture Notes in Computer Science

Volumn 3461, Issue , 2005, Pages 23-38

  Abel, Andreas ^a   Coquand, Thierry ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

ALGORITHMIC EQUALITY; MARTIN-LÖF'S LOGICAL FRAMEWORK; PARTIAL EQUIVALENCE RELATIONS; ΒΗ-EQUALITY;

LOGIC PROGRAMMING;

EID: 24944443398     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417170_4     Document Type: Conference Paper

References (16)

1. [AC05] A. Abel and T. Coquand. Untyped algorithmic equality for Martin-Löf's logical framework with surjective pairs (extended version). Tech. rep., Department of Computer Science, Chalmers, Göteborg, Sweden, 2005.
2. [Ada01] R. Adams. Decidable equality in a logical framework with sigma kinds, 2001. Unpublished note, see http://www.cs.man.ac.uk/~radams/.
3. [Bar84] H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North Holland, Amsterdam, 1984.
4. [Coq91] T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, eds., Logical Frameworks, pp. 255-279. Cambridge University Press, 1991.
5. [Coq96] T. Coquand. An algorithm for type-checking dependent types. In Mathematics of Program Construction (MPC 1995), vol. 26 of Science of Computer Programming, pp. 167-177. Elsevier Science, 1996.
6. [CPT03] T. Coquand, R. Pollack, and M. Takeyama. A logical framework with dependently typed records. In Typed Lambda Calculus and Applications, TLCA'03, vol. 2701 of Lecture Notes in Computer Science. Springer, 2003.
7. [Gog99] H. Goguen. Soundness of the logical framework for its typed operational semantics. In J.-Y. Girard, ed., Typed Lambda Calculi and Applications, TLCA 1999, vol. 1581 of Lecture Notes in Computer Science. Springer, 1999.
8. [Gog05] H. Goguen. Justifying algorithms for βη conversion. In FoSSaCS 2005. To appear.
9. [HHP93] R. Harper, F. Honsell, and G. Plotkin. A Framework for Defining Logics. Journal of the Association of Computing Machinery, 40(1):143-184, 1993.
10. [HP05] R. Harper and F. Pfenning. On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic, 6(1):61-101, 2005.
11. [Klo80] J. W. Klop. Combinatory reducion systems. Mathematical Center Tracts, 27, 1980.
12. [NPS00] B. Nordström, K. Petersson, and J. Smith. Martin-löfs type theory. In Handbook of Logic in Computer Science, vol. 5. Oxford University Press, 2000.
13. ∑: The metatheory of LF with ∑ types, 2004. Unpublished technical report, kindly provided by Garsten Schürmann.
14. [Vau04] L. Vaux. A type system with implicit types, 2004. English version of his mémoire de maîtrise.
15. [VC02] J. C. Vanderwaart and K. Crary. A simplified account of the metatheory of Linear LF. Tech. rep., Dept. of Comp. Sci., Carnegie Mellon, 2002.
16. [Vou04] J. Vouillon. Subtyping union types. In J. Marcinkowski and A. Tarlecki, eds., Computer Science Logic, CSL'04, vol. 3210 of Lecture Notes in Computer Science, pp. 415-429. Springer, 2004.