Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Algebraic and Logic Programming (ALP'92) Volterra, Italy, Sept. 1992, Springer LNCS Vol. 632, pages 143-157.
 

Summary: Algebraic and Logic Programming (ALP'92)
Volterra, Italy, Sept. 1992, Springer LNCS Vol. 632, pages 143-157.
Definitional Trees
Sergio Antoy
Department of Computer Science
Portland State University
Portland, Oregon 97207-0751
Abstract. Rewriting is a computational paradigm that specifies the
actions, but not the control. We introduce a hierarchical structure repre-
senting, 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 BA-
BEL. Our framework provides a notion of degree of parallelism of an
operation and shows that the elements of a necessary set of redexes are
related by an and-or relation. Both concepts find application in parallel
implementations of rewriting. In an environment in which computations
can be executed in parallel we are able to detect sequential computations
in order to minimize overheads and/or optimize execution. Conversely,

  

Source: Antoy, Sergio - Department of Computer Science, Portland State University

 

Collections: Computer Technologies and Information Sciences