We present an implementation of an interpreter LRPi for the call-by-need calculus LRP, based on a variant of Sestoft's abstract machine Mark 1, extended with an eager garbage collector. It is used as a tool for exact space usage analyses as a support for our investigations into space improvements of call-by-need calculi
We give p-calculus encodings of some reduction strategies that have been found useful in the functio...
AbstractResource control has attracted increasing interest in foundational research on distributed s...
We present a semantic space profiler for parallel functional programs. Building on previous work in ...
We explore space improvements in LRP, a polymorphically typed call-by-need functional core language....
We explore space improvements in LRP, a polymorphically typed call-by-need functional core language....
This thesis is concerned with the resource consumption of lazy functional languages. It touches upon...
AbstractWe introduce a space-improvement relation on programs which guarantees that whenever M is im...
AbstractWe show that the CPS transformation from the call-by-value lambda calculus to a CPS language...
The calculus LRP is a polymorphically typed call-by-need lambda calculus extended by data constructo...
The calculus LRP is a polymorphically typed call-by-need lambda calculus extended by data constructo...
An improvement is a correct program transformation that optimizes the program, where the criterion i...
International audienceThe omnipresence of resource-constrained embedded systems makes them critical ...
This report documents the extension LRPw of LRP by sharing decorations. We show correctness of impro...
Can the λ-calculus be considered a reasonable computational model? Can we use it for measuring the t...
Innocent-looking program transformations can easily change the space complexity of lazy functional ...
We give p-calculus encodings of some reduction strategies that have been found useful in the functio...
AbstractResource control has attracted increasing interest in foundational research on distributed s...
We present a semantic space profiler for parallel functional programs. Building on previous work in ...
We explore space improvements in LRP, a polymorphically typed call-by-need functional core language....
We explore space improvements in LRP, a polymorphically typed call-by-need functional core language....
This thesis is concerned with the resource consumption of lazy functional languages. It touches upon...
AbstractWe introduce a space-improvement relation on programs which guarantees that whenever M is im...
AbstractWe show that the CPS transformation from the call-by-value lambda calculus to a CPS language...
The calculus LRP is a polymorphically typed call-by-need lambda calculus extended by data constructo...
The calculus LRP is a polymorphically typed call-by-need lambda calculus extended by data constructo...
An improvement is a correct program transformation that optimizes the program, where the criterion i...
International audienceThe omnipresence of resource-constrained embedded systems makes them critical ...
This report documents the extension LRPw of LRP by sharing decorations. We show correctness of impro...
Can the λ-calculus be considered a reasonable computational model? Can we use it for measuring the t...
Innocent-looking program transformations can easily change the space complexity of lazy functional ...
We give p-calculus encodings of some reduction strategies that have been found useful in the functio...
AbstractResource control has attracted increasing interest in foundational research on distributed s...
We present a semantic space profiler for parallel functional programs. Building on previous work in ...
DOI
Add to ORKG