AbstractCall by value and call by name have some subtleties when used in a nondeterministic programming language. A common formalism is used to establish the denotational semantics of recursive programs called by name and called by value. Ashcroft and Hennessy introduced the idea of differentiating between selecting arguments from a set of arguments at the point of invocation and selecting arguments during the run of the procedure. This distinction is shown to be independent of the evaluation according to value or name, giving rise to four possible parameter passing methods, all of which have a suitable least fixed point semantics
AbstractThe paper presents a calculus of recursively-scoped records: a two-level calculus with a tra...
AbstractWe present a general semantic universe of call-by-value computation based on elements of gam...
International audienceThis paper formalizes and proves correct a compilation scheme for mutually-rec...
AbstractCall by value and call by name have some subtleties when used in a nondeterministic programm...
This paper presents semantic models of four parameter passing mechanisms utilized in various algebra...
Understanding procedure calls is crucial in computer science and everyday programming. Among the mos...
We establish a general framework for reasoning about the relationship between call-by-value and call...
AbstractParameter mechanisms for recursive procedures are investigated. Contrary to the view of Mann...
The choice of a parameter-passing technique is an important decision in the design of a high-level p...
The object of this paper is to study the mechanism of recursion in a simple, LISP-like programming l...
The article defines algebraic semantics of singular (call-time-choice) and plural (run-time-choice) ...
AbstractTwo definitions of a language of communicating programs are offered: one by denotational sem...
Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, ...
A comprehensive semantics for functional programs is presented, which generalizes the well-known cal...
Call-by-value and call-by-need lambda-calculi are defined using the distinguished syntactic category...
AbstractThe paper presents a calculus of recursively-scoped records: a two-level calculus with a tra...
AbstractWe present a general semantic universe of call-by-value computation based on elements of gam...
International audienceThis paper formalizes and proves correct a compilation scheme for mutually-rec...
AbstractCall by value and call by name have some subtleties when used in a nondeterministic programm...
This paper presents semantic models of four parameter passing mechanisms utilized in various algebra...
Understanding procedure calls is crucial in computer science and everyday programming. Among the mos...
We establish a general framework for reasoning about the relationship between call-by-value and call...
AbstractParameter mechanisms for recursive procedures are investigated. Contrary to the view of Mann...
The choice of a parameter-passing technique is an important decision in the design of a high-level p...
The object of this paper is to study the mechanism of recursion in a simple, LISP-like programming l...
The article defines algebraic semantics of singular (call-time-choice) and plural (run-time-choice) ...
AbstractTwo definitions of a language of communicating programs are offered: one by denotational sem...
Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, ...
A comprehensive semantics for functional programs is presented, which generalizes the well-known cal...
Call-by-value and call-by-need lambda-calculi are defined using the distinguished syntactic category...
AbstractThe paper presents a calculus of recursively-scoped records: a two-level calculus with a tra...
AbstractWe present a general semantic universe of call-by-value computation based on elements of gam...
International audienceThis paper formalizes and proves correct a compilation scheme for mutually-rec...