Definitional trees
- 23 November 2005
- book chapter
- Published by Springer Science and Business Media LLC
- p. 143-157
- https://doi.org/10.1007/bfb0013825
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Implementing parallel rewritingPublished by Springer Science and Business Media LLC ,2005
- Lazy evaluation in logic programmingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Programming in equational logic: beyond strong sequentialityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Logic programming with functions and predicates: The language BabelThe Journal of Logic Programming, 1992
- Lazy narrowing in a graph machineLecture Notes in Computer Science, 1990
- Sequential evaluation strategies for parallel-or and related reduction systemsAnnals of Pure and Applied Logic, 1989
- Optimization by non-deterministic, lazy rewritingLecture Notes in Computer Science, 1989
- A refinement of strong sequentiality for term rewriting with constructorsInformation and Computation, 1987
- Implementation of an interpreter for abstract equationsPublished by Association for Computing Machinery (ACM) ,1984
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980