See this document in CiteSeerX!

Calculate Polytypically! (1996)  (Make Corrections)  
Lambert Meertens
Proceedings 8th Int.\ Symp.\ on Programming Languages: Implementations, Logics, and Programs, PLILP'96, Aachen, Germany, 24--27 Sept 1996



  Home/Search   Context   Related

 
View or download:
kestrel.edu/pub/papers/meertens...pp.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  kestrel.edu/HTML/people/meerte... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: A polytypic function definition is a function definition that is parametrised with a datatype. It embraces a class of algorithms. As an example we define a simple polytypic "crush" combinator that can be used to calculate polytypically. The ability to define functions polytypically adds another level of flexibility in the reusability of programming idioms and in the design of libraries of interoperable components. (Update)

Active bibliography (related documents):   More   All
1.3:   Polytypic Programming - Jeuring, Jansson (1996)   (Correct)
0.7:   PolyP - a polytypic programming language extension - Jansson, Jeuring (1997)   (Correct)
0.5:   The Calculation of a Polytypic Parser - Huisman (1996)   (Correct)

Similar documents based on text:   More   All
0.6:   Functor Pulling - Meertens (1998)   (Correct)
0.4:   Polytypic Proof Construction - Pfeifer, Rueß (1999)   (Correct)
0.4:   Polytypic Abstraction in Type Theory - Pfeifer, Rueß   (Correct)

BibTeX entry:   (Update)

@incollection{ meertens96calculate,
    author = "Lambert Meertens",
    title = "Calculate Polytypically!",
    booktitle = "Proceedings 8th Int.\ Symp.\ on Programming Languages: Implementations, Logics, and Programs, {PLILP}'96, Aachen, Germany, 24--27 Sept 1996",
    volume = "1140",
    publisher = "Springer-Verlag",
    address = "Berlin",
    editor = "H. Kuchen and S. D. Swiestra",
    pages = "1--16",
    year = "1996",
    url = "citeseer.ist.psu.edu/247990.html" }
Citations (may not include all citations):
172   An introduction to the theory of lists (context) - Bird - 1987
143   Theorems for free - Wadler - 1989
131   A Fold for All Seasons - Sheard, Fegaras - 1993
104   Algebra of Programming (context) - Bird, de Moor - 1996
104   Science of Computer Programming (context) - Malcolm, program - 1990
84   Law and Order in Algorithmics (context) - Fokkinga - 1992
81   Algorithmics---towards programming as a mathematical activit.. (context) - Meertens - 1986
67   Formal Aspects of Computing (context) - Meertens - 1992
63   Algebraic Data Types and Program Transformation (context) - Malcolm - 1990
61   Polytypic programming - Jeuring, Jansson - 1996
55   Bananas in space: extending fold and unfold to exponential t.. - Meijer, Hutton - 1995
52   Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
52   Algebraic Approaches to Program Semantics (context) - Manes, Arbib - 1986
46   Recursive types reduced to inductive types (context) - Freyd - 1990
41   The Design of a Pretty-printing Library - Hughes - 1995
41   Homomorphisms and promotability (context) - Malcolm - 1989
39   Polytypic pattern matching - Jeuring - 1995
38   Functional Programming with Overloading and Higher-Order Pol.. - Jones - 1995
35   Monadic maps and folds for arbitrary datatypes - Fokkinga - 1994
34   Generic functional programming with types and relations (context) - Bird, de Moor et al. - 1996
24   Category Theoretic Approach to Data Types (context) - Hagino - 1987
23   Revisiting catamorphisms over datatypes with embedded functi.. - Fegaras, Sheard - 1996
18   Analytical and Structural Polymorphism Expressed Using Patte.. (context) - Ruehr - 1992
14   A gentle introduction to category theory --- the calculation.. (context) - Fokkinga - 1992
11   A Categorical Approach to Functional Programming (context) - Tuijnman - 1995
9   Formal Aspects of Computing (context) - Fokkinga - 1992
7   The Calculation of a Polytypic Parser - Huisman - 1996
7   A Generic Program for Sequential Decision Processes - de Moor - 1995
7   A Class of Commuting Relators - Backhouse, Doornbos et al. - 1992
6   Mathematical Structures in Computer Science (context) - Fokkinga, without - 1996
4   Type parametric programming with compile-time reflection (context) - Sheard - 1993
3   Type inference for polytypic functions (context) - Jansson, Jeuring - 1996
3   Polytypism and Polytypic Unification - Jansson - 1995
3   Polytypic unification --- implementing polytypic functions w.. (context) - Jansson, Jeuring - 1996
1   Polyp --- a polytypic programming language (context) - Jansson, Jeuring - 1996
1   Category Theory for Program Construction by Calculation (context) - Meertens - 1995
1   Destructors and Natural Transformations (context) - Hoogendijk - 1993

Documents on the same site (http://www.kestrel.edu/HTML/people/meertens/):   More
Groundwork - Meertens (1998)   (Correct)
Designing Constraint Maintainers for User Interaction - Meertens (1998)   (Correct)
Mescal Requirements - Meertens (1998)   (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