Summary of the lecture  (Make Corrections)  
Inductionless Induction Lecture Notes Hubert Comon October 30, 1995 CNRS and...

 @ NUS   Home/Search   Context   Related

 
View or download:
lri.fr/LRI/article...ourschambery.ps.Z
lsv.enscachan.fr/~...courschambery.ps
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  fermivista.math.juss...ftp.lri.fr (more)
From:  lsv.enscachan.fr/~comon...biblio
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 1.45> ? The main contribution of rewrite theory was first to explicitly give some axiomatizations A for which the above method is indeed correct and for which the consistency of E 0 [A is decidable. Several such sets of axioms A have been successively (and successfully) proposed, each of them assuming some strong properties of E. For example, D. Musser [22] assumes that E contains an equational axiomatization of equality, and A is the set ftrue 6= falseg. G. Huet and J.-M. Hullot [15]... (Update)

Similar documents (at the sentence level):
26.3%:   Inductionless Induction - Comon (1994)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Algebraic System Specification and Development.. - Cerioli, Gogolla, .. (1997)   (Correct)
0.4:   Ground Reducibility is EXPTIME-complete - Comon, Jacquemard (1998)   (Correct)
0.4:   Rewrite Proofs and Computations - Jouannaud (1995)   (Correct)

Similar documents based on text:   More   All
0.4:   Proof by Consistency - A Literature Survey - Steel   (Correct)
0.2:   Proof by Consistency in Constructive Systems with Final Algebra.. - Lysne (1992)   (Correct)
0.2:   Automated Mathematical Induction - Bouhoula, Kounalis, Rusinowitch (1992)   (Correct)

BibTeX entry:   (Update)

@misc{ course-summary,
  author = "The Course",
  title = "Summary of the Lecture",
  url = "citeseer.comp.nus.edu.sg/129454.html" }
Citations (may not include all citations):
788   Rewrite systems - Dershowitz, Jouannaud - 1990
151   Proving termination with multiset orderings (context) - Dershowitz, Manna - 1979
70   Equational problems and disunification (context) - Comon, Lescanne - 1989
68   Proofs by induction in equational theories with constructors (context) - Huet, Hullot - 1982
58   Canonical Equational Proofs (context) - Bachmair - 1991
51   Proof by consistency in equational theories (context) - Bachmair - 1988
50   Semantic confluence tests and completion methods (context) - Plaisted - 1985
50   Proving inductive properties of abstract data types (context) - Musser - 1980
49   Orderings for equational proofs (context) - Bachmair, Dershowitz et al. - 1986
45   Proof by consistency (context) - Kapur, Musser - 1987
42   Term rewriting induction (context) - Reddy - 1990
41   Encompassment properties and automata with constraints (context) - Caron, Coquid'e et al. - 1993
40   A strong restriction of the inductive completion procedure (context) - Fribourg - 1989
34   Automatic proofs by induction in theories without constructo.. (context) - Jouannaud, Kounalis - 1989
31   On sufficient completeness and related properties of term re.. (context) - Kapur, Narendran et al. - 1987
20   ground reducibility and their complexity (context) - Kapur, Narendran et al. - 1991
15   Inductive proofs by specifications transformation (context) - Comon - 1989
13   Unification et disunification: Th'eorie et applications (context) - Comon - 1988
9   Ground reducibility and automata with disequality constraint.. - Comon, Jacquemard - 1994
6   A simple explanation of inductionless induction (context) - Lankford - 1981
5   reducibility in term rewriting systems (context) - Kounalis, the et al. - 1992
4   Canonical sets of horn clauses - Dershowitz - 1990
3   How to prove inductive hypothesis without induction (context) - Goguen - 1980
2   Preuves Automatiques par R'ecurrence dans les Th'eories Cond.. (context) - Bouhoula - 1994
1   Solutions of Exercises Exercise 1 Let s be the identity (context) - Waldmann, order-sorted et al. - 1992

Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.lri.fr.html):   More
A Method for Conceptual Modelling of Real-Time Expert Systems.. - Aijun An   (Correct)
TASK: from the specification to the implementation. - Xavier Talon   (Correct)
Adding User Interface to a Behavioral Specification - Systä (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.