LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
sav08:list_of_theories_admitting_qe [2008/04/16 22:36]
vkuncak
sav08:list_of_theories_admitting_qe [2008/04/23 15:28]
vkuncak
Line 28: Line 28:
 in this theory. ​ We can express more complex constraints. in this theory. ​ We can express more complex constraints.
  
-  * [[http://​lara.epfl.ch/​~kuncak/​papers/​KuncakRinard03TheoryStructuralSubtyping.html|On the Theory of Structural Subtyping]]+  ​* [[http://​lara.epfl.ch/​~kuncak/​lectures/​Maher88CompleteAxiomatizationsofFiniteRational.pdf|Michael J. Maher: Complete Axiomatizations of Algebras of Finite, Infinite, and Rational Trees]] 
 +  * [[http://​lara.epfl.ch/​~kuncak/​lectures/​ComonDelor94EquationalFormulaeMembershipConstraints.pdf|H. Comon, C. Delor: Equational Formulae with Membership Constraints]] 
 +  ​* [[http://​lara.epfl.ch/​~kuncak/​papers/​KuncakRinard03TheoryStructuralSubtyping.html|On the Theory of Structural Subtyping]] ​(see also citations in there)
   * [[http://​theory.stanford.edu/​~tingz/​papers/​cade05.html|The Decidability of the First-order Theory of Knuth-Bendix Order]]   * [[http://​theory.stanford.edu/​~tingz/​papers/​cade05.html|The Decidability of the First-order Theory of Knuth-Bendix Order]]