Handling function definitions through innermost superposition and rewriting
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 325-344
- https://doi.org/10.1007/3-540-15976-2_16
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On solving the equality problem in theories defined by Horn clausesLecture Notes in Computer Science, 1985
- Conditional rewrite rulesTheoretical Computer Science, 1984
- Equality, types, modules, and (why not?) generics for logic programmingThe Journal of Logic Programming, 1984
- Oriented equational clauses as a programming languageThe Journal of Logic Programming, 1984
- A prological definition of HASL a purely functional language with unification based conditional binding expressionsNew Generation Computing, 1984
- TABLOGPublished by Association for Computing Machinery (ACM) ,1984
- A prolog extension for handling negative knowledgeNew Generation Computing, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Proofs by induction in equational theories with constructorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980