Loading...
Please wait, while we are loading the content...
Similar Documents
An Efficient Implementation of Multiple Return Values in Scheme (1994)
| Content Provider | CiteSeerX |
|---|---|
| Author | Ashley, Michael Dybvig, R. Kent |
| Description | In Proceedings of the 1994 ACM Conference on LISP and Functional Programming In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming |
| 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. 1 Introduction In this paper we describe an implementation of the new Scheme multiple values interface that handles multiple values efficiently without penalizing code that does not use them or sacrificing our fast implementation of first-class continuations. Full run-time error checking is performed to insure that the correct number of values is received in all situations. We also describe how the implementation can be adapted to handle Common Lisp's multiple val... |
| File Format | |
| Publisher Date | 1994-01-01 |
| Access Restriction | Open |
| Subject Keyword | Run-time Overhead Multiple Val Heap-based Run-time Architecture Error Check Expected Number Efficient Implementation Common Lisp Full Run-time Error Checking First-class Continuation Direct-style Compiler Multiple Value New Scheme Multiple Value Correct Number Fast Implementation Continuation-passing Style Compiler Multiple Return Value Stack-based Representation Normal Call |
| Content Type | Text |
| Resource Type | Proceeding Conference Proceedings Article |
