Marc Feeley, James S. Miller, Guillermo J. Rozas, Jason A. Wilson  Home/Search
Context Related
| iro.umontreal.ca/~feeley...tr1078.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iro.umontreal.ca/~feeley/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Two independently developed implementations of Scheme have been extended to compile into portable C code that implements full tail-recursion. Like other compilers for higher-order languages that implement full tail-recursion, measurements of these systems indicate a performance degradation of a factor between two and three compared to the native code emitted by the same compilers. We describe the details of the compilation technique for a non-statically typed language (Scheme) and show that the ... (Update)
Context of citations to this paper: More
...instruction set is shown in the Appendix, Table 7. 2. 1 Scheme compilation to Machina We use the front end of Gambit C s Scheme compiler [8] to generate Machina code. The compilation is straightforward but some technical details are important to better understand the...
...if machine code was generated. Programs compiled with Gambit C run on average about half as fast as when machine code is generated [FMRW97]. Fortunately most of the benchmarks used here rely on local tail calls which are handled eciently. There should not be a big di erence...
Cited by: More
Compiling Scheme to JVM bytecode: a performance study - Serpette, Serrano (2002) (Correct)
Implementing Constraint Imperative Languages with Higher-Order.. - Grabmüller (2003) (Correct)
A Case for the Unified Heap Approach to Erlang Memory Management - Feeley (2001) (Correct)
Active bibliography (related documents): More All
0.3: Learning a Factorized Segmental Representation of Far-Field.. - Stauffer (2004) (Correct)
0.3: Factored Latent Analysis for far-field tracking data - Stauffer (2004) (Correct)
0.2: Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees.. (1991) (Correct)
Similar documents based on text: More All
0.1: Lambda-lifting as an optimization for compiling Scheme to C - Tammet (Correct)
0.1: Numerical Partial Differential Equations in Scheme - Lucier (2000) (Correct)
0.1: A Compacting Incremental Collector and its Performance in a.. - Martin Larose (1998) (Correct)
Related documents from co-citation: More All
5: No assembly required: Compiling Standard ML to C - Tarditi, Acharya et al. - 1990
4: Compiler available at ftp (context) - Feeley
3: Polling efficiently on stock hardware - Feeley - 1993
BibTeX entry: (Update)
M. Feeley, J. Miller, G. Rozas, and J. Wilson. Compiling Higher-Order Languages into Fully Tail-Recursive Portable C. Technical Report 1078, D'epartement d'informatique et de recherche op'erationelle, Universit'e de Montr'eal, 1997. http://citeseer.ist.psu.edu/feeley97compiling.html More
@misc{ feeley97compiling,
author = "M. Feeley and J. Miller and G. Rozas and J. Wilson",
title = "Compiling Higher-Order Languages into Fully Tail-Recursive Portable C",
text = "M. Feeley, J. Miller, G. Rozas, and J. Wilson. Compiling Higher-Order Languages
into Fully Tail-Recursive Portable C. Technical Report 1078, D'epartement
d'informatique et de recherche op'erationelle, Universit'e de Montr'eal,
1997.",
year = "1997",
url = "citeseer.ist.psu.edu/feeley97compiling.html" }
Citations (may not include all citations):484 Common LISP The Language (context) - Steele - 1990
384 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
146 The glasgow haskell compiler: a technical overview - Peyton-Jones, Hall et al. - 1992
116 Rabbit: A compiler for Scheme (context) - Steele - 1978
109 The Implementation of Functional Programming Languages (context) - Jones - 1987
70 No assembly required: Compiling standard ML to C - Tarditi, Acharya et al. - 1990
68 Performance and Evaluation of LISP Systems (context) - Gabriel - 1985
67 Representing control in the presence of first-class continua.. - Hieb, Dybvig et al. - 1990
38 a portable Scheme-to-C compiler (context) - Bartlett - 1989
27 Implementation strategies for continuations (context) - Clinger, Hartheimer et al. - 1988
13 Free variables and first-class environments (context) - Miller, Rozas - 1991
12 Tags and type checking in lisp: Hardware and software approa.. (context) - Steenkiste, Hennessy - 1987
11 Efficient stack allocation for tail-recursive languages (context) - Hanson - 1990
11 A parallel virtual machine for efficient Scheme compilation - Feeley, Miller - 1990
8 expensive procedure call (context) - Steele, the - 1977
3 Artificial Intelligence Laboratory (context) - Hanson, reference et al. - 1991
1 Bigloo user's manual version (context) - Serrano - 1993
1 Documentation for Hobbit version (context) - Tammet - 1993
1 Dylan tm An Object-Oriented Dynamic Language (context) - Computer - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.iro.umontreal.ca/~feeley/): More
Benchmarking Implementations of Functional.. - Hartel, Feeley.. (1993) (Correct)
Closure generation based on viewing LAMBDA as EPSILON plus.. - Feeley, Lapalme (1992) (Correct)
An Efficient and General Implementation of Futures on Large Scale .. - Feeley (1993) (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