57 search results - page 1 / 12 » Initial Algebra Semantics Is Enough! |
TLCA
2007
Springer
13 years 11 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
TLCA
2009
Springer
13 years 11 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
APLAS
2004
ACM
13 years 10 months 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...
POPL
2008
ACM
14 years 5 months ago
2008
ACM
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...