136 search results - page 2 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...
FLOPS
2010
Springer
13 years 3 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
FUIN
2002
13 years 5 months ago
2002
This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavo...
PLILP
1998
Springer
13 years 9 months ago
1998
Springer
This paper shows how lazy functional programs can be made mobile by compiling them for the Java Virtual Machine. The Haskell compiler it describes is based on the h ,Gi-machine, wh...
JFP
2000
13 years 5 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...