Sciweavers

IFL
2001
Springer
146views Formal Methods» more  IFL 2001»
13 years 9 months ago
Optimizations on Array Skeletons in a Shared Memory Environment
Map- and fold-like skeletons are a suitable abstractions to guide parallel program execution in functional array processing. However, when it comes to achieving high performance, i...
Clemens Grelck
IFL
2001
Springer
13 years 9 months ago
Proving the Correctness of the STG Machine
Abstract. J. Launchbury gave an operational semantics for lazy evaluation and showed that it is sound and complete w.r.t. a denotational s of the language. P. Sestoft then introduc...
Alberto de la Encina, Ricardo Pena
IFL
2001
Springer
13 years 9 months ago
A Polynomial-Cost Non-determinism Analysis
Abstract. This paper is an extension of a previous work where two nondeterminism analyses were presented. One of them was efficient but not very powerful and the other one was more...
Ricardo Pena, Clara Segura
IFL
2001
Springer
13 years 9 months ago
Sized Types for Typing Eden Skeletons
The parallel-functional language Eden extends Haskell with constructs to explicitly define and communicate processes. These extensions allow the easy definition of skeletons as h...
Ricardo Pena, Clara Segura
IFL
2001
Springer
13 years 9 months ago
Runtime Behavior of Conversion Interpretation of Subtyping
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...
Yasuhiko Minamide
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
13 years 9 months ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
IFL
2001
Springer
142views Formal Methods» more  IFL 2001»
13 years 9 months ago
A Compilation Scheme for a Hierarchy of Array Types
In order to achieve a high level of abstraction, array-oriented languages provide language constructs for defining array operations in a shape-invariant way. However, when trying ...
Dietmar Kreye