Sciweavers

8 search results - page 1 / 2
» ifl 2005
Sort
View
IFL
2005
Springer
13 years 10 months ago
A Rational Deconstruction of Landin's J Operator
Olivier Danvy, Kevin Millikin
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
13 years 10 months ago
Accurate Step Counting
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
Catherine Hope, Graham Hutton
IFL
2005
Springer
107views Formal Methods» more  IFL 2005»
13 years 10 months ago
With-Loop Fusion for Data Locality and Parallelism
With-loops are versatile array comprehensions used in the functional array language SaC to implement universally applicable array operations. We describe the fusion of with-loops a...
Clemens Grelck, Karsten Hinckfuß, Sven-Bodo ...
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
13 years 10 months ago
The Implementation of iData
The iData Toolkit is a toolkit that allows programmers to create interactive, type-safe, dynamic web applications with state on a high level of abstraction. The key element of this...
Rinus Plasmeijer, Peter Achten
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
13 years 10 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol