Notes on the elimination of conditions

  • E. Giovannetti
  • C. Moiso
Part 1 Research Articles
Part of the Lecture Notes in Computer Science book series (LNCS, volume 308)


In these notes we have described a method for eliminating equality tests from conditions in ctrs. Two applications have been shown: the first is the transformation of a conditional trs into an equivalent unconditional one; the second is the extension of the user syntax of K-LEAF, a logic+functional programming language.


Function Symbol Horn Clause Functional Language Equality Symbol Syntactic Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bergstra86]
    J.A. Bergstra and J.W. Klop, Conditional rewrite rules: confluence and termination, Journal of Computer and System Sciences 32 (1986), pp. 323–362.CrossRefGoogle Scholar
  2. [Bosco87]
    P.G. Bosco, E. Giovannetti, G. Levi, C. Moiso and C. Palamidessi, A complete characterization of K-LEAF, a logic language with partial functions, Proc. 1987 Symp. on Logic Programming (IEEE Comp. Society Press, 1987).Google Scholar
  3. [Dershowitz86).
    N. Dershowitz and D.A. Plaisted, Equational programming, Report R-86-1265, University of Illinois, Urbana (1986).Google Scholar
  4. [Kaplan84]
    S. Kaplan, Fair conditional term rewriting systems: Unification, termination and confluence. Technical Report no. 194, University of Orsay (1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • E. Giovannetti
    • 2
  • C. Moiso
    • 1
  1. 1.CSELT Centro Studi E Laboratori TelecomunicazioniTorinoItaly
  2. 2.Dipartimento di InformaticaUniversità di TorinoTorinoItaly

Personalised recommendations