Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Recursive data type
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Building on Wouter Swierstra's Data types à la carte, we present a comprehensive Haskell library of compositional data types… Expand
Is this relevant?
2005
2005
Existential types provide a simple and elegant foundation for understanding generative abstract data types, of the kind supported… Expand
Is this relevant?
2001
2001
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes… Expand
Is this relevant?
1999
1999
Abstract Relational interpretations of type systems are useful for establishing properties of programming languages. For… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
A method of compositional verification is presented that uses the combination of temporal case splitting and data type reductions… Expand
Is this relevant?
1999
1999
Design space explorers are computer programs that play on an exploration metaphor to support design. They assist designers in… Expand
Is this relevant?
1993
1993
F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Transferal and recursive filter concepts, normally associated with discrete-time applications, are adapted for implementation in… Expand
Is this relevant?
1985
1985
The type theories we consider are adequate for the foundations of mathematics and computer science. Recursive type definitions… Expand
Is this relevant?
Highly Cited
1975
Highly Cited
1975
The power and convenience of a programming language may be enhanced for certain applications by permitting treelike data… Expand
Is this relevant?