Inverting inductively defined relations in LEGO

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

Volumn 1512, Issue , 1998, Pages 236-253

  McBride, Conor ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958972598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0097795     Document Type: Conference Paper

References (19)

1. R. M. Burstall. Inductively Defined Relations: A Brief Tutorial. Extended Abstract. In Haveraan, M., and Owe, O., and Dahl, O.-J., editors, Recent Trends in Data Types Specification. Springer LNCS 1130, pp 14-17. 1996.
2. J. Camilleri and T. Melham. Reasoning with Inductively Defined Relations in the HOL Theorem Prover. Technical Report № 265 University of Cambridge Computer Laboratory. 1992.
3. K. Clark. Negation as Failure. pp 293-322 of Logic and Data Bases, edited by H. Gallaire and J. Minker. Plenum Press. 1978.
4. C. Cornes, J. Courant, J.F. Fillaitre, G. Huet, C. Murthy, C. Parent, C. Paulin, B. Werner. The Coq Proof Assistant Reference Manual, Version 5.10. Projet Coq, Inria-Rocquencourt and CNRS-ENS Lyon, France.
5. C. Cornes. Compilation du Filtrage avec Types Dépendants dans le Système Coq. Actes de la réunion du pôle Spécification et Preuves du GDR Programmation. Orleans, Novembre 1996.
6. C. Cornes, D. Terrasse. Automating Inversion of Inductive Predicates in Coq. In BRA Workshop on Types for Proofs and Programs, Turin, June 1995. To appear in LNCS series.
7. L.-H. Eriksson. A finitary version of the calculus of partial inductive definitions. In: L.-H. Eriksson, L. Hallnas & P. Schroeder-Heister (editors), Extensions of Logic Programming. Second International Workshop, ELP-91, Stockholm. Springer LNCS 596, pp 89-134. 1992.
8. P. Dybjer. Inductive Sets and Families in Martin-Löf’s Type Theory. pp 280-306 of Logical Frameworks, edited by G. Huet and G. Plotkin. CUP 1991.
9. E. Giminez. Codifying guarded definitions with recursive schemes. Proceedings of Types 94, pp39-59.
10. L. Hallnäs. Partial Inductive Definitions. Theoretical Computer Science. Vol. 87. pp 115-142. 1991.
11. Introduction to HOL; A theorem proving environment for higher order logic. Edited by M.J.C. Gordon and T.F. Melham. CUP 1993.
12. Jean-Pierre Jouannaud and Claude Kirchner. Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification. pp 257-321 of Computational Logic: Essays in Honor of Alan Robinson, edited by Jean-Louis Lassez and Gordon Plotkin, MIT Press, 1991.
13. Zhaohui Luo. Computation and Reasoning: A Type Theory for Computer Science. OUP 1994.
14. Zhaohui Luo, Randy Pollack. LEGO Proof Development System: User Manual. Technical Note, 1992.
15. Lena Magnusson. The Implementation of ALF. PhD Thesis. Chalmers University of Technology and University of Goteborg, Sweden. January 1995.
16. L. Paulson. Logic and Computation: Interactive Proof with Cambridge LCF. Cambridge Tracts in Theoretical Computer Science 2. CUP 1987.
17. Randy Pollack. Incremental Changes in LEGO: Technical Note, 1994.
18. Prawitz, D.. Natural Deduction: A Proof-Theoretical Study. Almqvist & Wiksell. Stockholm, 1965.
19. H. Tamaki, T. Sato. Unfold/Fold Transformation of Logic Programs. Proceedings of Second International Logic Programming Conference. pp 127-138. Uppsala, 1984.