| Alternate document: Details Dealing with Large Bananas (00) Ralf Lämmel, Joost Visser, Jan Kort |
Ralf Lämmel, Joost Visser, Jan Kort  Home/Search
Context Related
| cs.uu.nl/~johanj/wgp2000/Laemmel.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uu.nl/~johanj/wgp...wgp2000cfp (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Many problems call for a mixture of generic and specific programming techniques. We propose a polytypic programming approach based on generalised (monadic) folds where a separation is made between basic fold algebras that model generic behaviour and updates on these algebras that model specific behaviour. We identify particular basic algebras as well as some algebra combinators, and we show how these facilitate structured programming with updatable fold algebras. This blend of genericity ... (Update)
Context of citations to this paper: More
.... will discuss how such reuse could be realized by generating special visitor subclasses or classes that model updatable many sorted folds [19]. Translating transformations are also completely covered by JJForester s expressiveness. As in the case of analysis, the degree of reuse...
...However, problems arise as soon heterogeneous trees have to be traversed. One solution to this problem are fold algebras as described in [23]: based on a language definition traversal functions are generated in Haskell. A tool generates generic folding over algebraic types. The...
Cited by: More
A Generic Programming Extension for Clean - Alimarine, Plasmeijer (2001) (Correct)
Typed Combinators for Generic Traversal - Lämmel, Visser (2002) (Correct)
Term Rewriting With Traversal Functions - van den Brand, Klint, Vinju (2001) (Correct)
Similar documents (at the sentence level):
69.7%: Generic Traversal over Typed Source Code Representations - Visser (2003) (Correct)
59.1%: Dealing with Large Bananas - Lämmel, Visser, Kort (2000) (Correct)
Active bibliography (related documents): More All
0.5: Expressive Type Systems for Logic Programming Languages - Jeffery (2002) (Correct)
0.3: Model Checking is Refinement - Relating Büchi Testing and.. - Cleaveland, Lüttgen (2000) (Correct)
0.3: Proof-assistants using Dependent Type Systems - Barendregt, Geuvers (1999) (Correct)
Similar documents based on text: More All
0.3: Functional Transformation Systems - Kort, Lämmel, Visser (2000) (Correct)
0.3: Disciplined, Efficient, Generalised Folds for Nested Datatypes - Martin, Gibbons, Bayley (2002) (Correct)
0.2: Parse-Tree Annotations Meet Re-Engineering Concerns - Kort, Lämmel (2003) (Correct)
Related documents from co-citation: More All
3: Functional transformation systems - Kort, ammel et al. - 2000
3: Building Program Optimizers with Rewriting Strategies - Visser, Abidine et al. - 1998
2: The online survey of program transformation (context) - Visser
BibTeX entry: (Update)
Ralf Lammel, Joost Visser, and Jan Kort. Dealing with large bananas. In Johan Jeuring, editor, Workshop on Generic Programming, Ponte de Lima, July 2000. Technical Report, Universiteit Utrecht. http://citeseer.ist.psu.edu/lammel00dealing.html More
@misc{ lammel00dealing,
author = "R. Lammel and J. Visser and J. Kort",
title = "Dealing with large bananas",
text = "Ralf Lammel, Joost Visser, and Jan Kort. Dealing with large bananas. In
Johan Jeuring, editor, Workshop on Generic Programming, Ponte de Lima, July
2000. Technical Report, Universiteit Utrecht.",
year = "2000",
url = "citeseer.ist.psu.edu/lammel00dealing.html" }
Citations (may not include all citations):214 Reverse engineering and design recovery: A taxonomy (context) - Chikofsky, Cross - 1990
210 Functional Programming with Bananas (context) - Meijer, Fokkinga et al. - 1991
131 A Fold for All Seasons - Sheard, Fegaras - 1993
109 PolyP - a polytypic programming language extension - Jansson, Jeuring - 1997
99 Building Program Optimizers with Rewriting Strategies - Visser, Benaissa et al. - 1998
92 Subtyping recursive types - Amadio, Cardelli - 1991
84 Law and Order in Algorithmics (context) - Fokkinga - 1992
67 Formal Aspects of Computing (context) - Meertens - 1992
63 A new approach to generic functional programming - Hinze - 2000
55 Bananas in Space: Extending Fold and Unfold to Exponential T.. - Meijer, Hutton - 1995
48 Merging Monads and Folds for Functional Programming - Meijer, Jeuring
45 Nested datatypes - Bird, Meertens - 1998
38 Functional Programming with Overloading and Higher-Order Pol.. - Jones
35 Monadic maps and folds for arbitrary datatypes - Fokkinga - 1994
30 Language Independent Traversals for Program Transformation - Visser - 2000
26 Generation of components for software renovation factories f.. - van den Brand, Sellink et al. - 2000
26 A generic programming extension for Haskell - Hinze - 1999
25 Generalised folds for nested datatypes - Bird, Paterson - 1999
25 Automatic generation and use of abstract structure operators (context) - Sheard - 1991
24 Designing and implementing combinator languages - Swierstra, Alcocer et al.
17 Representing layered monads - Filinski - 1999
15 Functional Transformation Systems - Kort, Lammel et al. - 2000
11 Uniform Traversal Combinators: Definition (context) - Fegaras, Sheard et al. - 1992
6 International Journal on Software Tools for Technology Trans.. (context) - Jay, FISh - 1999
5 Aspect-oriented Compilers - de Moor, Peyton-Jones et al. - 1999
4 Advanced Functional Programming (context) - Jeuring, Meijer - 1995
4 Automatic synthesis of typed lambda-programs on term algebra.. (context) - Bohm, Berarducci - 1985
4 shapely functors and traversals (context) - Moggi, Jay - 1999
3 Lecture Notes in Computer Science (context) - Meertens - 1996
3 Department of Computer Science (context) - Gaster, variants et al. - 1998
2 Type Classes and Functional Dependencies (context) - Jones - 1999
1 Advanced Functional Programming (context) - Swierstra, Henriques et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uu.nl/~johanj/wgp2000/wgp2000cfp.html): More
Memo Functions, Polytypically! - Hinze (2000) (Correct)
Language Independent Traversals for Program Transformation - Visser (2000) (Correct)
Towards Merging Recursion and Comonads - Pardo (2000) (Correct)
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