59 search results - page 4 / 12 » Alias Types for Recursive Data Structures |
TLCA
2007
Springer
14 years 11 days 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...
TACAS
2010
Springer
14 years 1 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
APLAS
2005
ACM
13 years 11 months ago
2005
ACM
Abstract. Polymorphic recursion is a useful extension of HindleyMilner typing and has been incorporated in the functional programming language Haskell. It allows the expression of ...
ECOOP
2010
Springer
13 years 11 months ago
2010
Springer
Data-centric synchronization groups fields of objects into atomic sets to indicate they must be updated atomically. Each atomic set has associated units of work, code fragments th...
SCP
2010
13 years 4 months ago
2010
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...