1914 search results - page 4 / 383 » Abstract lambda-Calculus Machines |
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
CCA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Stone Duality is a revolutionary theory that works directly with computable continuous functions, without using set theory, infinitary lattice theory or a prior theory o...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
SOCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The need to use position-dependent parameters often hamdefinition of flexible, extensible, and reusable abstractions for software composition. This observation has led ...
ESOP
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...