A variable-arity procedural interface

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A variable-arity procedural interface

Full text

Pdf (849 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1988 ACM conference on LISP and functional programming table of contents

Snowbird, Utah, United States

Pages: 106 - 115

Year of Publication: 1988

ISBN:0-89791-273-X

Authors

R. Kent Dybvig	Indiana University, Computer Science Department, Bloomington, IN
Robert Hieb	Indiana University, Computer Science Department, Bloomington, IN

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 16, Citation Count: 4

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/62678.62689 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Patrick Bellot , Véronique Jay, A theory for natural modelisation and implementation of functions with variability, Proc. of a conference on Functional programming languages and computer architecture, p.212-233, October 1987, Portland, Oregon, United States
	2	Carl E. Hewitt and Brian Smith, "Towards a Programming Apprentice," IEEE Transactions on Software Engineering SE-1, i (March 1975).
	3	P. J. Landin, The next 700 programming languages, Communications of the ACM, v.9 n.3, p.157-166, March 1966 [doi>10.1145/365230.365257]
	4	Robin Milner, A proposal for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.184-197, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802035]
	5	J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
	6	Guy L. Steele, Jr., Common LISP: the language, Digital Press, Newton, MA, 1984

CITED BY 4

	Henry G. Baker, CONS should not CONS its arguments, or, a lazy alloc is a smart alloc, ACM SIGPLAN Notices, v.27 n.3, p.24-34, March 1992
	R. Kent Dybvig, The development of Chez Scheme, ACM SIGPLAN Notices, v.41 n.9, September 2006
	H. Abelson , R. K. Dybvig , C. T. Haynes , G. J. Rozas , N. I. Adams, IV , D. P. Friedman , E. Kohlbecker , G. L. Steele, Jr. , D. H. Bartley , R. Halstead , D. Oxley , G. J. Sussman , G. Brooks , C. Hanson , K. M. Pitman , M. Wand , William Clinger , Jonathan Rees, Revised report on the algorithmic language scheme, ACM SIGPLAN Lisp Pointers, v.IV n.3, p.1-55, July, 1991
	Ozan S. Yigit, Readings in Scheme, ACM SIGPLAN Lisp Pointers, v.2 n.2, p.59-60, October-November-December 1988