An algorithm for checking incomplete proof objects in type theory with localization and unification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1158 LNCS, Issue , 1996, Pages 183-200

  Magnusson, Lena ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC OPERATION; EXPLICIT SUBSTITUTIONS; LOCAL CONTEXTS; PROOF-EDITING; TYPE CORRECTNESS; TYPECHECKING; UNIFICATION ALGORITHMS; UNIFICATION PROBLEM;

COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES;

ALGORITHMS;

EID: 21444447250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61780-9_70     Document Type: Conference Paper

References (14)

1. H. P. Barendregt. Introduction to Generalized Type Systems. J. Functional Programming, 1(2):125-154, April 1991.
2. Thierry Coquand. An algorithm for testing conversion in type theory. In Logical Frameworks. Cambridge University Press, 1991.
3. Gilles Dowek. A Complete Proof Synthesis Method for the Cube of Type Systems. Journal of Logic and Computation, 3(3):287-315, 1993.
4. Conal M. Elliot. Higher-order unification with dependent function types. In N. Dershowitz, editor, Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, pages 121-136, April 1989.
5. W. A. Howard. The formulae-as-types notion of construction. In J. P. Seldin and J. R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479-490. Academic Press, London, 1980.
6. Gerard Huet. A unification algorithm for typed A-calculus. Theoretical Computer Science, 1(1):27-57, 1975.
7. Lena Magnusson. The Implementation of ALF - a Proof Editor based on Martin-Löf's Monomorphic Type Theory with Explicit Substitution. PhD thesis, Goteborg University and Chalmers University of Technology, January 1995.
8. Lena Magnusson and Bengt Nordstróm. The ALF proof editor and its proof engine. In Types for Proofs and Programs, LNCS, pages 213-237, Nijmegen, 1994. Springer-Verlag.
9. James McKinna and Randy Pollack. Pure type system formalized. In M. Bezem and J.F. Groote, editors, Proceeding of the International Conference on Typed Lambda Calculi and Applications, TLCA '93, pages 289305. Springer-Verlag, LNCS 664, March 1993.
10. Randy Pollack. Closure under Alpha conversion. In The Informal Proceeding of the 1993 Workshop on Types for Proofs and Programs, May 1993.
11. David Pym. A unification algorithm for the logical framework. Technical Report ECS-LFCS-92-229, University of Edinburgh, August 1992.
12. Anne Salvesen. Polymorphism and Monomorphism in Martin-Löf's Type Theory. Technical report, Norwegian Computing Center, P.b. 114, Blindern, 0316 Oslo 3, Norway, December 1988.
13. Alvaro Tasistro. Formulation of Martin-Löf 's Theory of Types with Explicit Substitution. Licentiate Thesis, Chalmers University of Technology and University of Goteborg, Sweden, May 1993.
14. L. Thery, Y. Bertot, and G. Kahn. Real Theorem Provers Deserve Real User-Interfaces. Technical Report 1684, INULA. Sophia-Antipolis, May 1992.