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
AbstractA theory of abstract interpretation (P. Cousot and R. Cousot, in “Conf. Record, 4th ACM Symp...
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
AbstractAmong all the reduction strategies for the untyped λ-calculus, the so called lazy β-evaluati...
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...
AbstractWe show the adequacy of axioms and proof rules for strict and lazy functional programs. Our ...
AbstractA theory of lazy λ-calculus is developed as a basis for lazy functional programming language...
technical reportA denotational semantics is given for a lazy functional language with monotonic side...
Lazy functional programming languages need lazy assertions to ensure that assertions preserve the me...
In these lecture notes we present a few basic approaches to the definition of the semantics of progr...
Denotational semantics is presented as a valuable theoretical tool, having many applications includi...
The paper explores different approaches for modeling the lazy -calculus, which is a paradigmatic lan...
In this paper we present a debugging model for a lazy functional logic programming language whose se...
Formal description of a language gives insight into the language itself. The formal description may ...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
AbstractA theory of abstract interpretation (P. Cousot and R. Cousot, in “Conf. Record, 4th ACM Symp...
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
AbstractAmong all the reduction strategies for the untyped λ-calculus, the so called lazy β-evaluati...
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...
AbstractWe show the adequacy of axioms and proof rules for strict and lazy functional programs. Our ...
AbstractA theory of lazy λ-calculus is developed as a basis for lazy functional programming language...
technical reportA denotational semantics is given for a lazy functional language with monotonic side...
Lazy functional programming languages need lazy assertions to ensure that assertions preserve the me...
In these lecture notes we present a few basic approaches to the definition of the semantics of progr...
Denotational semantics is presented as a valuable theoretical tool, having many applications includi...
The paper explores different approaches for modeling the lazy -calculus, which is a paradigmatic lan...
In this paper we present a debugging model for a lazy functional logic programming language whose se...
Formal description of a language gives insight into the language itself. The formal description may ...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
AbstractA theory of abstract interpretation (P. Cousot and R. Cousot, in “Conf. Record, 4th ACM Symp...
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
AbstractAmong all the reduction strategies for the untyped λ-calculus, the so called lazy β-evaluati...
DOI
Add to ORKG