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

Schmidt-Schauß, Manfred

English

Call-by-need lambda calculi with letrec provide a rewritingbased operational semantics for (lazy) call-by-name functional languages. These calculi model the sharing behavior during evaluation more closely than let-based calculi that use a fixpoint combinator. In a previous paper we showed that the copy-transformation is correct for the small calculus LR-Lambda. In this paper we demonstrate that the proof method based on a calculus on infinite trees for showing correctness of instantiation operations can be extended to the calculus LRCC-Lambda with case and constructors, and show that copying at compile-time can be done without restrictions. We also show that the call-by-need and call-by-name strategies are equivalent w.r.t. contextual equivalence. A consequence is correctness of all the transformations like instantiation, inlining, specialization and common subexpression elimination in LRCC-Lambda. We are confident that the method scales up for proving correctness of copy-related transformations in non-deterministic lambda calculi if restricted to "deterministic" subterms

Hochschulschriftenserver - Universität Frankfurt am Main

A calculus for link-time compilation. In

A call-by-need lambda calculus.

A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations.

A complete proof of the safety of N¨ ocker’s strictness analysis. Frank report

A fully abstract semantics for concurrent graph reduction.

A natural semantics for lazy evaluation.

Call-by-name, call-by-value, and the lambda-calculus.

Cyclic lambda calculi. In

Discrimination by parallel observers: The algorithm.

Erratic fudgets: A semantic theory for an embedded coordination language.

Haskell 98 Language and Libraries.

Inﬁnitary lambda calculus.

Lambda calculus with explicit recursion.

Observable sharing for functional circuit description.

Term Rewriting and All That.

The call-by-need lambda calculus.

The concurrent Clean language report: Version 1.3 and 2.0.

The Lambda Calculus. Its Syntax and Semantics.

Correctness of copy in calculi with letrec, case and constructors

A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations. Frank report 24, Inst. Informatik. J.W.G.-university Frankfurt,

A complete proof of the safety of N¨ ocker’s strictness analysis. Frank report 20, Inst. Informatik. J.W.G.-University Frankfurt,

Correctness of copy in calculi with letrec, case and constructors. Frank report 28, Inst. Informatik. J.W.G.-University Frankfurt,

Equivalence of call-by-name and call-by-need for lambdacalculi with letrec. Frank report 25, Inst. Informatik. J.W.G.-university Frankfurt,

Lava: Hardware Design in Haskell.

Program transformation for functional circuit descriptions. Frank report 30, Institut f¨ ur Informatik. Fachbereich Informatik und

Correctness of copy in calculi with letrec, case, constructors and por

Correctness of copy in calculi with letrec, case, constructors and por

Abstract

Similar works

Full text

Available Versions

Hochschulschriftenserver - Universität Frankfurt am Main

Hochschulschriftenserver - Universität Frankfurt am Main