Article

Free access

A variable-arity procedural interface

Authors:

R. Kent Dybvig,

Robert HiebAuthors Info & Claims

LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programming

Pages 106 - 115

https://doi.org/10.1145/62678.62689

Published: 01 January 1988 Publication History

PDF eReader

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

[1]

Patrick Bellot and Ve/onique Jay, "A Theory for Natural Modelisation and Implementation of Functions with Variable Arity," Proceedings of the 1987 Conference on Functional Programming and Computer Architecture, LNCS 274, ed. Giles Kahn (September 1987).

Digital Library

Google Scholar

[2]

Carl E. Hewitt and Brian Smith, "Towards a Programming Apprentice," IEEE Transactions on Software Engineering SE-1, i (March 1975).

Google Scholar

[3]

Peter J. Landin, "The Next 700 Programming Languages," Communications of the A CM 9, 3 (March 1966).

Digital Library

Google Scholar

[4]

Robin Milner, "A Proposal for Standard ML," Conference Record of the 198d ACM Symposium on LISP and Functional Programming (August 1984).

Digital Library

Google Scholar

[5]

Jonathan A. Rees and William Clinger, eds., "The Revised3 Report on the Algorithmic Language Scheme," $~GPLAN Notices 21, 12 (December 1986).

Digital Library

Google Scholar

[6]

Guy L. Steele, Jr., Common Lisp: The Language, Digital Press (1984).

Digital Library

Google Scholar

Cited By

View all

Dybvig R(2006)The development of Chez SchemeACM SIGPLAN Notices10.1145/1160074.115980541:9(1-12)Online publication date: 16-Sep-2006
https://dl.acm.org/doi/10.1145/1160074.1159805
Dybvig RReppy JLawall J(2006)The development of Chez SchemeProceedings of the eleventh ACM SIGPLAN international conference on Functional programming10.1145/1159803.1159805(1-12)Online publication date: 17-Sep-2006
https://dl.acm.org/doi/10.1145/1159803.1159805
Baker H(1992)CONS should not CONS its arguments, or, a lazy alloc is a smart allocACM SIGPLAN Notices10.1145/130854.13085827:3(24-34)Online publication date: 1-Mar-1992
https://dl.acm.org/doi/10.1145/130854.130858
Show More Cited By

Index Terms

A variable-arity procedural interface
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Procedures, functions and subroutines

Recommendations

Defeasible reasoning with variable degrees of justification

The question addressed in this paper is how the degree of justification of a belief is determined. A conclusion may be supported by several different arguments, the arguments typically being defeasible, and there may also be arguments of varying ...
Interface Compilation: Steps Toward Compiling Program Interfaces as Languages

Interfaces the collection of procedures and data structures that define a library, a subsystem, a module are syntactically poor programming languages. They have state (defined both by the interface's data structures and internally), operations on this ...
Higher-order arity raising
ICFP '98: Proceedings of the third ACM SIGPLAN international conference on Functional programming

Arity raising, also known as variable splitting or flattening, is the program optimization which transforms a function of one argument into a function of several arguments by decomposing the structure of the original one argument into individual ...

Comments

Information & Contributors

Information

Published In

LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programming

January 1988

351 pages

ISBN:089791273X

DOI:10.1145/62678

Chairman:
Jerome Chailloux
INRIA, Rocquencourt

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

LISP88

Sponsor:

LISP88: Lisp & Functional Programming 88

July 25 - 27, 1988

Utah, Snowbird, USA

Acceptance Rates

Overall Acceptance Rate 30 of 109 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
293
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)6

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dybvig R(2006)The development of Chez SchemeACM SIGPLAN Notices10.1145/1160074.115980541:9(1-12)Online publication date: 16-Sep-2006
https://dl.acm.org/doi/10.1145/1160074.1159805
Dybvig RReppy JLawall J(2006)The development of Chez SchemeProceedings of the eleventh ACM SIGPLAN international conference on Functional programming10.1145/1159803.1159805(1-12)Online publication date: 17-Sep-2006
https://dl.acm.org/doi/10.1145/1159803.1159805
Baker H(1992)CONS should not CONS its arguments, or, a lazy alloc is a smart allocACM SIGPLAN Notices10.1145/130854.13085827:3(24-34)Online publication date: 1-Mar-1992
https://dl.acm.org/doi/10.1145/130854.130858
Abelson HDybvig RHaynes CRozas GAdams NFriedman DKohlbecker ESteele GBartley DHalstead ROxley DSussman GBrooks GHanson CPitman KWand M(1991)Revised4 report on the algorithmic language schemeACM SIGPLAN Lisp Pointers10.1145/382130.382133IV:3(1-55)Online publication date: 1-Jul-1991
https://dl.acm.org/doi/10.1145/382130.382133
Yigit O(1988)Readings in SchemeACM SIGPLAN Lisp Pointers10.1145/1317250.13172562:2(59-60)Online publication date: 1-Oct-1988
https://dl.acm.org/doi/10.1145/1317250.1317256

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Defeasible reasoning with variable degrees of justification

Interface Compilation: Steps Toward Compiling Program Interfaces as Languages

Higher-order arity raising

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Defeasible reasoning with variable degrees of justification

Interface Compilation: Steps Toward Compiling Program Interfaces as Languages

Higher-order arity raising

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations