Definitional Trees

  title={Definitional Trees},
  author={Sergio Antoy},
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure representing, at a high level of abstraction, a form of control. Its application solves a specific problem arising in the design and implementation of inherently sequential, lazy, functional programming languages based on rewriting. For example, we show how to extend the expressive power of Log(F ) and how to improve the efficiency of an implementation of BABEL. Our… CONTINUE READING
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 181 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 109 extracted citations

181 Citations

Citations per Year
Semantic Scholar estimates that this publication has 181 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 26 references

Rodŕıguez-Artalejo. Graphbased implementation of a functional language

  • H. Kuchen, R. Loogen, J. J. Moreno-Navarro
  • In ESOP’90,
  • 1990
Highly Influential
4 Excerpts

Building definitional trees

  • Yonggong Yan
  • Information and Computation
  • 1992
1 Excerpt

Rodŕıguez-Artalejo. Logic programming with functions and predicates: The language BABEL

  • M.J.J. Moreno-Navarro
  • Journal of Logic Programming,
  • 1992
3 Excerpts

Similar Papers

Loading similar papers…