A scheme for implementing functional values on a stack machine

Authors:
M. P. Georgeff
Affiliations:
-
Venue:
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Year:
1982

Citing 6
Cited 1

Shallow binding in Lisp 1.5

Communications of the ACM
A model and stack implementation of multiple environments

Communications of the ACM
Functional Programming

Functional Programming
Anatomy of LISP

Anatomy of LISP
The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem

ACM SIGSAM Bulletin
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

Transformations and reduction strategies for typed lambda expressions

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe a relatively simple method for handling partial application and function valued expressions in applicative (functional) programming languages. In essence, the approach defers evaluation of function valued expressions until sufficient arguments have been accumulated to reduce the expression to a basic (non-functional) value. This results in a stack-like environment structure, and thus obviates the need for the more complex environment management schemes used for the tree-like environment structures created by standard evaluators.