Computing Ground Reducability and Inductively Complete Positions
暂无分享,去创建一个
[1] Laurent Fribourg. A Strong Restriction of the Inductive Completion Procedure , 1989, J. Symb. Comput..
[2] Jean-Jacques Thiel. Stop losing sleep over incomplete data type specifications , 1984, POPL '84.
[3] Jean-Pierre Jouannaud,et al. Proofs by induction in equational theories without constructors , 1985, Bull. EATCS.
[4] Gillier,et al. Logic for Computer Science , 1986 .
[5] Wolfgang Küchlin,et al. Inductive Completion by Ground Proof Transformation , 1989 .
[6] David A. Plaisted,et al. Semantic Confluence Tests and Completion Methods , 1985, Inf. Control..
[7] Wolfgang Küchlin. Equational completion by proof transformation , 1986 .
[8] Deepak Kapur,et al. A Mechanizable Induction Principle for Equational Specifications , 1988, CADE.
[9] Deepak Kapur,et al. Proof by Consistency , 1987, Artif. Intell..
[10] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.
[11] Nachum Dershowitz,et al. Critical Pair Criteria for Completion , 1988, J. Symb. Comput..
[12] Wolfgang Küchlin,et al. A Confluence Criterion Based on the Generalised Neman Lemma , 1985, European Conference on Computer Algebra.
[13] Emmanuel Kounalis,et al. Completeness in Data Type Specifications , 1985, European Conference on Computer Algebra.
[14] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .
[15] Paliath Narendran,et al. Proof by Induction Using Test Sets , 1986, CADE.
[16] Tobias Nipkow,et al. A decidability result about sufficient-completeness of axiomatically specified abstract data types , 1983 .
[17] Gérard P. Huet,et al. Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).