Computational reflection in the calculus of constructions and its application to theorem proving

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

Volumn 1210, Issue , 1997, Pages 319-335

  Ruetß, Harald ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; COMPUTATION THEORY; PATHOLOGY; SEMANTICS;

CALCULUS OF CONSTRUCTION; COMPUTATIONAL REFLECTION; ENCODE FUNCTIONS; ITS APPLICATIONS; PROOF DEVELOPMENT; REFINEMENT METHODS; SEMANTIC RELATIONS; SYNTACTIC REPRESENTATION;

THEOREM PROVING;

EID: 84958955675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62688-3_44     Document Type: Conference Paper

References (22)

1. S.F. Allen, R.L. Constable, D.J. Howe, and W.E. Aitken. The Semantics of Reflected Proof. In Proc. 5th Annual IEEE Symposium on Logic in Computer Science, pages 95-105. IEEE CS Press, 1990.
2. R.S. Boyer and J.S. Moore. Metafunctions: Proving them Correct and Using them Efficiently as New Proof Procedures. In R.S. Boyer and J.S. Moore, editors, The Correctness Problem in Computer Science, chapter 3. Academic Press, 1981.
3. T. Coquand and G. Huet. Constructions: a Higher-Order Proof System for Mechanizing Mathematics. In B. Buchberger, editor, EUROCAL'85: European Conference on Computer Algebra, volume 203 of Lecture Notes in Computer Science, pages 151-184. Springer-Verlag, 1985.
4. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2/3):95-120, 1988.
5. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
6. M.J. Gordon, A. J. R. Milner, and C. P. Wadsworth. Edinburgh LCF: a Mechanized Logic of Computation, volume 78 of Lecture Notes in Computer Science. Springer- Verlag, Berlin, 1979.
7. R. Harper and R. Pollack. Type Checking, Universal Polymorphism, and Type Ambiguity in the Calculus of Constructions. In TAPSOFT'89, volume II, Lecture Notes in Computer Science, pages 240-256. Springer-Verlag, 1989.
8. J. Harrison. Metatheory and Reflection in Theorem Proving: A Survey and Critique. Technical Report CRC-053, SRI Cambridge, UK, 1995. See http://~rw.cl.cam.ac.uk/ftp/hvg/papers.
9. D.J. Howe. Computational Metatheory in Nuprl. In Proc. 9th International Conference on Automated Deduction, volume 310, pages 238-257. Springer-Verlag Lecture Notes in Computer Science, 1988.
10. D.J. Howe. Reflecting the Semantics of Reflected Proof. In P. Aczel, H. Simmons, and S. Wainer, editors, Proof Theory, pages 227-250. Cambridge University Press, 1992.
11. T.B. Knoblock and R.L. Constable. Formalized Metareasoning in Type Theory. In Proceedings of LICS, pages 237-248. IEEE, 1986. Also available as technical report TR 86-742, Department of Computer Science, Cornell University.
12. G. Kreisel and A. Lèvy. Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems. Zeitschrift für math. Logik und Grundlagen der Mathematik, Bd. 14:97-142, 1968.
13. Z. Luo. CCω⊂ and its Metatheory. Technical Report ECS-LFCS-88-57, Laboratory for the Foundations of Computer Science, Edinburgh University, July 1988.
14. Z. Luo and R. Pollack. The Lego Proof Development System: A User's Manual. Technical Report ECS-LFCS-92-211, University of Edinburgh, 1992.
15. T. Mogensen. Efficient Self-Interpretation in Lambda Calculus. J. Functional Programming, 2(3):345-364, 1992.
16. B. Nordström, K. Petersson, and J.M. Smith. Programming in Martin-Löf's Type Theory. Number 7 in International Series of Monographs on Computer Science. Oxford Science Publications, 1990.
17. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal Verification for Fault- Tolerant Architectures: Prolegomena to the Design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, February 1995.
18. F. Pfenning and P. Lee. Metacircularity in the Polymorphic A-Calculus. Theoretical Computer Science, 89:137-159, 1991.
19. H. Ruefl. Formal Meta-Programming in the Calculus of Constructions. PhD thesis, Universität Ulm, 1995.
20. H. Ruefl. Reflection of Formal Tactics in a Deductive Reflection Framework. In M.A. McRobbie and J.K.Slaney, editors, Automated Deduction - CADE-13, volume 1104 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
21. F. W. von Henke. An Algebraic Approach to Data Types, Program Verification, and Program Synthesis. In Mathematical Foundations of Computer Science, Proceedings, volume 45 of Lecture Notes in Computer Science. Springer-Verlag, 1976.
22. R. W. Weyhrauch. Prolegomena to a Theory of Mechanized Formal Reasoning. Artificial Intelligence, 13(1):133-170, 1980.