Notes on the elimination of conditions
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.
KeywordsFunction Symbol Horn Clause Functional Language Equality Symbol Syntactic Constraint
Unable to display preview. Download preview PDF.
- [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
- [Dershowitz86).N. Dershowitz and D.A. Plaisted, Equational programming, Report R-86-1265, University of Illinois, Urbana (1986).Google Scholar
- [Kaplan84]S. Kaplan, Fair conditional term rewriting systems: Unification, termination and confluence. Technical Report no. 194, University of Orsay (1984).Google Scholar