Optimized encodings of fragments of type theory in first-order logic

Journal of Logic and Computation

Volumn 8, Issue 6, 1998, Pages 713-744

  Tammet, Tanel ^a   Smith, Jan M ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Alf; Automated theorem proving; First order logic; Gandalf; Martin L f's type theory

Indexed keywords

AUTOMATION; ENCODING (SYMBOLS); FORMAL LOGIC; OPTIMIZATION;

FIRST ORDER LOGIC; MARTIN-LOF TYPE THEORY;

THEOREM PROVING;

EID: 0032266817     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/8.6.713     Document Type: Article

References (22)

1. P. Aczel. The strength of Martin-Löf's type theory with one universe. In Proceedings of the Symposium on Mathematical Logic, Oulu, 1974, pp. 1-32. Report No 2, Department of Philosophy, University of Helsinki, 1977.
2. L. Augustsson, T. Coquand and B. Nordström. A short description of Another Logical Framework. In Proceedings of the First Workshop on Logical Frameworks, Antibes, pp. 39-42, 1990.
3. H. Barendregt. The Lambda Calculus. North Holland, 1981.
4. T. Tammet, C. Fermüller, A. Leitsch and N. Zamov. Resolution Methods for the Decision Problem, volume 679 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin and Heidelberg, 1993.
5. C. Green. Application of theorem-proving to problem solving. In Proceedings of the 1st International Joint Conference on Artificial Intelligence, pp. 219-239, 1969.
6. C. L. Chang and R. C. T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.
7. T. Coquand. Pattern matching with dependent types. In Proceedings of the Logical Framework Workshop at Båstad, June 1992.
8. T. Coquand, B. Nordström, J. M. Smith and B. von Sydow. Type theory and programming. EATCS, 52, February 1994.
9. T. Franzen, D. Sahlin and S. Haridi. An intuitionistic predicate logic theorem prover. Journal of Logic and Computation, 2, 619-656, 1992.
10. A. Felty and D. Miller. Encoding a dependent-type λ-calculus in a logic programming language. In Proceedings of CADE-10. Lecture Notes in Artificial Intelligence 449, Springer Verlag, 1990.
11. W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13, 225-230, 1981.
12. G. Peterson. A technique for establishing completeness results in theorem proving with equality. SIAM Journal of Computing, 12, 82-100, 1983.
13. G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1, 27-57, 1975.
14. L. Magnusson. The new Implementation of ALF. In The Informal Proceeding of the Logical Framework Workshop, Båstad, 1992.
15. D. Miller. Proofs in Higher Order Logics. PhD thesis, Carnegie Mellon University, 1983.
16. D. Miller. A compact representation of proofs. Studia Logica, 46, 1987.
17. G. Mints. Gentzen-type systems and resolution rules. part I. prepositional logic. In COLOG-88, volume 417 of Lecture Notes in Computer Science, pp. 198-231. Springer Verlag, 1990.
18. G. Mints. Resolution strategies for the intuitionistic logic. In Constraint Programming, volume 131 of NATO ASI Series F, pp. 289-311. Springer Verlag, 1994.
19. B. Nordström, K. Petersson, and J. M. Smith. Programming in Martin-Löf's Type Theory. An Introduction. Oxford University Press, 1990.
20. J. A. Robinson. A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM, 12, 23-41, 1965.
21. J. Smith. An interpretation of Martin-Löf's type theory in a type-free theory of propositions. Journal of Symbolic Logic, 49. 730-753, 1984.
22. T. Tammet. A resolution theorem prover for intuitionistic logic. In CADE-13, volume 1104 of Lecture Notes in Computer Science, pp. 2-17. Springer Verlag, 1996.