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
Abstract. In game semantics and related approaches to programming language semantics, programs are m...
A comprehensive semantics for functional programs is presented, which gen-eralizes the well-known ca...
This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in ...
AbstractCall by value and call by name have some subtleties when used in a nondeterministic programm...
Understanding procedure calls is crucial in computer science and everyday programming. Among the mos...
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...
We establish a general framework for reasoning about the relationship between call-by-value and call...
We propose an abstract machine to run the call-by-value -calculus extended with a call-by-value xed-...
This paper presents semantic models of four parameter passing mechanisms utilized in various algebra...
Call-by-value languages commonly restrict recursive definitions by only allowing functions and synta...
Call-by-value and call-by-need lambda-calculi are defined using the distinguished syntactic category...
In this tutorial paper we show how to construct a step-indexed logical relation for a call-by-name p...
In call-by-value languages, some mutually-recursive value definitions can be safely evaluated to bui...
Abstract. We propose an axiomatization of fixpoint operators in typed call-by-value programming lang...
Abstract. In game semantics and related approaches to programming language semantics, programs are m...
A comprehensive semantics for functional programs is presented, which gen-eralizes the well-known ca...
This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in ...
AbstractCall by value and call by name have some subtleties when used in a nondeterministic programm...
Understanding procedure calls is crucial in computer science and everyday programming. Among the mos...
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...
We establish a general framework for reasoning about the relationship between call-by-value and call...
We propose an abstract machine to run the call-by-value -calculus extended with a call-by-value xed-...
This paper presents semantic models of four parameter passing mechanisms utilized in various algebra...
Call-by-value languages commonly restrict recursive definitions by only allowing functions and synta...
Call-by-value and call-by-need lambda-calculi are defined using the distinguished syntactic category...
In this tutorial paper we show how to construct a step-indexed logical relation for a call-by-name p...
In call-by-value languages, some mutually-recursive value definitions can be safely evaluated to bui...
Abstract. We propose an axiomatization of fixpoint operators in typed call-by-value programming lang...
Abstract. In game semantics and related approaches to programming language semantics, programs are m...
A comprehensive semantics for functional programs is presented, which gen-eralizes the well-known ca...
This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in ...