10 search results - page 1 / 2 » Inductive Type Schemas as Functors |
CSR
2006
Springer
13 years 9 months ago
2006
Springer
APLAS
2004
ACM
14 years 26 days ago
2004
ACM
Abstract. We give a semantic footing to the fold/build syntax of programming with inductive types, covering shortcut deforestation, based on a universal property. Specifically, we...
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
ICALP
2004
Springer
14 years 25 days ago
2004
Springer
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
ICFP
1996
ACM
13 years 11 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...