AbstractA denotational semantics for the λ-calculus is described. The semantics is continuation-based, and so reflects the order in which expressions are evaluated. It provides a means by which lazy functional languages can be better understood
Abstract Needed narrowing [2] is currently the best (lazy) narrowing strategy for functional logic p...
In these lecture notes we present a few basic approaches to the definition of the semantics of progr...
This paper describes the construction of two set-theoretic denotational models for the π-calculus. T...
AbstractA denotational semantics for the λ-calculus is described. The semantics is continuation-base...
In this paper we present a denotational semantics for a lazy functional language. The semantics is i...
AbstractA theory of lazy λ-calculus is developed as a basis for lazy functional programming language...
Formal description of a language gives insight into the language itself. The formal description may ...
The paper explores different approaches for modeling the lazy -calculus, which is a paradigmatic lan...
AbstractThe use of λ-calculus in richer settings, possibly involving parallelism, is examined in ter...
AbstractWe define a denotational semantics for a kernel-calculus of the parallel functional language...
This paper is based on a recently developed technique to build debugging tools for lazy functional p...
Lambda Calculus is commonly thought to be the basis for functional programming. However, there is a ...
In these lecture notes we present a few basic approaches to the definition of the semantics of progr...
In this paper we present a debugging model for a lazy functional logic programming language whose se...
We introduce a denotational characterization of narrowing, the computational engine of many function...
Abstract Needed narrowing [2] is currently the best (lazy) narrowing strategy for functional logic p...
In these lecture notes we present a few basic approaches to the definition of the semantics of progr...
This paper describes the construction of two set-theoretic denotational models for the π-calculus. T...
AbstractA denotational semantics for the λ-calculus is described. The semantics is continuation-base...
In this paper we present a denotational semantics for a lazy functional language. The semantics is i...
AbstractA theory of lazy λ-calculus is developed as a basis for lazy functional programming language...
Formal description of a language gives insight into the language itself. The formal description may ...
The paper explores different approaches for modeling the lazy -calculus, which is a paradigmatic lan...
AbstractThe use of λ-calculus in richer settings, possibly involving parallelism, is examined in ter...
AbstractWe define a denotational semantics for a kernel-calculus of the parallel functional language...
This paper is based on a recently developed technique to build debugging tools for lazy functional p...
Lambda Calculus is commonly thought to be the basis for functional programming. However, there is a ...
In these lecture notes we present a few basic approaches to the definition of the semantics of progr...
In this paper we present a debugging model for a lazy functional logic programming language whose se...
We introduce a denotational characterization of narrowing, the computational engine of many function...
Abstract Needed narrowing [2] is currently the best (lazy) narrowing strategy for functional logic p...
In these lecture notes we present a few basic approaches to the definition of the semantics of progr...
This paper describes the construction of two set-theoretic denotational models for the π-calculus. T...
DOI
Add to ORKG