A Framework for Defining Logics

Journal of the ACM (JACM)

Volumn 40, Issue 1, 1993, Pages 143-184

  Harper, Robert ^a   Honsell, Furio ^b   Plotkin, Gordon ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Formal systems; interactive theorem proving; proof checking; typed lambda calculus

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FORMAL LANGUAGES; THEOREM PROVING;

EDINBURGH LOGICAL FRAMEWORK; INTERACTIVE THEOREM PROVING; PROOF CHECKING; TYPED LAMBDA CALCULUS; VERIFICATION;

FORMAL LOGIC;

EID: 0027353175     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/138027.138060     Document Type: Article

References (55)

1. ANDREWS, P. B. Resolution in type theory. J. Symb. Logic 36 (1971). 414-432.
2. AVRON, A. Simple consequence relations. Inf. Comput. 91, 1 (1991). 105-139.
3. AVRON, A., HONSELL, F., AND MASON, I. A. An overview of the Edinburgh logical framework. In Current Trends in Hardware Verification and Automated Theorem Prov?ng, G. Birtwistle and P. A. Subramanyam, Eds. Springer-Verlag, New York, 1989, pp. 323-240.
4. AVRON, A., HONSELL, F., MASON, I. A., AND POLLACK, R. Using typed lambda calculus to implement formal systems on a machine. J. Automated Reas., to appear.
5. BURSTALL, R., AND HONSELL, F. Operational semantics in a natural deduction setting. In Logical Frameworks, G. Huet and G. Plotkin, Eds. Cambridge University Press, Cambridge, Mass., 1991, pp. 185-213.
6. CHURCH, A. A formulation of the simple theory of types. J. Symb Logic 5 (1940), 56-68.
7. CLOCKSIN, W., AND MELLISH, C. S. Programming in PROLOG. Spr?nger-Verlag, New York, 1981.
8. CONSTABLE, R., AND HOWE, D. NuPRL as a general logic. In Logic and Computation, P. Odifreddi, Ed. Academic Press, Orlando, Fla., pp. 77-90.
9. CONSTABLE, R. L., ALLEN, S. F., BRAMLEY, H. M., CLEAVELAND, W. R., CREMER, J. F., HARPER, R. W., HOWE, D. S., KNOBLOCK, T. B., MENDLER, N. P., PANANGADEN, P., SASAKI, J. T., AND SMITH, S. F. Implementing Mathematics with the NuPRL Proof Development System. Prentice-Hall, Englewood Cliffs, N.J., 1986.
10. COQUAND. T. Une Théorie des Constructions. Ph.D dissertation. Université Paris VII, Paris, France, Jan. 1985.
11. COQUAND, T. An algorithm for testing conversion in type theory. In Log?cal Frameworks, G. Huet and G. Plotkin, Eds. Cambridge University Press, Cambridge Mass., 1991, pp. 255-279.
12. COQUAND, T., AND HUET, G. Constructions: A higher-order proof system for mechanizing mathematics. In EUROCAL ′85: European Conference on Computer Algebra, B. Buchberger, Ed. Lecture Notes in Computer Science, vol. 203. Springer-Verlag, New York, 1985, pp. 151-184.
13. COQUAND, T., AND HUET, G. The calculus of constructions. Inf. Comput. 76, 2/3 (Feb./Mar. 1988), 95-120.
14. CURRY, H. B., AND FEYS, R. Combinatory Logic. North-Holland, Amsterdam, The Netherlands, 1958.
15. DE BRUIJN, N. G. A survey of the project AUTOMATH. In To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism, J. P. Seddin and J. R. Hindley, Eds. Academic Press, New York, 1980, pp. 589-606.
16. ELLIOTT, C. Extensions and applications of higher-order unification, PhD dissertation. School of Computer Science, Carnegie-Mellon University, Pittsburgh, Pa., May 1990.
17. FEFERMAN, S. Finitary inductively presented logics. In Logic Colloquium, ′88 (Amsterdam, The Netherlands). North Holland, Amsterdam, The Netherlands, 1989, pp. 191-220.
18. FELTY, A. Specifying and implementing theorem provers in a higher-order logic programming language. Ph.D dissertation. Department of Computer and Information Science, Univ. Pennsylvania, Philadelphia, Pa., July 1989.
19. GORDON, M., MILNER, R., AND WADSWORTH, C. Edinburgh LCF: A Mechanized Logic of Computation. In Lecture Notes in Computer Science, vol. 78, Springer-Verlag, New York, 1979.
20. GRIFFIN, T. An environment for formal systems. Tech. Rep. 87-846. Cornell Univ. Ithaca, N.Y., June 1987.
21. HARPER, R. An equational formulation of LF. Tech. Rep. ECS-LFCS-88-67. Laboratory for the Foundations of Computer Science, Edinburgh University, Edinburgh, Scotland, Oct. 1988.
22. HARPER, R. Systems of polymorphic type assignment in LF. Tech. Rep. CMU-CS-90-144. School of Computer Science, Carnegie-Mellon University, Pittsburgh, Pa., June 1990.
23. HOWARD, W. A. The formulas-as-types notion of construction. In To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism. Academic Press, Orlando, Fla., 1980, pp. 479-490.
24. HUET, G. P. Unification for typed lambda calculus. Theoret. Comput. Sci. 1, 1 (June 1975), 27-58.
25. HUET, G., AND PLOTKIN, G., EDS. Logical Frameworks. Cambridge University Press, Cambridge, Mass., 1991.
26. JUTITNG, L. S. Checking Landau's grundlagen in the AUTOMATH system. Ph.D. dissertation. Eindhoven Univ., Eindhoven, The Netherlands, 1977.
27. MARTIN-LOF, P. About models for intuitionistic type theories and the notion of definitional equality. In Proceedings of the 3rd Scand?navian Logic Symposium, S. Kange, Ed., Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, The Netherlands, 1975, pp. 81-109.
28. MARTIN-LOF, P. An intuitionistic theory of types: Predicative part. In Logic Colloquium ′73 H. E. Rose and J. C. Shepherdson, Eds. Studies in Logic and the Foundations of Mathematics, vol. 80. North-Holland, Amsterdam, The Netherlands, 1975, pp. 73-118.
29. MARTIN-LöF, P. Constructive mathematics and computer programming. In Proceedings of the 6th International Congress for Logic, Methodology, and Philosophy of Science. North-Holland, Amsterdam, The Netherlands, pp. 153-175.
30. MARTIN-LöF, P. On the meanings of the logical constants and the justifications of the logical laws. Tech. Rep. 2, Scuola di Specializzazione in Logica Matematica. Dipartimento di Matematica, Università di Siena, Sienna, Italy.
31. MARTIN-LöF, P. Truth of a proposition, evidence of a judgment, validity of a proof. Lecture given at the workshop. Theor?es of Meaning, Florence, Italy, June 1985 (Available from P. Martin-Löf).
32. MENDLER, P. F., AND ACZEL, P. The notion of a framework and a framework for LTC. In Proceedings of the 3rd Symposium on Logic in Computer Science (Edinburgh, Scotland, July) IEEE, New York, 1988, pp. 392-401.
33. MEYER, A. R. AND REINHOLD, M. B. “Type” is not a type: Preliminary report. In Proceed?ngs of the 13th Annual ACM Sympos?um on Principles of Programm?ng Languages (St. Petersburg Beach, Fla. Jan. 13-15). ACM, New York, 1986, pp. 287-295.
34. MILNER, R., TOFTE, M., AND HARPER, R. The Definition of Standard ML. MIT Press, Cambridge, Mass., 1990.
35. MITCHELL, J. C. Type systems for programming languages. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Formal models and semantics, vol. B. Elsevier, Amsterdam, The Netherlands, 1991, ch. 8, pp. 365-458.
36. NORSTRÖM, B., PETERSSON. K., AND SMITH, J. M. Programming Mart?n-Löf's type theory. An introduction. In International Series of Monographs on Computer Science, vol. 7. Oxford University Press, Oxford, England, 1990.
37. PAULSON, L. Interactive theorem proving with Cambridge LCF. Tech. Rep. 80, Computer Laboratory, Univ. Cambridge, Cambridge, Mass., Nov. 1985.
38. PAULSON. L. Natural deduction proof as higher-order resolution. J. Logic Program. 3 (1986). 237-258.
39. PAULSON, L. The foundations of a generic theorem prover. Tech. Rep. 130, Computer Laboratory, Univ. Cambridge, Cambridge, Mass., 1987.
40. PETERSSON, K. A programming system for type theory. Tech. Rep. 21, Programming Methodology Group, Univ. Göteborg/Chalmers Institute of Technology, Göteborg, Sweden, Mar. 1982.
41. PFENNING, F. Logic programming in the LF logic framework. In Log?cal Frameworks, G. Huet and G. Plotkin, Eds. Cambridge University Press, Cambridge, Mass., 1991, pp. 149-182.
42. PLOTKJN, G. Call-by-name, call-by-value, and the lambda calculus. Theoret. Comput. Sc?. 1 (1975), 125-159.
43. PRAWITZ, D. Natural Deduction: A Proof-Theoretical Study. Almquist & Wiksell, Stockholm, Sweden, 1965.
44. PYM, D. Proofs, search and computation in general logic Ph D. dissertation. Edinburgh University, Edinburgh, Scotland, 1990. Available as Edinburgh University Computer Science Department Technical Report ECS-LFCS-90-125.
45. PYM, D. AND WALLEN, L. Proof search in the calculus. In Log?cal Frameworks, G. Huet and G. Plotkin, Eds. Cambridge University Press, Cambridge, Mass., 1991.
46. REPS, T. W., AND TEITELBAUM, T. The synthesizer generator reference manual. Tech. Rep., Cornell University, Ithaca, N.Y., 1987.
47. ROBINSON, J. A. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (Jan. 1965), 23-41.
48. SALVESEN, A. A proof of the Church-Rosser property for the Edingbugh LF with?-conversion. Lecture given at the First Workshop on Logical Frameworks, Sophia-Antipolis, France. May 1990.
49. SCHOENFIELD, J. R. Mathematical Log?c. Addison-Wesley, Reading, Mass., 1967.
50. SCHRÖDER-HEISTER, P. A natural extension of natural deduction. J. Symb. Log?c 49, 4 (Dec. 1984), 1284-1300.
51. SCHÜTTE, K. Proof Theory. Springer-Verlag, New York, 1977.
52. SELDIN, J. P., AND HINDLEY, J. R., EDS. To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formal?sm. Academic Press, Orlando, Fla., 1980
53. STENLUND, S. Combinators, S-terms and Proof Theory. D. Reidel, Dordrecht, Holland, 1972.
54. TAKEUTI, G. Proof Theory. North-Holland, New York, 1975.
55. VAN DAALEN, D. T. The language theory of AUTOMATH. Ph.D dissertation. Technical University of Eindhoven, Eindhoven. The Netherlands, 1980.