Papers by Gianfranco Prini
Journal of Computer and System Sciences, 1981
A call-by-need reduction algorithm for the LAMBDA-calculus is presented. Call-by-need is as effic... more A call-by-need reduction algorithm for the LAMBDA-calculus is presented. Call-by-need is as efficient as call-by-value and is equivalent to call-by-name in languages without side effects. The algorithm, which is the core of a running system, is presented by illustrating successive transformations of a straightforward implementation of the classical definition of reduction in the LAMBDA-calculus.
Lecture Notes in Computer Science, 1976
ABSTRACT Without Abstract
Information Processing Letters, 1979
We introduce a LISP-like language whose parameter passing mechanism and control primitives allow ... more We introduce a LISP-like language whose parameter passing mechanism and control primitives allow for the creation and the synchronization of an arbitrary number of concurrent computations. The parameter passing mechanism is a parallel version of call-by-need: an argument of a function is evaluated only the first time the value of the corresponding formal parameter is needed during the evaluation of
Journal of Computer and System Sciences, 1981
A call-by-need reduction algorithm for the LAMBDA-calculus is presented. Call-by-need is as effic... more A call-by-need reduction algorithm for the LAMBDA-calculus is presented. Call-by-need is as efficient as call-by-value and is equivalent to call-by-name in languages without side effects. The algorithm, which is the core of a running system, is presented by illustrating successive transformations of a straightforward implementation of the classical definition of reduction in the LAMBDA-calculus.
ABSTRACT Without Abstract
Uploads
Papers by Gianfranco Prini