An efficient implementation of multiple return values in Scheme

ABSTRACT

This paper describes an implementation of the new Scheme multiple values interface. The implementation handles multiple values efficiently, with no run-time overhead for normal calls and returns. Error checks are performed where necessary to insure that the expected number of values is returned in all situations. The implementation fits cleanly with our direct-style compiler and stack-based representation of control, but is equally well suited to continuation-passing style compilers and to heap-based run-time architectures.

REFERENCES

• 1: 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 [doi>10.1145/382130.382133]
• 2: Olivier Danvy , Julia L. Lawall, Back to direct style II: first-class continuations, Proceedings of the 1992 ACM conference on LISP and functional programming, p.299-310, June 22-24, 1992, San Francisco, California, United States
• 3: R. Kent Dybvig, David Eby, and Carl Bruggeman. A segmented memory model for storage management in Scheme. Technical Report 400, Indiana University Computer Science Department, Lindley Hall 215, Bloomington Indiana, 47405, 1994.
• 4: R. Kent Dybvig , R. Hieb, A new approach to procedures with variable arity, Lisp and Symbolic Computation, v.3 n.3, p.229-244, Sep. 1990 [doi>10.1007/BF01806099]
• 5: Richard P. Gabriel, Performance and evaluation of LISP systems, Massachusetts Institute of Technology, Cambridge, MA, 1985
• 6: Chris Hanson, MIT Scheme Reference Manual, Massachusetts Institute of Technology, Cambridge, MA, 1991
• 7: R. Hieb , R. Kent Dybvig , Carl Bruggeman, Representing control in the presence of first-class continuations, Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, p.66-77, June 1990, White Plains, New York, United States
• 8: Guy L. Steele Jr. Common Lisp. Digital Press, second edition, 1990.
• 9: Simon L. Peyton-Jones. Implementing lazy functional languages on stock hardware: the Spineless Tagless G- machine. Journal of Functional Programming, 2(2), April 1992.
• 10: Jonathan Rees, The scheme of things: the June 1992 meeting, ACM SIGPLAN Lisp Pointers, v.V n.4, p.40-45, Oct. 1992 [doi>10.1145/382126.382667]
• 11: System V Application Binary Interface, SPARC Processor Supplement, 1990.
• 12: Cadence Research Systems. Chez Scheme System Manual. Bloomington, Indiana, February 1992.
• 13: T Version 3.0 Release Notes.
• 14: Taiichi Yuasa, Design and implementation of Kyoto Common Lisp, Journal of Information Processing, v.13 n.3, p.284-295, 1990

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: SCHEME

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.8 Metrics
          Subjects: Performance measures
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: Common Lisp
      D.3.3 Language Constructs and Features
          Subjects: Procedures, functions, and subroutines

  F. Theory of Computation
  F.3 LOGICS AND MEANINGS OF PROGRAMS

General Terms:
Algorithms, Languages, Performance