17 search results - page 2 / 4 » Recursive Constructions in the Theory of P.I. Algebras |
107
click to vote
TLCA
2007
Springer
15 years 5 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...
CGF
2000
14 years 11 months ago
2000
: Having evolved from volume visualisation, volume graphics is emerging as an important sub-field of computer graphics. This paper focuses on a fundamental aspect of volume graphic...
104
Voted
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
114
click to vote
ICFP
2006
ACM
15 years 11 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...