This paper extends the internal frank report 28 as follows: It is shown that for a call-by-need lambda calculus LRCCP-Lambda extending the calculus LRCC-Lambda by por, i.e in a lambda-calculus with letrec, case, constructors, seq and por, copying can be done without restrictions, and also that call-by-need and call-by-name strategies are equivalent w.r.t. contextual equivalence
International audienceAriola et al defined a call-by-need λ-calculi with control, together with a se...
Correctness of program transformations in extended lambda calculi with a contextual semantics is usu...
We present a calculus that captures the operational semantics of call-by-need.We demonstrate t...
Call-by-need lambda calculi with letrec provide a rewritingbased operational semantics for (lazy) ca...
We develop a proof method to show that in a (deterministic) lambda calculus with letrec and equipped...
This paper shows equivalence of several versions of applicative similarity and contextual approximat...
This paper shows equivalence of several versions of applicative similarityand contextual approximati...
This paper shows the equivalence of applicative similarity and contextual approximation, and hence a...
The goal of this report is to prove correctness of a considerable subset of transformations w.r.t. c...
This paper shows the equivalence of applicative similarity and contextual approximation, and hence a...
The paper proposes a variation of simulation for checking and proving contextual equivalence in a no...
Abstract. The goal of this report is to prove correctness of a considerable subset of transformation...
This paper presents a call-by-need polymorphically typed lambda-calculus with letrec, case, construc...
We present a higher-order call-by-need lambda calculus enriched with constructors, case-expressions,...
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presen...
International audienceAriola et al defined a call-by-need λ-calculi with control, together with a se...
Correctness of program transformations in extended lambda calculi with a contextual semantics is usu...
We present a calculus that captures the operational semantics of call-by-need.We demonstrate t...
Call-by-need lambda calculi with letrec provide a rewritingbased operational semantics for (lazy) ca...
We develop a proof method to show that in a (deterministic) lambda calculus with letrec and equipped...
This paper shows equivalence of several versions of applicative similarity and contextual approximat...
This paper shows equivalence of several versions of applicative similarityand contextual approximati...
This paper shows the equivalence of applicative similarity and contextual approximation, and hence a...
The goal of this report is to prove correctness of a considerable subset of transformations w.r.t. c...
This paper shows the equivalence of applicative similarity and contextual approximation, and hence a...
The paper proposes a variation of simulation for checking and proving contextual equivalence in a no...
Abstract. The goal of this report is to prove correctness of a considerable subset of transformation...
This paper presents a call-by-need polymorphically typed lambda-calculus with letrec, case, construc...
We present a higher-order call-by-need lambda calculus enriched with constructors, case-expressions,...
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presen...
International audienceAriola et al defined a call-by-need λ-calculi with control, together with a se...
Correctness of program transformations in extended lambda calculi with a contextual semantics is usu...
We present a calculus that captures the operational semantics of call-by-need.We demonstrate t...