Threshold evaluation and the semantics of call by value, assignment and generic procedures

Authors:
Bernard Lang
Affiliations:
IRIA, LABORIA, 78150 - Rocquencourt, FRANCE
Venue:
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1977

Citing 8
Cited 1

Fixpoint approach to the theory of computation

Communications of the ACM
Recursion and Parameter Mechanisms: An Axiomatic Approach

Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Least fixed points revisited

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Correct and optimal implementations of recursion in a simple programming language

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Some transformations for developing recursive programs

Proceedings of the international conference on Reliable software
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Recursive definitions of partial functions and their computations

Recursive definitions of partial functions and their computations
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

Comparing approaches to generic programming in Haskell

SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use the concept of evaluation up to a given threshold of information to generalize the semantics of call by value and assignment to non-discrete domains, and to define a formal semantics for generic procedures. We then prove the correctness of McCarthy's transformation of iterative programs into recursive ones provided the same threshold is used for assignment and parameter passing.