Results 1 
3 of
3
LambdaCalculus Schemata
, 1993
"... A lambdacalculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit functions to be passed to and returned from other functions. When given an interpretation for its constan ..."
Abstract

Cited by 101 (1 self)
 Add to MetaCart
A lambdacalculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit functions to be passed to and returned from other functions. When given an interpretation for its constant and operator symbols, certain schemata, called lambda abstractions, naturally define partial functions over the domain of interpretation. Two implementation strategies are considered: the retention strategy in which all variable bindings are retained until no longer needed (implying the use of some sort of garbagecollected store) and the deletion strategy, modeled after the usual stack implementation of ALGOL 60, in which variable bindings are destroyed when control leaves the procedure (or block) in which they were created. Not all lambda abstractions evaluate correctly under the deletion strategy. Nevertheless, both strategies are equally powerful in the sense that any lambda abstraction can be mechanically translated into another that evaluates correctly under the deletion strategy and defines the same partial function over the domain of interpretation as the original. Proof is by translation into continuationpassing style.
The transition from VDL to VDM
 JUCS
"... This paper describes (one person’s view of) how the Vienna Development Method grew out of the earlier work on the Vienna Definition Language. Both of these activities were undertaken at the IBM Laboratory Vienna during the 1960s and 70s. Dedication In gratitude to Peter Lucas who is a generous and c ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
This paper describes (one person’s view of) how the Vienna Development Method grew out of the earlier work on the Vienna Definition Language. Both of these activities were undertaken at the IBM Laboratory Vienna during the 1960s and 70s. Dedication In gratitude to Peter Lucas who is a generous and challenging colleague who (twice) aided me in moving to a delightful city which changed my life. Please cite the original publication:
The equivalence of models of tasking
 Proc. of ACM Conf. on Proving Assertions about Programs, SIGPLAN Not
, 1972
"... Abstract. A technique for proving the equivalence of implementations of multitasking programming languages is developed and applied to proving the equivalence of the contour model and a multitasking version of the copy rule. In multitasking programming languages, e.g. Algol 68 [vWN 69] and PL/I [ ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. A technique for proving the equivalence of implementations of multitasking programming languages is developed and applied to proving the equivalence of the contour model and a multitasking version of the copy rule. In multitasking programming languages, e.g. Algol 68 [vWN 69] and PL/I [Wlk 69], the inherent nondeterminism associated with tasking accentuates the difficulty of precisely describing computations