论文信息 - Inverting Inductively Defined Relations in LEGO - 字舞流文

Inverting Inductively Defined Relations in LEGO

Conor McBride | Conor McBride

[1] Lars Hallnäs. Partial inductive definitions , 1991 .

[2] Hugo Herbelin,et al. The Coq proof assistant : reference manual, version 6.1 , 1997 .

[3] Zhaohui Luo,et al. Computation and reasoning - a type theory for computer science , 1994, International series of monographs on computer science.

[4] Lawrence C. Paulson,et al. Logic and computation - interactive proof with Cambridge LCF , 1987, Cambridge tracts in theoretical computer science.

[5] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[6] P. Dybjer. Inductive sets and families in Martin-Lo¨f's type theory and their set-theoretic semantics , 1991 .

[7] Hisao Tamaki,et al. Unfold/Fold Transformation of Logic Programs , 1984, ICLP.

[8] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.

[9] D. Prawitz. Natural Deduction: A Proof-Theoretical Study , 1965 .

[10] Rod M. Burstall. Inductively Defined Relations: A Brief Tutorial (Extended Abstract) , 1995, COMPASS/ADT.

[11] Lars-Henrik Eriksson. A Finitary Version of the Calculus of Partial Inductive Defintions , 1991, ELP.

[12] Cristina Cornes,et al. Automating Inversion of Inductive Predicates in Coq , 1995, TYPES.

[13] Eduardo Giménez,et al. Codifying Guarded Definitions with Recursive Schemes , 1994, TYPES.

[14] Tom Melham,et al. Reasoning with Inductively Defined Relations in the HOL Theorem Prover , 1992 .