The semantics of lazy functional languages

Josephs, Mark B.

doi:10.1016/0304-3975(89)90122-9

Cited by 25 publications

(12 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Josephs gave a continuation semantics for lazy functional languages [19]. The CPS-transformed evaluator in Section 2.4 closely corresponds to this denotational semantics.…”

Section: Related Workmentioning

confidence: 95%

A functional correspondence between call-by-need evaluators and lazy abstract machines

Ager

Danvy

Midtgaard

2004

Information Processing Letters

View full text Add to dashboard Cite

“…Josephs gave a continuation semantics for lazy functional languages [19]. The CPS-transformed evaluator in Section 2.4 closely corresponds to this denotational semantics.…”

Section: Related Workmentioning

confidence: 95%

A functional correspondence between call-by-need evaluators and lazy abstract machines

Ager

Danvy

Midtgaard

2004

Information Processing Letters

View full text Add to dashboard Cite

“…There is a significant body of other work on the semantics of call-by-need evaluation. Pre-dating Launchbury's work, Josephs [25] gave a denotational semantics of lazy evaluation, using a continuation-based semantics to model sharing, and including an explicit store. However, this approach doesn't fit well with standard proof techniques.…”

Section: Related Workmentioning

confidence: 99%

Automatic amortised analysis of dynamic memory allocation for lazy functional programs

et al. 2012

View full text Add to dashboard Cite

This paper describes the first successful attempt, of which we are aware, to define an automatic, type-based static analysis of resource bounds for lazy functional programs. Our analysis uses the automatic amortisation approach developed by Hofmann and Jost, which was previously restricted to eager evaluation. In this paper, we extend this work to a lazy setting by capturing the costs of unevaluated expressions in type annotations and by amortising the payment of these costs using a notion of lazy potential. We present our analysis as a proof system for predicting heap allocations of a minimal functional language (including higher-order functions and recursive data types) and define a formal cost model based on Launchbury's natural semantics for lazy evaluation. We prove the soundness of our analysis with respect to the cost model. Our approach is illustrated by a number of representative and non-trivial examples that have been analysed using a prototype implementation of our analysis.

show abstract

“…The semantics we present here is an intermediatelevel semantics, lying midway between, a straightforward denotational semantics, as that of Josephs [3] and a full operational semantics of the abstract machines [1,2] . It actually captures sharing within lazy evaluation without requiring extra machinery either of continuations, heaps, code pointers, dumps and the like.…”

Section: The Ltls Semanticsmentioning

confidence: 99%

Semantics of Lazy Evaluation using the Two-Level Grammar

AbouGhaly¹,

Daoud²,

Taha³

et al. 2008

J. of Computer Science

View full text Add to dashboard Cite

We have formalized the semantics of lazy evaluation for the lambda calculus using the two-level grammar formalism. The resulting semantics enjoys several properties, e.g., there is a sharing in the recursive computation, there is no α conversion, the heap is automatically reclaimed, an attempt to evaluate an argument is done at most once and there is a sharing in the evaluation of partial application to functions

show abstract

The semantics of lazy functional languages

Cited by 25 publications

References 3 publications

A functional correspondence between call-by-need evaluators and lazy abstract machines

A functional correspondence between call-by-need evaluators and lazy abstract machines

Automatic amortised analysis of dynamic memory allocation for lazy functional programs

Semantics of Lazy Evaluation using the Two-Level Grammar

Contact Info

Product

Resources

About