Sciweavers

8 search results - page 1 / 2
» Guarded recursive datatype constructors
Sort
View
41
Voted
POPL
2003
ACM
14 years 5 months ago
Guarded recursive datatype constructors
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....
Hongwei Xi, Chiyan Chen, Gang Chen
FPCA
1995
13 years 9 months ago
Bananas in Space: Extending Fold and Unfold to Exponential Types
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
Erik Meijer, Graham Hutton
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
13 years 10 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
TYPES
2004
Springer
13 years 11 months ago
A Few Constructions on Constructors
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
Conor McBride, Healfdene Goguen, James McKinna
CSL
2004
Springer
13 years 11 months ago
Fixed Points of Type Constructors and Primitive Recursion
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...
Andreas Abel, Ralph Matthes