A variable-arity procedural interface

Authors:
R. Kent Dybvig;Robert Hieb
Affiliations:
Indiana University, Computer Science Department, Bloomington, IN;Indiana University, Computer Science Department, Bloomington, IN
Venue:
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Year:
1988

Citing 5
Cited 4

Revised report on the algorithmic language scheme

ACM SIGPLAN Notices
Common LISP: the language

Common LISP: the language
A theory for natural modelisation and implementation of functions with variability

Proc. of a conference on Functional programming languages and computer architecture
The next 700 programming languages

Communications of the ACM
A proposal for standard ML

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming

CONS should not CONS its arguments, or, a lazy alloc is a smart alloc

ACM SIGPLAN Notices
Revised report on the algorithmic language scheme

ACM SIGPLAN Lisp Pointers
The development of Chez Scheme

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Readings in Scheme

ACM SIGPLAN Lisp Pointers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a procedural interface that handles optional arguments and indefinite numbers of arguments in a convenient and efficient manner without resorting to storing the arguments in a language-dependent data structure. This interface solves many of the problems inherent in the use of lists to store indefinite numbers of arguments. Simple recursion can be used to consume such arguments without the complexity problems caused by the use of the Lisp procedure apply on argument lists. An extension that supports multiple return values is also presented.