(Enter summary)
Abstract: Inductive types, such as lists and trees, have a uniform
semantic description, both of the types themselves
and the folding algorithms that construct homomorphisms
out of them. Though implementations
have been able to give a uniform description
of the types, this has not been true of folding, since
there has not been a uniform mechanism for finding
the sub-expressions (the sub-lists or sub-trees, etc.)
to which recursion applies.
Polynomial types overcome this problem by distinguishing
the... (Update)
Cited by: More
A Fresh Look at Parametric Polymorphism: Covariant Types - Barry Jay School (1996)
(Correct)
Covariant Types - Barry Jay School (1997)
(Correct)
Distinguishing Data Structures and Functions: the Constructor.. - Jay (2001)
(Correct)
Active bibliography (related documents): More All
0.1: A Semantics for Shape - Jay (1995)
(Correct)
0.0: The Pattern Calculus - Jay (2003)
(Correct)
0.0: The Constructor Calculus - Jay (2003)
(Correct)
Similar documents based on text: More All
0.4: Data Categories - Barry Jay School (1996)
(Correct)
0.3: The Virtues of Eta-expansion - Barry Jay School (1995)
(Correct)
0.2: Shapely Types and Shape Polymorphism - Barry Jay And (1994)
(Correct)
Related documents from co-citation: More All
13: Science of Computer Programming (context) - Jay, for - 1995
11: Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
10: A theory of type polymorphism in programming (context) - Milner - 1978
BibTeX entry: (Update)
C.B. Jay. Polynomial polymorphism. In R. Kotagiri, editor, Proceedings of the Eighteenth Australasian Computer Science Conference: Glenelg, South Australia 1--3 February, 1995, volume 17, pages 237--243. A.C.S. Communications, 1995. http://citeseer.ist.psu.edu/jay95polynomial.html More
@incollection{ jay95polynomial,
author = "C. Barry Jay",
title = "Polynomial Polymorphism",
booktitle = "Proceedings 18th Australasian Computer Science Conf., {ACSC}'95, Glenelg, South Australia, 1--3 Feb 1995",
volume = "17",
editor = "R. Kotagiri",
pages = "237--243",
year = "1995",
url = "citeseer.ist.psu.edu/jay95polynomial.html" }
Citations (may not include all citations):
333
Introduction to Functional Programming (context) - Bird, Wadler - 1988
210
Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
183
Report on the programming language haskell: a non-strict (context) - Hudak - 1992
163
Commentary on Standard ML (context) - Milner, Tofte - 1991
57
The implementation of the gofer functional programming syste..
- Jones - 1994
31
Shapely types and shape polymorphism
- Jay, Cockett - 1994
20
Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
18
Technical Report (context) - Cockett, Fukushima - 1992
1
Shapely types: Exploiting parseability (context) - Jay - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://linus.socs.uts.edu.au/~cbj/Publications/abstracts.html): More
Separating Shape from Data - Jay
(Correct)
The Functional Imperative: Shape! - Jay, Steckler (1997)
(Correct)
Shapely Types and Shape Polymorphism - Jay, Cockett (1994)
(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