(Enter summary)
Abstract: . This article presents a convenient and efficient procedural interface that
allows the definition and use of procedures with optional arguments and indefinite numbers
of arguments without resorting to the use of a language-dependent data structure
in which to store the arguments. This interface solves many of the problems inherent
in the use of lists in Lisp and Scheme to store indefinite numbers of arguments. Simple
recursion can be used to consume such arguments without the complexity... (Update)
Context of citations to this paper: More
.... The compiler processes R 4 RS Scheme [8] and directly supports multiple return values [1] and a variable arity procedure interface [11]. As defined in Section 2, the analysis can process only closed programs, i.e. programs with no free variables other than recognized...
...can be performed out of line to reduce code size. Our implementation supports a multiple arity procedure call interface with case lambda [4, 12]. A case lambda expression takes the following form: case lambda (idspec body ) Each clause of a case lambda expression...
Cited by: More
Selectors Make Analyzing case-lambda Too Hard - Meunier, Findler, Steckler, Wand (2001)
(Correct)
Abstraction and Performance from Explicit Monadic.. - Sobel, Hilsdale, Dybvig, ..
(Correct)
A Practical and Flexible Flow Analysis for Higher-Order Languages - Ashley, Dybvig (1997)
(Correct)
Active bibliography (related documents): More All
0.1: Natural Deduction as Higher-Order Resolution - Paulson (1986)
(Correct)
0.1: Basic Polymorphic Typechecking - Cardelli (1988)
(Correct)
0.1: A Polymorphic lambda-calculus with Type:Type - Cardelli (1986)
(Correct)
Similar documents based on text: More All
0.2: Subcontinuations - Hieb, Dybvig, Anderson (1993)
(Correct)
0.1: Destination-Driven Code Generation - Dybvig, Hieb, Butler (1990)
(Correct)
0.1: Syntactic Abstraction in Scheme - Dybvig, Hieb, Bruggeman (1993)
(Correct)
Related documents from co-citation: More All
5: A unified treatment of flow analysis in higher-order languages
- Jagannathan, Weeks - 1995
5: The interprocedural analysis and automatic parallelization of Scheme programs (context) - William - 1989
5: Set-based analysis of ML programs (context) - Heintze - 1994
BibTeX entry: (Update)
R. Kent Dybvig and Robert Hieb. A new approach to procedures with variable arity. Lisp and Symbolic Computation, 3(3):229--244, September 1990. http://citeseer.ist.psu.edu/dybvig90new.html More
@article{ dybvig90new,
author = "R. Kent Dybvig and Robert Hieb",
title = "A New Approach to Procedures with Variable Arity",
journal = "Lisp and Symbolic Computation: An International Journal",
volume = "3",
number = "3",
publisher = "Kluwer Academic Publishers",
pages = "229--244",
year = "1990",
url = "citeseer.ist.psu.edu/dybvig90new.html" }
Citations (may not include all citations):
484
Common Lisp: The Language (context) - Steele - 1984
197
The revised 3 report on the algorithmic language scheme
- Rees, Clinger - 1986
84
The next 700 programming languages (context) - Landin - 1966
10
IEEE Transactions on Software Engineering (context) - Hewitt, Smith et al. - 1975
8
ACM Symposium on LISP and Functional Programming (context) - Milner - 1984
1
A theory for natural modelisation and implementation of func.. (context) - Bellot, Jay - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/~dyb/pubs.html): More
Don't Stop the BIBOP: Flexible and Efficient Storage.. - Dybvig, Eby, Bruggeman (1994)
(Correct)
Threads Yield Continuations - Kumar, Bruggeman, Dybvig (1997)
(Correct)
An Efficient Implementation of Multiple Return Values in Scheme - Ashley, Dybvig (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC