Sciweavers

56 search results - page 1 / 12
» Typed compilation of recursive datatypes
Sort
View
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
13 years 11 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...
ICFP
2001
ACM
14 years 5 months ago
Extensible Algebraic Datatypes with Defaults
A major problem for writing extensible software arises when recursively defined datatypes and operations on these types have to be extended simultaneously without modifying existi...
Matthias Zenger, Martin Odersky
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
TYPES
2000
Springer
13 years 9 months ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow
POPL
2003
ACM
14 years 6 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