M. Kuiper and D. Swierstra. Using attribute grammars to derive efficient functional programs. In Computing Science in the Netherlands CSN'87, November 1987. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Multi-Traversal Tree Decoration in a Functional Setting: Monads.. - Pennings (1993) (Correct)
....traversals. We have also investigated two This research was supported by the Foundation for Computer Science (SION) of the Netherlands Organization for Scientific Research (NWO) under grant 612 317 032. other approaches, namely circular functions to short circuit multiple traversals [Bir84, KS87, Kui89] and monads [Wad90, Wad92, Wad93] to mimic the standard imperative solution. In judging solutions we have three criteria. The most important one is that no recomputations should take place. Once a value is computed store it for later use. Secondly, we strive for non lazy evaluation since ....
....memo table. Lazy memoing as proposed by Hughes [Hug85] does not seem appropriate either. There are two general methods to obtain a circular program. Firstly, one can use the rewriting technique from bird [Bir84] or, secondly, one can use a mapping to and from an attribute grammar as described in [KS87] or [Kui89, pp. 83 95] However, since the functions for the first traversal (rtips) and the second (match) have the same pattern structure, we observe that we can bypass these elaborate techniques by simply merging the two function definitions into one rtm n t rs vs = hrs 0 ; vs 0 ; t 0 i ....
M.F. Kuiper and S.D. Swierstra. Using attribute grammars to derive efficient functional programs. Computing Science in the Netherlands CSN '87, November 1987.
Strictification of Lazy Functions - Saraiva, Swierstra, Kuiper, Pennings (1996) Self-citation (Kuiper Swierstra) (Correct)
....well used to thinking in terms of setting up equations between attributes, On leave from the Department of Computer Science, University of Minho, Braga, Portugal. and letting the system worry about the order in which the computations are actually scheduled. It has furthermore been noticed by [KS87, Joh87] that there exists a direct translation from attribute grammars into this class of circular programs. Those acquainted with catamorphisms will furthermore recognise a catamorphims which returns a higher order type in the above program [MFP91] In recent years we have been interested in the ....
Matthijs Kuiper and Doaitse Swierstra. Using attribute grammars to derive efficient functional programs. In Computing Science in the Netherlands CSN'87, November 1987. ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1986/1986-16.ps.gz.
Embedding Domain Specific Languages in the Attribute.. - Saraiva, Schneider (2003) (Correct)
No context found.
M. Kuiper and D. Swierstra. Using attribute grammars to derive efficient functional programs. In Computing Science in the Netherlands CSN'87, November 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC