Structuring metatheory on inductive definitions

Information and Computation

Volumn 162, Issue 1-2, 2000, Pages 80-95

  Basin, David ^a   Matthews, Seán ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b IBM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; MAPPING; PROBLEM SOLVING;

METATHEOREMS;

THEOREM PROVING;

EID: 0034634021     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2858     Document Type: Article

References (16)

1. Avron, A., Honsell, F., Mason, I., and Pollack, R. (1992), Using typed lambda calculus to implement formal systems on a machine, J. Automat. Reason. 9, 309-352.
2. Basin D., and Constable, R. (1993), Metalogical frameworks, in "logical Environments" (G. Huet and G. Plotkin, Eds.), Cambridge Univ. Press, Cambridge, UK.
3. Constable, R. et al. (1986), "Implementing Mathematics with the Nuprl Proof Development System," Prentice-Hall, Englewood Cliffs, NJ.
4. Farmer, W. M., Guttman, J. D., and Thayer, F. J. (1992), Little theories, in "Proc. CADE-11" (D. Kapur, Ed.), pp. 567-581, Springer-Verlag, Berlin.
5. Feferman, S. (1990), Finitary inductive systems, in "Logic Colloquium '88," pp. 191-220, North-Holland, Amsterdam.
6. Gordon, M., and Melham, T. (1993), "Introduction to HOL: A Theorem Proving Environment for Higher Order Logic," Cambridge Univ. Press, Cambridge, UK.
7. Gordon, M. J., Milner, R., and Wadsworth, C. P. (1979), "Edinburgh LCF: A Mechanized Logic of Computation," Springer-Verlag, Berlin.
8. Hindley, J. R., and Seldin, J. P. (1986), Introduction to Combinators and λ-Calculus, Cambridge Univ. Press, Cambridge, UK.
9. MacQueen, D. B. (1986), Using dependent types to express modular structure, in "Proc. 13th Ann. ACM Symp. Principles of Programming Languages," pp. 227-286, Assoc. Comput. Mach., New York.
10. 0 in Isabelle: adding structure at the metalevel, in "Proc. Disco '96" (J. Calmet and C. Limongelli, Eds.), Springer-Verlag, Berlin.
11. Mitchell, J. C., and Plotkin, G. (1985), Abstract types have existential type, in "Proc. 12th Ann. ACM Symp. Principles of Programming Languages," pp. 37-51, Assoc. Comput. Mach., New York.
12. Paulson, L. C. (1994), A fixedpoint approach to implementing (co) inductive definitions, in "Proc. CADE-12" (A. Bundy, Ed.), pp. 148-161, Springer-Verlag, Berlin.
13. Paulson, L. C. (1994), Isabelle: A Generic Theorem Prover, Springer-Verlag, Berlin.
14. Paulson, L. C. (1995), Set theory for verification: II. Induction and recursion, J. Automat. Reason. 15, 167-215.
15. Prawitz, D. (1965), "Natural Deduction," Almqvist and Wiksell, Stockholm.
16. Troelstra, A. S. (1982), "Metamathematical Investigation of Intuitionistic Arithmetic and Analysis," Springer-Verlag, Berlin.