An Efficient Implementation of Multiple Return Values in Scheme

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.

• Type: Conference
• Year: 1994
• Where: LFP
• Authors: J. Michael Ashley, R. Kent Dybvig
• Keywords: Heap-based Run-time Architectures, LFP 1994, Multiple Values, Scheme Multiple Values