Add to ORKGIn his seminal paper Natural Semantics for Lazy Evaluation [Lau93], John Launchbury proves his semantics correct with respect to a denotational se-mantics, and outlines an adequacy proof. We have formalized both semantics and machine-checked the correctness proof, clarifying some details. Further-more, we provide a new and more direct adequacy proof that does not require intermediate operational semantics. Contents
A Scott/Strachey style denotational semantics intended to describe pure LISP is examined. I present...
Abstract. Explicitly enforcing strictness is often used by functional programmers as an important to...
This paper demonstrates that if a slicing algorithm is expressed denotationally, without intermedia...
In his seminal paper Natural Semantics for Lazy Evaluation [Lau93], John Launchbury proves his sema...
AbstractLazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a cle...
In this paper we present a denotational semantics for a lazy functional language. The semantics is i...
Abstract. Launchbury defines a natural semantics for lazy evaluation and proposes an alternative cal...
Call-by-need evaluation, also known as lazy evaluation, provides two key benefits: compositional pro...
In order to solve a long-standing problem with list fusion, a new compiler transformation, “Call Ari...
Formal description of a language gives insight into the language itself. The formal description may ...
Abstract. J. Launchbury gave an operational semantics for lazy eval-uation and showed that it is sou...
Lazy functional programming languages need lazy assertions to ensure that assertions preserve the me...
This paper presents a big-step operational semantics for distributed lazy evaluation. Our semantics ...
AbstractA denotational semantics for the λ-calculus is described. The semantics is continuation-base...
Abstract. Explicitly enforcing strictness is often used by functional pro-grammers as an important t...
A Scott/Strachey style denotational semantics intended to describe pure LISP is examined. I present...
Abstract. Explicitly enforcing strictness is often used by functional programmers as an important to...
This paper demonstrates that if a slicing algorithm is expressed denotationally, without intermedia...
In his seminal paper Natural Semantics for Lazy Evaluation [Lau93], John Launchbury proves his sema...
AbstractLazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a cle...
In this paper we present a denotational semantics for a lazy functional language. The semantics is i...
Abstract. Launchbury defines a natural semantics for lazy evaluation and proposes an alternative cal...
Call-by-need evaluation, also known as lazy evaluation, provides two key benefits: compositional pro...
In order to solve a long-standing problem with list fusion, a new compiler transformation, “Call Ari...
Formal description of a language gives insight into the language itself. The formal description may ...
Abstract. J. Launchbury gave an operational semantics for lazy eval-uation and showed that it is sou...
Lazy functional programming languages need lazy assertions to ensure that assertions preserve the me...
This paper presents a big-step operational semantics for distributed lazy evaluation. Our semantics ...
AbstractA denotational semantics for the λ-calculus is described. The semantics is continuation-base...
Abstract. Explicitly enforcing strictness is often used by functional pro-grammers as an important t...
A Scott/Strachey style denotational semantics intended to describe pure LISP is examined. I present...
Abstract. Explicitly enforcing strictness is often used by functional programmers as an important to...
This paper demonstrates that if a slicing algorithm is expressed denotationally, without intermedia...