Sequent schema for derived rules

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

Volumn 2410, Issue , 2002, Pages 281-297

  Nogin, Aleksey ^a   Hickey, Jason ^b  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

CONSERVATIVITY; INFERENCE RULES; LOGICAL THEORIES; SCHEMA LANGUAGE; THEOREM PROVERS;

THEOREM PROVING;

EID: 32044469423     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45685-6_19     Document Type: Conference Paper

References (12)

1. Robert L. Constable, Stuart F. Allen, H.M. Bromley, W.R. Cleaveland, J.F. Cre-mer, R W Harper, Douglas J Howe, T.B. Knoblock, N P Mendler, P Panangaden, James T. Sasaki, and Scott F. Smith. Implementing Mathematics with the NuPRL Development System. Prentice-Hall, NJ, 1986.
2. Michael Gordon and T. Melham. Introduction to HOL: A Theorem Proving Environment for Higher-Oder Logic. Cambridge University Press, Cambridge, 1993.
3. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defininglogics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993. A revised and expanded verion of '87 paper.
4. Jason J. Hickey. The MetaPRL Logical Programming Environment. PhD thesis, Cornell University, Ithaca, NY, January 2001.
5. Jason J. Hickey and Aleksey Nogin. Fast tactic-based theorem proving. In J. Harrison and M. Aagaard, editors, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science, pages 252-266. Springer-Verlag, 2000.
6. Jason J. Hickey, Aleksey Nogin, Alexei Kopylov, et al. MetaPRL home page. http://metaprl.org/.
7. Gerard P. Huet and Bernard Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31-55, 1978.
8. Alexei Kopylov. Dependent intersection: A new way of definingrecords in type theory. Department of Computer Science TR2000-1809, Cornell University, 2000.
9. Pavel Naumov, Mark-Olivar Stehr, and Jose Meseguer. The HOL/NuPRL proof translator: A practical approach to formal interoperability. In The 14th International Conference on Theorem Proving in Higher Order Logics, Edinburgh, Scotland, Lecture Notes in Computer Science, pages 329-345. Springer-Verlag, September 2001.
10. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828. Springer-Verlag, New York, 1994.
11. Frank P fenning. Elf: A language for logic definition and verified metaprogramming. In Proceedings ofFourth Annual Symposium on Logic in Computer Science, pages 313-322, Pacific Grove, California, June 1989. IEEE Computer Society Press.
12. Frank P fenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN'88 Conference on Programming Language Design and Implementation (PLDI), pages 199-208, Atlanta, Georgia, June 1988. ACM Press.