967 search results - page 3 / 194 » Building a Calculus of Data Structures |
TACS
2001
Springer
13 years 10 months ago
2001
Springer
Parigot suggested symmetric structural reduction rules for ion to µ-abstraction in [9] to ensure unique representation of data type. We prove strong normalization of second order ...
ICPP
1991
IEEE
13 years 10 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
FOSSACS
2005
Springer
13 years 12 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
ESOP
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
ICFP
2008
ACM
14 years 6 months ago
2008
ACM
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...