Add to ORKGThis report documents the extension LRPw of LRP by sharing decorations. We show correctness of improvement properties of reduction and transformation rules and also of computation rules for decorations in the extended calculus LRPw. We conjecture that conservativity of the embedding of LRP in LRPw holds
Traditionally, reasoning about programs under varying evaluation regimes (call-by-value, call-by-nam...
Ph.D. thesis. Introduces the "lambda-x" calculus of named explicit substitution and studie...
AbstractFrom a theoretical point of view, lazy evaluation corresponds to the call-by-name evaluation...
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...
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....
An improvement is a correct program transformation that optimizes the program, where the criterion i...
We give p-calculus encodings of some reduction strategies that have been found useful in the functio...
Abstract. Hofmann’s LFPL is a functional language with constructs that can be interpreted as referri...
This paper shows equivalence of applicative similarity and contextual approximation, and hence also ...
We present an implementation of an interpreter LRPi for the call-by-need calculus LRP, based on a va...
This paper shows equivalence of several versions of applicative similarityand contextual approximati...
In Part I [5], we proposed an approach to formally describe and compare functional languages impleme...
Abstract. Work on proving congruence of bisimulation in functional programming languages often refer...
Traditionally, reasoning about programs under varying evaluation regimes (call-by-value, call-by-nam...
Ph.D. thesis. Introduces the "lambda-x" calculus of named explicit substitution and studie...
AbstractFrom a theoretical point of view, lazy evaluation corresponds to the call-by-name evaluation...
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...
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....
An improvement is a correct program transformation that optimizes the program, where the criterion i...
We give p-calculus encodings of some reduction strategies that have been found useful in the functio...
Abstract. Hofmann’s LFPL is a functional language with constructs that can be interpreted as referri...
This paper shows equivalence of applicative similarity and contextual approximation, and hence also ...
We present an implementation of an interpreter LRPi for the call-by-need calculus LRP, based on a va...
This paper shows equivalence of several versions of applicative similarityand contextual approximati...
In Part I [5], we proposed an approach to formally describe and compare functional languages impleme...
Abstract. Work on proving congruence of bisimulation in functional programming languages often refer...
Traditionally, reasoning about programs under varying evaluation regimes (call-by-value, call-by-nam...
Ph.D. thesis. Introduces the "lambda-x" calculus of named explicit substitution and studie...
AbstractFrom a theoretical point of view, lazy evaluation corresponds to the call-by-name evaluation...