Inductive-Data-Type Systems (2002)

by Frederic Blanqui , Jean-Pierre Jouannaud , Mitsuhiro Okada
Citations:754 - 22 self

Active Bibliography

11 Rewrite Proofs and Computations – Jean-pierre Jouannaud - 1995
567 Term Rewriting Systems – J. W. Klop - 1992
454 Rewriting – Nachum Dershowitz, David A. Plaisted - 2001
83 Natural termination – Nachum Dershowitz, Charles Hoot
10 Knowledge Representation and Classical Logic – Vladimir Lifschitz, Leora Morgenstern
Chapter 1 Knowledge Representation and Classical Logic – Edited F. Van Harmelen, V. Lifschitz, B. Porter, Vladimir Lifschitz, Leora Morgenstern, David Plaisted
2 Proving First-Order Equality Theorems with Hyper-Linking – Geoffrey David Alexander - 1995
16 Simple Termination of Rewrite Systems – Aart Middeldorp, Hans Zantema - 1997
29 Bi-rewrite systems – Jordi Levy, Jaume Agusti - 1996
24 Category-based Semantics for Equational and Constraint Logic Programming – Razvan Diaconescu - 1994
2 Linear and Unit-Resulting Refutations for Horn Theories – Peter Baumgartner - 1995
5 Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems – Keiichirou Kusakari - 2000
3 Theorem Proving with Transitive Relations from a Practical Point of View – W. Marco Schorlemmer, Jaume Agusti - 1995
122 Completion Without Failure – Leo Bachmair, Nachum Dershowitz, David A. Plaisted - 1989
3 A Generalized Approach to Equational Unification – Katherine Anne Yelick - 1985
18 Any Ground Associative-Commutative Theory Has a Finite Canonical System – Paliath Narendran, MichaĆ«l Rusinowitch - 1991
10 Simple Termination Revisited – Aart Middeldorp, Hans Zantema - 1994
1 A Constructive Proof of the Topological Kruskal Theorem – Jean Goubault-larrecq
A Glimpse at Veblen Hierarchies – n.n.