A proposed solution to the FUNARG problem

Authors:
Erik Sandewall
Affiliations:
-
Venue:
ACM SIGSAM Bulletin
Year:
1971

Citing 3
Cited 6

On Efficient Ways of Evaluating Certain Recursive Functions

On Efficient Ways of Evaluating Certain Recursive Functions
The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem

ACM SIGSAM Bulletin
SIMULA 67 common base language, (Norwegian Computing Center. Publication)

SIMULA 67 common base language, (Norwegian Computing Center. Publication)

Desiderata for the standardization of LISP

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
An Early Use of Continuations and Partial Evaluation for Compiling Rules Written in First-Order Predicate Calculus

Higher-Order and Symbolic Computation
The language LISP does not exist?

ACM SIGPLAN Notices
Conversion of Predicate-Calculus Axioms to Corresponding Deterministic Programs

IEEE Transactions on Computers
Conversion of predicate-calculus axioms, viewed as non-deterministic programs, to corresponding deterministic programs

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Deep and shallow binding: The assignment operation

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a response to Joel Moses's recent paper, "The Function of FUNCTION in LISP, or ... ". We give some examples where the FUNARG feature of LISP 1. 5 is relative useful, and suggest a computationally efficient implementation of FUNARG. The idea in the proposal is to let a FUNARG-expression create indirect-addressing type bindings on the push-list for variables.