conservatory
/
readscheme-website
4
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
readscheme-website/www/page8.html

1715 lines
84 KiB
HTML
Raw Normal View History

Run format script
2024-06-16 09:58:08 -04:00
<!DOCTYPE html>
<html>
<head>
<title>
Compiler Technology/Implementation Techniques and
Optimization
</title>
<meta name="generator" content="SchemeBib and Site-ML" charset=
"utf-8">
<meta name="description" content=
"Online bibliography of Scheme research">
<meta name="keywords" content=
"Scheme, bibliography, research, implementation, compiler">
<meta name="robots" content="index,follow">
<link rel="stylesheet" href="basic.css" type="text/css">
</head>
<body>
<table width="100%">
<tr valign="top">
<td width="124">
<table width="124">
<tr width="124" height="45">
<td width="124" height="45">
Disable link to top-level readscheme.org This is a mirror of library.readscheme.org. The domain readscheme.org included a bunch of other stuff only tangentially related to Scheme. Since that stuff is off-topic at scheme.org and readscheme.org has been taken over by a domain squatter, the least confusing thing to do is probably to disable the link.
2024-06-16 12:23:48 -04:00
<img width="124" height="45" border="0" alt=
"Readscheme.org" src="./imgs/nav-logo.gif">
Run format script
2024-06-16 09:58:08 -04:00
</td>
</tr>
<tr width="124" height="124">
<td width="124" height="124">
<a href="./index.html" target="_top"><img width=
"124" height="124" border="0" alt=
"Scheme Bibliography Home" src=
"./imgs/nav_mainlogo.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./page1.html" target="_top"><img width=
"124" height="30" border="0" alt="Classics" src=
"./imgs/nav_classics.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page2.html" target="_top"><img width=
"124" height="18" border="0" alt="Semantics" src=
"./imgs/nav_sem.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page3.html" target="_top"><img width=
"124" height="18" border="0" alt="Macros" src=
"./imgs/nav_macros.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page4.html" target="_top"><img width=
"124" height="18" border="0" alt="Objects" src=
"./imgs/nav_objects.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./page5.html" target="_top"><img width=
"124" height="30" border="0" alt="Modules" src=
"./imgs/nav_modules.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page6.html" target="_top"><img width=
"124" height="18" border="0" alt="Continuations"
src="./imgs/nav_cps.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./pagexml.html" target="_top"><img width=
"124" height="30" border="0" alt="Web Programming"
src="./imgs/nav_xml.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page7.html" target="_top"><img width=
"124" height="18" border="0" alt="Applications"
src="./imgs/nav_appl.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page8.html" target="_top"><img width=
"124" height="18" border="0" alt="Implementation"
src="./imgs/focus_nav_impl.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./page9.html" target="_top"><img width=
"124" height="30" border="0" alt=
"Concurrent Programming" src=
"./imgs/nav_conc.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./page10.html" target="_top"><img width=
"124" height="30" border="0" alt=
"Partial Evaluation" src="./imgs/nav_pe.gif"></a>
</td>
</tr>
<tr width="124" height="18">
<td width="124" height="18">
<a href="./page11.html" target="_top"><img width=
"124" height="18" border="0" alt="Reflection" src=
"./imgs/nav_reflect.gif"></a>
</td>
</tr>
<tr width="124" height="30">
<td width="124" height="30">
<a href="./whats_new.html" target=
"_top"><img width="124" height="30" border="0" alt=
"Recent Additions" src="./imgs/nav_recent.gif"></a>
</td>
</tr>
</table>
</td>
<td width="20">
<img width="20" height="1" border="0" src=
"./imgs/dot_clear.gif">
</td>
<td>
<a name="implementation" id="implementation"></a>
<h2>
Compiler Technology/Implementation Techniques and
Optimization
</h2><a name="basic-techniques" id=
"basic-techniques"></a>
<h3>
Basic Techniques
</h3>
<ul>
<li>Guy Lewis Steele, Jr.. "RABBIT: A Compiler for
SCHEME". Masters Thesis. MIT AI Lab. AI Lab Technical
Report AITR-474. May 1978. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AITR-474.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AITR-474.pdf">
pdf</a>.
</li>
<li>David A. Kranz, Richard A. Kelsey, Jonathan A.
Rees, Paul Hudak and James Philbin. "ORBIT: an
optimizing compiler for scheme". <em>Proceedings of the
SIGPLAN symposium on Compiler contruction</em>. June
1986. Available online: <a href=
"http://www.acm.org/pubs/citations/proceedings/plan/12276/p219-kranz/">
ACM Digital Library</a>.
</li>
<li>David A. Kranz. "ORBIT: An Optimizing Compiler for
Scheme". PhD. Thesis. Yale. 1988. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/orbit-thesis.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/orbit-thesis.pdf">
pdf</a>.
</li>
<li>Marc Feeley. "Deux approches à l'implantation du
language Scheme". Masters Thesis. Université de
Montréal. May 1986. Available online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/msc.ps.gz">
ps</a>.
</li>
<li>R. Kent Dybvig. "Three Implementation Models for
Scheme". PhD. Thesis. University of North Carolina,
Computer Science Department. Technical Report 87-011.
April 1987. Available online: <a href=
"http://www.cs.indiana.edu/~dyb/papers/3imp.pdf">pdf</a>.
</li>
<li>William D. Clinger. "The scheme 311 compiler an
exercise in denotational semantics". <em>1984 ACM
Symposium on LISP and functional programming</em>.
1984. Available online: <a href=
"http://portal.acm.org/citation.cfm?id=802052">ACM
Digital Library</a>.
</li>
<li>David H. Bartley and John C. Jensen. "The
implementation of PC Scheme". <em>Proceedings of the
1986 ACM conference on LISP and functional
programming</em>. 1986. Available online: <a href=
"http://portal.acm.org/citation.cfm?id=319852">ACM
Digital Library</a>.
</li>
<li>Manuel Serrano. "Vers une programmation
fonctionnelle praticable". 2000. Available online:
<a href=
"http://www.inria.fr/mimosa/Manuel.Serrano/publi/serrano-hdr00.ps.gz">
ps</a>.
</li>
<li>Manuel Serrano and Pierre Weis. "Bigloo: a portable
and optimizing compiler for strict functional
languages". <em>Static Analysis Symposium, SAS'95</em>.
September 1995. Available online: <a href=
"http://www.inria.fr/mimosa/Manuel.Serrano/publi/sw-sas95.ps.gz">
ps</a>.
</li>
<li>Jonathan A. Rees. "A Security Kernel Based on the
Lambda-Calculus". PhD. Thesis. February 1995. Available
online: <a href=
"http://www.swiss.ai.mit.edu/ftpdir/users/jar/archive/whole.ps">
ps</a>.
</li>
<li>Richard A. Kelsey and Jonathan A. Rees. "A
tractable Scheme implementation". <em>Lisp and Symbolic
Computation</em>. 7(4). 1994. Available online:
<a href="http://repository.readscheme.org/ftp/papers/vlisp-lasc/scheme48.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp-lasc/scheme48.pdf">
pdf</a>.
</li>
<li>William D. Clinger and Lars Thomas Hansen. "Lambda,
the ultimate label, or a simple optimizing compiler for
Scheme". <em>Proceedings of the 1994 ACM conference on
LISP and Functional Programming</em>. 1994. Available
online: <a href=
"http://www.acm.org/pubs/citations/proceedings/lfp/182409/p128-clinger/">
ACM Digital Library</a>.
</li>
<li>William D. Clinger, Anne Hartheimer and Eric M.
Ost. "Implementation strategies for continuations".
<em>Proceedings of the 1988 ACM conference on LISP and
functional programming</em>. July 1988. Available
online: <a href=
"http://www.acm.org/pubs/citations/proceedings/lfp/62678/p124-clinger/">
ACM Digital Library</a>.
</li>
<li>William D. Clinger. "Rapid Case Dispatch in
Scheme". <em>2006 Workshop on Scheme and Functional
Programming</em>. September 2006. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2006/07-clinger.pdf">
pdf</a>.
</li>
<li>Carl Bruggeman, Oscar Waddell and R. Kent Dybvig.
"Representing Control in the Presence of One-Shot
Continuations". <em>ACM SIGPLAN 1996 Conference on
Programming Language Design and Implementation</em>.
June 1996. Available online: <a href=
"http://www.cs.indiana.edu/~dyb/papers/Call-1cc-PLDI96.ps.gz">
ps</a>.
</li>
<li>Erik Hilsdale, J. Michael Ashley, R. Kent Dybvig
and Daniel P. Friedman. "Compiler Construction Using
Scheme". <em>First International Symposium, Functional
Programming Languages in Education</em>. 1995.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/jmashley/fple95.pdf">
pdf</a>.
</li>
<li>J. Michael Ashley and R. Kent Dybvig. "An Efficient
Implementation of Multiple Return Values in Scheme".
<em>1994 ACM Conference on LISP and Functional
Programming</em>. June 1994. Available online:
<a href="http://repository.readscheme.org/ftp/papers/jmashley/lfp94.pdf">
pdf</a>.
</li>
<li>Robert Hieb, R. Kent Dybvig and Carl Bruggeman.
"Representing Control in the Presence of First-Class
Continuations". <em>ACM SIGPLAN 1990 Conference on
Programming Language Design and Implementation</em>.
June 1990. Available online: <a href=
"http://www.cs.indiana.edu/~dyb/papers/stack.ps">ps</a>.
</li>
<li>Cormac Flanagan, Amr Sabry, Bruce F. Duba and
Matthias Felleisen. "The Essence of Compiling with
Continuations". <em>Proceedings of PLDI 93</em>. 1993.
Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/pldi93-fsdf.ps.gz">
ps</a>.
</li>
<li>Amr Sabry. "The Formal Relationship between Direct
and Continuation-passing Style Optimizing Compilers: A
Synthesis of Two Paradigms". PhD. Thesis. Rice
University. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/thesis-sabry.ps.gz">
ps</a>.
</li>
<li>Christian Queinnec. "Continuation conscious
compilation". <em>Lisp Pointers</em>. 6(1). January
1993. Available online: <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/ccc.ps.gz">
ps</a> <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/ccc.pdf">
pdf</a>.
</li>
<li>Christian Queinnec. "Continuation sensitive
compilation". Laboratoire d'Informatique de l'École
Polytechnique. Research Report LIX RR 92/14. November
1992. Available online: <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/csc.ps.gz">
ps</a> <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/PDF/csc.pdf">
pdf</a>.
</li>
<li>Peter Thiemann. "Higher-Order Code Splicing". <em>
European Symposium on Programming, ESOP '99</em>.
volume 1576 of Lecture Notes in Computer Science.
March 1999. Available online: <a href=
"http://www.informatik.uni-freiburg.de/~thiemann/papers/esop99.ps.gz">
ps</a>.
</li>
<li>Guy Lewis Steele, Jr.. "Debunking the "Expensive
Procedure Call" Myth, or Procedure Call Implementations
Considered Harmful, or LAMBDA, the Ultimate GOTO". <em>
ACM Conference Proceedings</em>. 1977. Available
online: <a href=
"http://portal.acm.org/citation.cfm?id=810196&amp;coll=portal&amp;dl=ACM">
ACM Digital Library</a>.
</li>
<li>Guillermo J. Rozas. "Liar, an Algol-like Compiler
for Scheme". Massachusetts Institute of Technology. S.
B. Thesis. January 1984.
</li>
<li>Richard Schooler and James W. Stamos. "Proposal For
a Small Scheme Implementation". Massachusetts Institute
of Technology. MIT LCS Memo TM-267. October 1984.
</li>
<li>Mitchell Wand. "From Interpreter to Compiler: A
Representational Derivation". <em>Programs as Data
Objects</em>. Lecture Notes in Computer Science. 1986.
</li>
<li>Mitchell Wand and Daniel P. Friedman. "Compiling
Lambda Expressions Using Continuations and
Factorizations". <em>Journal of Computer
Languages</em>. 3. 1978.
</li>
<li>Guy Lewis Steele, Jr.. "Compiler Optimization Based
on Viewing LAMBDA as RENAME + GOTO". <em>AI: An MIT
Perspective</em>. 1980.
</li>
<li>Guy Lewis Steele, Jr. and Gerald Jay Sussman. "The
Dream of a Lifetime: a Lazy Variable Extent Mechanism".
<em>Conference Record of the 1980 Lisp Conference</em>.
1980. Available online: <a href=
"http://portal.acm.org/citation.cfm?id=802802&amp;coll=portal&amp;dl=ACM">
ACM Digital Library</a>.
</li>
<li>Guy Lewis Steele, Jr. and Gerald Jay Sussman. "The
Dream of a Lifetime: a Lazy Variable Extent Mechanism".
1979. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-527.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-527.pdf">
pdf</a>.
</li>
<li>Drew McDermott. "An Efficient Environment
Allocation Scheme in an Interpreter for a
Lexically-Scoped Lisp". <em>Conference Record of the
1980 Lisp Conference</em>. 1980. Available online:
<a href=
"http://portal.acm.org/citation.cfm?id=802801&amp;coll=portal&amp;dl=ACM">
ACM Digital Library</a>.
</li>
<li>Steven R. Vegdahl and Uwe F. Pleban. "The Runtime
Environment for Screme, a Scheme Implementation on the
88000". <em>Proceedings of the Third International
Conference on Architectural Support for Programming
Languages and Operating Systems</em>. April 1989.
Available online: <a href=
"http://portal.acm.org/citation.cfm?id=68199&amp;coll=portal&amp;dl=ACM">
ACM Digital Library</a>.
</li>
<li>Barak A. Pearlmutter and Kevin J. Lang. "The
Implementation of Oaklisp". <em>Topics in Advanced
Language Implementation</em>. 1991.
</li>
<li>Uwe F. Pleban. "Compilation Issues in the Screme
Implementation for the 88000". <em>Topics in Advanced
Language Implementation</em>. 1991.
</li>
<li>Dan Teodosiu. "HARE: An Optimizing Portable
Compiler for Scheme". <em>ACM Sigplan Notices</em>. 26.
1. Jan 1991. Available online: <a href=
"http://www-flash.stanford.edu/~dant/papers/hare.ps.Z">
ps</a> <a href=
"http://citeseer.nj.nec.com/rd/2643588%2C30693%2C1%2C0.25%2CDownload/http%3A%252F%252Fciteseer.nj.nec.com%252Fcache%252Fpapers%252Fcs%252F5642%252Fhttp%253AzSzzSzwww-flash.stanford.eduzSz%257EdantzSzpaperszSzhare.pdf/hare-an-optimizing-portable.pdf">
pdf</a>.
</li>
<li>Nitsan Séniak. "Compilation de Scheme par
spécialisation explicite". <em>BIGRE Bulletin</em>. 65.
July 1989.
</li>
<li>Chris Hanson. "Efficient Stack Allocation for
Tail-Recursive Languages". <em>Proceedings of the 1990
ACM Conference on Lisp and Functional Programming</em>.
June 1990. Available online: <a href=
"http://portal.acm.org/citation.cfm?id=91603&amp;coll=Portal">
ACM Digital Library</a>.
</li>
<li>Dan Teodosiu. "HARE: A Compiler for Scheme".
Masters Thesis. Master's Thesis. June 1990.
</li>
<li>Michael Sperber and Martin Gasbichler. "Final shift
for call/cc: Direct implementation of shift and reset".
<em>International Conference on Functional Programming
(ICFP'2002)</em>. October 2002. Available online:
<a href=
"http://www-pu.informatik.uni-tuebingen.de/users/gasbichl/publications/icfp02.ps">
ps</a>.
</li>
<li>Martin Gasbichler, Michael Sperber. "A Direct
Implementation of Shift/Reset". <em>IFL 2001</em>.
2001.
</li>
<li>Abdulaziz Ghuloum and R. Kent Dybvig. "Fixing
Letrec (reloaded)". <em>2009 Workshop on Scheme and
Functional Programming</em>. August 2009. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2009/06-ghuloum.pdf">
pdf</a>.
</li>
<li>Abdulaziz Ghuloum. "An Incremental Approach to
Compiler Construction". <em>2006 Workshop on Scheme and
Functional Programming</em>. September 2006. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2006/11-ghuloum.pdf">
pdf</a>.
</li>
<li>Dipanwita Sarkar, Oscar Waddell and R. Kent Dybvig.
"A Nanopass Infrastructure for Compiler Education".
<em>International Conference on Functional Programming
2004 (ICFP2004)</em>. September 2004.
</li>
<li>Greg Pettyjohn, John Clements, Joe Marshall,
Shriram Krishnamurthi and Matthias Felleisen.
"Continuations from Generalized Stack Inspection". <em>
International Conference on Functional Programming,
ICFP 2005</em>. September 2005. Available online:
<a href=
"http://www.cs.brown.edu/~sk/Publications/Papers/Published/pcmkf-cont-from-gen-stack-insp/">
downloadable paper</a>.
</li>
<li>Matthew Flatt and Eli Barzilay. "Keyword and
Optional Arguments in PLT Scheme". <em>2009 Workshop on
Scheme and Functional Programming</em>. August 2009.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2009/10-flatt.pdf">
pdf</a>.
</li>
<li>Abdulaziz Ghuloum and R. Kent Dybvig.
"Generation-Friendly Eq Hash Tables". <em>2007 Workshop
on Scheme and Functional Programming</em>. September
2007. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2007/03-ghuloum.pdf">
pdf</a>.
</li>
</ul><a name="scheme-in-java" id="scheme-in-java"></a>
<h3>
Implementing Scheme in Java, .NET, and JavaScript
</h3>
<ul>
<li>Remzi Emre Başar, Caner Derici and Çağdaş Şenol.
"World With Web: A compiler from world applications to
JavaScript". <em>2009 Workshop on Scheme and Functional
Programming</em>. August 2009. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2009/14-basar.pdf">
pdf</a>.
</li>
<li>Akihito Nagata, Eijiro Sumii and Akinori Yonezawa.
"A Scheme-to-Java Translator with Soft Typing". May
2002. Available online: <a href=
"http://www.yl.is.s.u-tokyo.ac.jp/~sumii/pub/scm2java.ps.gz">
ps</a>.
</li>
<li>Bernard Serpette and Manuel Serrano. "Compiling
Scheme to JVM bytecode: a performance study".
<em>International Conference on Functional Programming
(ICFP'2002)</em>. October 2002. Available online:
<a href=
"http://www.inria.fr/mimosa/Manuel.Serrano/publi/ss-icfp02.ps.gz">
ps</a>.
</li>
<li>Scott G. Miller. "SISC: A Complete Scheme
Interpreter in Java". January 2002. Available online:
<a href="http://sisc.sourceforge.net/sisc.ps.gz">ps</a>
<a href="http://sisc.sourceforge.net/sisc.pdf">pdf</a>.
</li>
<li>Kenneth R. Anderson, Timothy J. Hickey and Peter
Norvig. "SILK: a playful blend of Scheme and Java".
<em>Scheme and Functional Programming 2000</em>.
September 2000. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/anderson.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/anderson.pdf">
pdf</a>.
</li>
<li>Timothy J. Hickey. "Incorporating Scheme-based web
programming in computer-literacy courses". <em>Workshop
on Scheme and Functional Programming (2002)</em>.
October 2002. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2002/hickey.pdf">
pdf</a>.
</li>
<li>Timothy J. Hickey. "Incorporating Scheme-based Web
Programmming into Computer Literacy Courses". Brandeis
University. CS-02-224. April 2002. Available online:
<a href=
"http://www.cs.brandeis.edu/~tim/Papers/icfp2002.ps.gz">
ps</a> <a href=
"http://www.cs.brandeis.edu/~tim/Papers/icfp2002.pdf">
pdf</a>.
</li>
<li>Timothy J. Hickey. "Jscheme Web Programming for
CS0". Brandeis University. CS-02-223. January 2002.
Available online: <a href=
"http://www.cs.brandeis.edu/~tim/Papers/sigcse-jscheme.ps">
ps</a>.
</li>
<li>Kenneth R. Anderson and Timothy J. Hickey.
"Reflecting Java into Scheme". <em>Proceedings of
Reflection 99</em>. Lecture Notes in Computer Science,
v. 1616. 1999.
</li>
<li>Timothy J. Hickey, Peter Norvig and Kenneth R.
Anderson. "LISP - a Language for Internet Scripting and
Programming". <em>LUGM'98: Proceedings of Lisp in the
Mainstream</em>. November 1998. Available online:
<a href="http://www.norvig.com/lugm.pdf">pdf</a>.
</li>
<li>Per Bothner. "Kawa - Compiling Dynamic Languages to
the Java VM". <em>1998 Usenix</em>. June 1998.
Available online: <a href=
"http://sources.redhat.com/kawa/papers/Freenix98.ps.gz">
ps</a>.
</li>
<li>Per Bothner. "Kawa: Compiling Scheme to Java". <em>
Lisp Users Conference: Lisp in the Mainstream (40th
Anniversary of Lisp)</em>. November 1998. Available
online: <a href=
"http://sources.redhat.com/kawa/papers/KawaLisp98.ps.gz">
ps</a>.
</li>
<li>Mark DePristo. "SINTL: A Strongly-Typed Generic
Intermediate Language for Scheme". Northwestern
University. May 2000. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/depristo00sintl.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/depristo00sintl.pdf">
pdf</a>.
</li>
<li>Brian D. Carlstrom. "Embedding Scheme in Java".
PhD. Thesis. Massachusetts Institute of Technlogy.
February 2001. Available online: <a href=
"http://www.swiss.ai.mit.edu/~bdc/thesis/thesis.pdf">pdf</a>.
</li>
<li>Yannis Bres and Bernard Serpette and Manuel
Serrano. "Compiling Scheme programs to .NET Common
Intermediate Language". <em>2nd International Workshop
on .NET Technologies</em>. May 2004. Available online:
<a href=
"http://www.inria.fr/mimosa/Manuel.Serrano/publi/bss-dotnet04.pdf">
pdf</a>.
</li>
<li>Yannis Bres and Bernard Serpette and Manuel
Serrano. "Bigloo.NET: compiling Scheme to .NET CLR".
<em>Journal of Object Technology</em>. 3(9). October
2004. Available online: <a href=
"http://www.inria.fr/mimosa/Manuel.Serrano/publi/jot04/jot04.html">
html</a>.
</li>
<li>Florian Loitsch. "Javascript to Scheme
Compilation". <em>2005 Workshop on Scheme and
Functional Programming</em>. September 2005. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2005/loitsch.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2005/loitsch.pdf">
pdf</a>.
</li>
</ul><a name="scheme-to-c" id="scheme-to-c"></a>
<h3>
Compiling Scheme to C
</h3>
<ul>
<li>Joel F. Bartlett. "SCHEME-&gt;C: A Portable
Scheme-to-C Compiler". 1989. Available online:
<a href="ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/s2c.ps.gz">
ps</a>.
</li>
<li>R. Kent Dybvig. "C-Scheme". Masters Thesis. Indiana
University Computer Science Department. Technical
Report 149. 1983.
</li>
<li>Manuel Serrano. "Vers une compilation portable et
performante des langages fonctionnels". PhD. Thesis.
l'Université Paris VI. December 1994. Available online:
<a href=
"http://www.inria.fr/mimosa/Manuel.Serrano/publi/serrano-these94.ps.gz">
ps</a>.
</li>
<li>Tanel Tammet. "Lambda-lifting as an optimization
for compiling Scheme to C". Chalmers University of
Technology. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/tammet-hobbit.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/tammet-hobbit.pdf">
pdf</a>.
</li>
<li>Brent W. Benson, Jr.. "libscheme: Scheme as a C
Library". <em>Proceedings of the 1994 USENIX Symposium
on Very High Level Languages</em>. 1994. Available
online: <a href=
"ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/libscheme-vhll.ps.gz">
ps</a>.
</li>
<li>John R. Rose and Hans Muller. "Integrating the
Scheme and C languages". <em>Proceedings of the
conference on Lisp and functional programming</em>.
June 1992. Available online: <a href=
"http://www.acm.org/pubs/citations/proceedings/lfp/141471/p247-rose/">
ACM Digital Library</a>.
</li>
<li>Henry G. Baker. "CONS Should Not CONS Its
Arguments, Part II: Cheney on the M.T.A.". May 1994.
Available online: <a href=
"http://home.pipeline.com/~hbaker1/CheneyMTA.ps.gz">ps</a>
<a href=
"http://home.pipeline.com/~hbaker1/CheneyMTA.html">html</a>.
</li>
<li>Marc Feeley, James S. Miller, Guillermo J. Rozas,
Jason A. Wilson. "Compiling Higher-Order Languages into
Fully Tail-Recursive Portable C". département
d'informatique et r.o., Université de Montréal. Rapport
technique 1078. Aout 1997. Available online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/tr1078.ps.gz">
ps</a>.
</li>
<li>Marc Feeley. "A portable implementation of
first-class continuations for unrestricted
interoperability with C in a multithreaded Scheme".
<em>Scheme and Functional Programming 2000</em>.
September 2000. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/feeley.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/feeley.pdf">
pdf</a>.
</li>
</ul><a name="vlisp" id="vlisp"></a>
<h3>
VLISP: Formally Verified Scheme Implementation
</h3>
<ul>
<li>Joshua D. Guttman, John D. Ramsdell and Mitchell
Wand. "VLISP: A Verified Implementation of Scheme".
<em>Lisp and Symbolic Computation</em>. Vol. 8 No. 1/2.
1995. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp-lasc/results.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp-lasc/results.pdf">
pdf</a>.
</li>
<li>Joshua D. Guttman, John D. Ramsdell and Vipin
Swarup. "The VLISP Verified Scheme System". <em>Lisp
and Symbolic Computation</em>. Vol. 8 No. 1/2. 1995.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp-lasc/vlisp.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp-lasc/vlisp.pdf">
pdf</a>.
</li>
<li>Dino P. Oliva, John D. Ramsdell and Mitchell Wand.
"The VLISP Verified PreScheme Compiler". <em>Lisp and
Symbolic Computation</em>. Vol. 8 No. 1/2. 1995.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp-lasc/prescheme.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp-lasc/prescheme.pdf">
pdf</a>.
</li>
<li>Joshua D. Guttman, Leonard G. Monk, John D.
Ramsdell, William M. Farmer, Vipin Swarup. "A Guide to
VLISP, A Verifed Programming Language Implementation".
MITRE Corporation. September 1992. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/vlisp/guide.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/guide.pdf">
pdf</a>.
</li>
<li>John D. Ramsdell, William M. Farmer, Joshua D.
Guttman, Leonard G. Monk, Vipin Swarup. "The VLISP
PreScheme Front End". MITRE Corporation. September
1992. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/prescheme.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/prescheme.pdf">
pdf</a>.
</li>
<li>John D. Ramsdell. "The Revised VLISP PreScheme
Front End". MITRE Corporation. August 1993. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/preschemerevised.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/preschemerevised.pdf">
pdf</a>.
</li>
<li>Dino P. Oliva and Mitchell Wand. "A Verifed
Compiler for Pure PreScheme". MITRE Corporation.
September 1991. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/pureprescheme.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/pureprescheme.pdf">
pdf</a>.
</li>
<li>William M. Farmer and John D. Ramsdell. "A Verifed
Compiler for Multithreaded PreScheme". MITRE
Corporation. January 1996. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/mtps.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/mtps.pdf">
pdf</a>.
</li>
<li>Joshua D. Guttman, John D. Ramsdell, Leonard G.
Monk, William M. Farmer, Vipin Swarup. "The VLISP
Byte-Code Compiler". MITRE Corporation. September 1992.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/compiler.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/compiler.pdf">
pdf</a>.
</li>
<li>Dino P. Oliva and Mitchell Wand. "A Verifed
Run-Time Structure for Pure PreScheme". MITRE
Corporation. September 1992. Available online:
<a href="http://repository.readscheme.org/ftp/papers/vlisp/runtime.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/runtime.pdf">
pdf</a>.
</li>
<li>Vipin Swarup, William M. Farmer, Joshua D. Guttman,
Leonard G. Monk, John D. Ramsdell. "VLISP Byte Code
Interpreter". MITRE Corporation. September 1992.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/vm.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/vm.pdf">
pdf</a>.
</li>
<li>William M. Farmer, Joshua D. Guttman, Leonard G.
Monk, John D. Ramsdell, Vipin Swarup. "Faithfulness of
the VLISP Operational Semantics". MITRE Corporation.
September 1992. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/faithfulness.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/faithfulness.pdf">
pdf</a>.
</li>
<li>Joshua D. Guttman, Leonard G. Monk, John D.
Ramsdell, William M. Farmer, Vipin Swarup. "The VLISP
Flattener". MITRE Corporation. September 1992.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/flattener.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/flattener.pdf">
pdf</a>.
</li>
<li>Vipin Swarup, William M. Farmer, Joshua D. Guttman,
Leonard G. Monk and John D. Ramsdell. "The VLISP Image
Builder". MITRE Corporation. September 1992. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/image_builder.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/image_builder.pdf">
pdf</a>.
</li>
<li>William M. Farmer, Joshua D. Guttman, Leonard G.
Monk, John D. Ramsdell, Vipin Swarup. "The VLISP
Linker". MITRE Corporation. September 1992. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/linker.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/vlisp/linker.pdf">
pdf</a>.
</li>
</ul><a name="program-analysis" id=
"program-analysis"></a>
<h3>
Program Analysis, Inlining and other Optimizations
</h3>
<ul>
<li>Andrew Keep and R. Kent Dybvig. "Enabling
cross-library optimization and compile-time error
checking in the presence of procedural macros".
<em>2010 Workshop on Scheme and Functional
Programming</em>. August 2010. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2010/07-keep.pdf">
pdf</a>.
</li>
<li>Christopher Earl, Matthew Might and David Van Horn.
"Pushdown Control-Flow Analysis of Higher-Order
Programs". <em>2010 Workshop on Scheme and Functional
Programming</em>. August 2010. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2010/03-earl.pdf">
pdf</a>.
</li>
<li>Matthew Might and Tarun Prabhu. "Interprocedural
Dependence Analysis of Higher-Order Programs via Stack
Reachability". <em>2009 Workshop on Scheme and
Functional Programming</em>. August 2009. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2009/08-might.pdf">
pdf</a>.
</li>
<li>Philippe Meunier, Robert Bruce Findler and Matthias
Felleisen. "Modular Set-Based Analysis from Contracts".
<em>Principles of Programming Languages, POPL
2006</em>. January 2006. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/popl06-mff.pdf">pdf</a>.
</li>
<li>Ulrik Pagh Schultz. "Explicit and Implicit Aspects
of Scope and Block Structure". Masters Thesis.
University of Aarhus. June 1997. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/schultz-speciale.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/schultz-speciale.pdf">
pdf</a>.
</li>
<li>Olivier Danvy and Ulrik Pagh Schultz.
"Lambda-dropping: transforming recursive equations into
programs with block structure". <em>Partial Evaluation
and Semantics-Based Program Manipulation
(PEPM'97)</em>. June 1997. Available online: <a href=
"http://doi.acm.org/10.1145/258993.259007">ACM Digital
Library</a>.
</li>
<li>Olivier Danvy and Ulrik Pagh Schultz.
"Lambda-Dropping: Transforming Recursive Equations into
Programs with Block Structure ". University of Aarhus.
RS-97-6. March 1997. Available online: <a href=
"http://www.brics.dk/RS/97/6/BRICS-RS-97-6.ps.gz">ps</a>
<a href=
"http://www.brics.dk/RS/97/6/BRICS-RS-97-6.pdf">pdf</a>.
</li>
<li>Olivier Danvy and Ulrik Pagh Schultz.
"Lambda-Dropping: Transforming Recursive Equations into
Programs with Block Structure". <em>Theoretical
Computer Science</em>. Volume 248/1-2. November 2000.
Available online: <a href=
"http://www.daimi.au.dk/~ups/papers/tcs00.ps.gz">ps</a>
<a href="http://www.daimi.au.dk/~ups/papers/tcs00.pdf">
pdf</a>.
</li>
<li>Olivier Danvy and Ulrik Pagh Schultz.
"Lambda-Dropping: Transforming Recursive Equations into
Programs with Block Structure ". University of Aarhus.
RS-99-27. September 1999. Available online: <a href=
"http://www.brics.dk/RS/99/27/BRICS-RS-99-27.ps.gz">ps</a>
<a href=
"http://www.brics.dk/RS/99/27/BRICS-RS-99-27.pdf">pdf</a>.
</li>
<li>Oscar Waddell, Dipanwita Sarkar and R. Kent Dybvig.
"Robust and effective transformation of letrec".
<em>Workshop on Scheme and Functional Programming
(2002)</em>. October 2002. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2002/waddell.pdf">
pdf</a>.
</li>
<li>Mitchell Wand. "Continuation-Based Program
Transformation Strategies". <em>Journal of the
ACM</em>. 27. 1. January 1980. Available online:
<a href=
"http://portal.acm.org/citation.cfm?id=322183&amp;coll=portal&amp;dl=ACM">
ACM Digital Library</a>.
</li>
<li>Williams Ludwell Harrison III. "The Interprocedural
Analysis and Automatic Parallellization of Scheme
Programs". <em>Lisp and Symbolic Computation: An
International Journal</em>. 2. 3/4. October 1989.
Available online: .
</li>
<li>J. Michael Ashley and R. Kent Dybvig. "A Practical
and Flexible Flow Analysis for Higher-Order Languages".
<em>ACM Transactions on Programming Languages and
Systems</em>. Vol. 20, Num. 4. July 1998. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/jmashley/toplas97.pdf">
pdf</a>.
</li>
<li>Jeffrey Mark Siskind. "Flow-Directed Lightweight
Closure Conversion". NEC Research Institute, Inc..
Technical Report 99-190R. December 1999. Available
online: <a href=
"ftp://ftp.ecn.purdue.edu/qobi/fdlcc.pdf">pdf</a>.
</li>
<li>Oscar Waddell and R. Kent Dybvig. "Fast and
Effective Procedure Inlining". <em>Proceedings of the
Fourth International Symposium on Static Analysis (SAS
'97)</em>. 1302. September 1997. Available online:
<a href=
"http://www.cs.indiana.edu/~dyb/papers/sas-97.ps.gz">ps</a>.
</li>
<li>Manuel Serrano. "Inline expansion: when and how?".
<em>Programming Language Implementation and Logic
Programming, PLILP'97</em>. September 1997. Available
online: <a href=
"http://www.inria.fr/mimosa/Manuel.Serrano/publi/serrano-plilp97.ps.gz">
ps</a>.
</li>
<li>Manuel Serrano. "A Fresh Look to Inlining
Decision". <em>International Computer Symposium,
ICS'95</em>. November 1995. Available online:
<a href="http://www.inria.fr/mimosa/Manuel.Serrano/publi/serrano-ics95.ps.gz">
ps</a>.
</li>
<li>Manuel Serrano. "Control flow analysis: a
functional languages compilation paradigm".
<em>Symposium on Applied Computing, SAC'95</em>.
February 1995. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/serrano95control.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/serrano95control.pdf">
pdf</a>.
</li>
<li>J. Michael Ashley and Charles Consel. "Fixpoint
Computation for Polyvariant Static Analyses of
Higher-Order Applicative Programs". <em>ACM
Transactions on Programming Languages and Systems</em>.
16(5). September 1994. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/jmashley/toplas94.pdf">
pdf</a>.
</li>
<li>J. Michael Ashley. "A Practical and Flexible Flow
Analysis for Higher-Order Languages". PhD. Thesis.
Indiana University. 1996. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/jmashley/thesis.pdf">
pdf</a>.
</li>
<li>J. Michael Ashley. "A Practical and Flexible Flow
Analysis for Higher-Order Languages". <em>Conference
Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Languages</em>.
1996. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/jmashley/popl96.pdf">
pdf</a>.
</li>
<li>J. Michael Ashley. "The Effectiveness of Flow
Analysis for Inlining". <em>Proceedings of the 1997 ACM
International Conference on Functional
Programming</em>. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/jmashley/icfp97.pdf">
pdf</a>.
</li>
<li>Dominique Boucher, Marc Feeley. "Abstract
Compilation: a New Implementation Paradigm for Static
Analysis". <em>Compiler Construction Conference</em>.
April 1996. Available online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/cc96.ps.gz">
ps</a>.
</li>
<li>Dominique Boucher, Marc Feeley. "Un système pour
l'optimisation globale de programmes d'ordre supérieur
par compilation abstraite séparée". département
d'informatique et r.o., Université de Montréal. Rapport
technique 992. Septembre 1995. Available online:
<a href=
"http://www.iro.umontreal.ca/~feeley/papers/tr992.ps.gz">
ps</a>.
</li>
<li>Cormac Flanagan and Matthias Felleisen.
"Componential Set-Based Analysis". <em>Proceedings of
PLDI 97</em>. 1996. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/pldi97-ff.ps.gz">ps</a>.
</li>
<li>Cormac Flanagan and Matthias Felleisen.
"Componential Set-Based Analysis". <em>Transactions on
Programming Languages and Systems</em>. 1999. Available
online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/toplas99-ff.ps.gz">
ps</a>.
</li>
<li>Cormac Flanagan. "Effective Static Debugging via
Componential Set-Based Analysis". PhD. Thesis. Rice
University. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/thesis-flanagan.ps.gz">
ps</a>.
</li>
<li>Cormac Flanagan and Matthias Felleisen. "Modular
and Polymorphic Set-Based Analysis: Theory and
Practice". Rice University. TR 96-266. 1996. Available
online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/tr96-266.ps.gz">ps</a>.
</li>
<li>Cormac Flanagan and Matthias Felleisen. "Set-Based
Analysis for Full Scheme and Its Use in Soft-Typing".
Rice University. TR 95-254. 1995. Available online:
<a href=
"http://www.ccs.neu.edu/scheme/pubs/tr95-254.ps.gz">ps</a>.
</li>
<li>Olin Shivers. "Control-flow analysis in Scheme".
<em>Proceedings of the SIGPLAN '88 Conference on
Programming Language Design and Implementation</em>.
June 1988. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/shivers-pldi88.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/shivers-pldi88.pdf">
pdf</a>.
</li>
<li>Olin Shivers. "Super-beta: Copy, constant, and
lambda propagation in Scheme". CMU School of Computer
Science. May 1990. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/shivers-superbeta.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/shivers-superbeta.pdf">
pdf</a>.
</li>
<li>Olin Shivers. "Useless-variable elimination". <em>
Proceedings of the Workshop on Static Analysis of
Equational, Functional and Logic Programs</em>. April
1990. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/shivers-useless.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/shivers-useless.pdf">
pdf</a>.
</li>
<li>Olin Shivers. "CPS data-flow analysis example". CMU
School of Computer Science. May 1990. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/shivers-flowex.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/shivers-flowex.pdf">
pdf</a>.
</li>
<li>Olin Shivers. "Control-Flow Analysis of
Higher-Order Languages". PhD. Thesis. Carnegie Mellon
University. May 1991. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/shivers-diss.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/shivers-diss.pdf">
pdf</a>.
</li>
<li>Olin Shivers. "The semantics of Scheme control-flow
analysis". <em>Proceedings of the First ACM SIGPLAN and
IFIP Symposium on Partial Evaluation and
Semantics-Based Program Manipulation</em>. June 1991.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/shivers-pepm91.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/shivers-pepm91.pdf">
pdf</a>.
</li>
<li>Amr Sabry and Matthias Felleisen. "Is
Continuation-Passing Useful for Data Flow Analysis?".
<em>Proceedings of PLDI 94</em>. 1994. Available
online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/pldi94-sf.ps.gz">ps</a>.
</li>
<li>Andrew E. Ayers. "Abstract Analysis and
Optimization of Scheme". PhD. Thesis. MIT. 1993.
</li>
<li>Bjarne Steensgaard and Morten Marquard. "A
Polyvariant Closure Analysis with Dynamic Widening".
May 1994. Available online: <a href=
"ftp://ftp.research.microsoft.com/pub/analysts/closure.ps.Z">
ps</a>.
</li>
<li>Dominique Boucher. "Analyse et optimisation
globales de modules compilés séparément". PhD. Thesis.
Université de Montréal. December 1999. Available
online: <a href=
"http://www.iro.umontreal.ca/~boucherd/papers/phd.tgz">
ps</a>.
</li>
<li>Suresh Jagannathan and Andrew K. Wright.
"Polymorphic Splitting: An Effective Polyvariant Flow
Analysis". <em>ACM Transactions on Programming
Languages and Systems</em>. March 1998. Available
online: <a href=
"http://www.cs.purdue.edu/homes/suresh/papers/toplas98.ps.gz">
ps</a>.
</li>
<li>Suresh Jagannathan and Andrew K. Wright.
"Flow-Directed Inlining". <em>ACM Symposium on
Programming Language Design and Implementation
(PLDI96)</em>. May 1996. Available online: <a href=
"http://www.cs.purdue.edu/homes/suresh/papers/pldi96.ps.gz">
ps</a>.
</li>
<li>Suresh Jagannathan and Andrew K. Wright. "Compiling
with Flow Analysis". <em>ACM Computing Surveys</em>.
June 1996. Available online: <a href=
"http://www.cs.purdue.edu/homes/suresh/papers/survey96.ps.gz">
ps</a>.
</li>
<li>Suresh Jagannathan and Andrew K. Wright. "Effective
Flow Analysis for Avoiding Runtime Checks". <em>2nd
International Static Analysis Symposium</em>. LNCS 983.
September 1995. Available online: <a href=
"http://www.cs.purdue.edu/homes/suresh/papers/sas95.ps.gz">
ps</a>.
</li>
<li>Suresh Jagannathan and Andrew K. Wright.
"Flow-Directed Inlining". <em>ACM Symposium on
Programming Language Design and Implementation
(PLDI96)</em>. May 1996. Available online: <a href=
"http://www.cs.purdue.edu/homes/suresh/papers/pldi96.ps.gz">
ps</a>.
</li>
<li>Peter A. Bigot and Saumya Debray. "Return Value
Placement and Tail Call Optimization in High Level
Languages". <em>Journal of Logic Programming</em>.
January 1999. Available online: <a href=
"http://www.cs.arizona.edu/people/debray/papers/retval_placement.ps">
ps</a>.
</li>
<li>Saumya Debray, Robert Muth and Scott Watterson.
"Link-time Improvement of Scheme Programs".
<em>International Conference on Compiler Construction
(CC'99)</em>. March 1999. Available online: <a href=
"http://www.cs.arizona.edu/people/debray/papers/scheme.ps">
ps</a>.
</li>
</ul><a name="types" id="types"></a>
<h3>
Type Systems and Soft Typing
</h3>
<ul>
<li>Ryan Culpepper, Sam Tobin-Hochstadt and Matthew
Flatt. "Advanced Macrology and the Implementation of
Typed Scheme". <em>2007 Workshop on Scheme and
Functional Programming</em>. September 2007. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2007/01-culpepper.pdf">
pdf</a>.
</li>
<li>Danny Dubé and Marc Feeley. "A Demand-Driven
Adaptive Type Analysis". <em>International Conference
on Functional Programming (ICFP'2002)</em>. October
2002. Available online: <a href=
"http://www.iro.umontreal.ca/~dube/icfp02.ps.gz">ps</a>.
</li>
<li>Danny Dubé. "Demand-driven type analysis for
dynamically-typed functional languages". PhD. Thesis.
Université de Montréal. August 2002. Available online:
<a href=
"http://www.iro.umontreal.ca/~dube/these.ps.gz">ps</a>.
</li>
<li>Andrew K. Wright and Robert Cartwright. "A
Practical Soft Type System for Scheme".
<em>Transactions on Programming Languages and
Systems</em>. 1997. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/toplas97-wc.ps.gz">
ps</a>.
</li>
<li>Cormac Flanagan and Matthias Felleisen. "A New Way
of Debugging LISP Programs". <em>Proceedings of LUGM
98</em>. 1998. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/lugm98-ff.ps.gz">ps</a>.
</li>
<li>Andrew K. Wright. "Practical Soft Typing". PhD.
Thesis. Rice University. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/thesis-wright.ps.gz">
ps</a>.
</li>
<li>Mike Fagan. "Soft Typing: An Approach to Type
Checking for Dynamically Typed Languages". PhD. Thesis.
Rice University. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/thesis-fagan.ps.gz">
ps</a>.
</li>
<li>Robert Cartwright and Matthias Felleisen. "Program
Verification through Soft Typing". <em>Computing
Surveys</em>. 1996. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/cs96-cf.ps.gz">ps</a>.
</li>
<li>Cormac Flanagan, Matthew Flatt, Shriram
Krishnamurthi, Stephanie Weirich and Matthias
Felleisen. "Catching Bugs in the Web of Program
Invariants". <em>Proceedings of PLDI 96</em>. 1996.
Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/pldi96-ffkwf.ps.gz">
ps</a>.
</li>
<li>Andrew K. Wright. "Simple Imperative Polymorphism".
<em>LISP and Symbolic Computation</em>. 1995. Available
online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/lasc95-w.ps.gz">ps</a>.
</li>
<li>Andrew K. Wright and Matthias Felleisen. "A
Syntactic Approach to Type Soundness". <em>Information
and Computation</em>. 1994. Available online:
<a href="http://www.ccs.neu.edu/scheme/pubs/ic94-wf.ps.gz">
ps</a>.
</li>
<li>Andrew K. Wright and Robert Cartwright. "A
Practical Soft Type System for Scheme". <em>Proceedings
of LFP 94</em>. 1994. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/lfp94-wc.ps.gz">ps</a>.
</li>
<li>Andrew K. Wright and Robert Cartwright. "A
Practical Soft Type System for Scheme". Rice
University. TR 93-218. 1993. Available online:
<a href="http://www.ccs.neu.edu/scheme/pubs/tr93-218.ps.gz">
ps</a>.
</li>
<li>Robert Cartwright and Mike Fagan. "Soft Typing".
<em>Proceedings of PLDI 91</em>. 1991. Available
online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/pldi91-cf.ps.gz">ps</a>.
</li>
<li>Olin Shivers. "Data-flow analysis and type recovery
in Scheme". CMU School of Computer Science. Technical
Report CMU-CS-90-115. March 1990. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/shivers-trec.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/shivers-trec.pdf">
pdf</a>.
</li>
<li>Danny Dubé, Marc Feeley. "Demand-Driven Type
Analysis: an Introduction". <em>2nd Workshop on Scheme
and Functional Programming</em>. September 2001.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/dube.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/dube.pdf">
pdf</a>.
</li>
<li>Philippe Meunier, Robert Bruce Findler, Paul A.
Steckler, Mitchell Wand. "Selectors Make Set-Based
Analysis Too Hard". <em>2nd Workshop on Scheme and
Functional Programming</em>. September 2001. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/steckler.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/steckler.pdf">
pdf</a>.
</li>
<li>Manfred Widera. "An Algorithm for Checking the
Disjointness of Types". <em>2nd Workshop on Scheme and
Functional Programming</em>. September 2001. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/widera.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/widera.pdf">
pdf</a>.
</li>
<li>Manfred Widera. "A Sketch of Complete Type
Inference for Functional Programming".
<em>International Workshop on Functional and
(Constraint) Logic Programming (WLFP 2001)</em>.
September 2001. Available online: <a href=
"http://citeseer.ist.psu.edu/rd/29997463%2C497735%2C1%2C0.25%2CDownload/http://citeseer.ist.psu.edu/compress/0/papers/cs/24467/http:zSzzSzwww.informatik.uni-kiel.dezSz~wflp2001zSzproceedingszSzpaperszSzpaper1.ps.gz/widera01sketch.ps">
ps</a> <a href=
"http://citeseer.ist.psu.edu/rd/29997463%2C497735%2C1%2C0.25%2CDownload/http://citeseer.ist.psu.edu/cache/papers/cs/24467/http:zSzzSzwww.informatik.uni-kiel.dezSz%7Ewflp2001zSzproceedingszSzpaperszSzpaper1.pdf/widera01sketch.pdf">
pdf</a>.
</li>
<li>Steven L. Jenkins and Gary T. Leavens. "Ploymorphic
Type-Checking in Scheme". <em>Journal of Computer
Languages</em>. Vol. 22. Num. 4. 1996.
</li>
<li>W. F. Wong. "Optimizing Floating Point Operations
in Scheme". <em>Journal of Computer Languages</em>.
Vol. 25. 1999.
</li>
<li>Mitchell Wand. "Finding the Source of Type Errors".
<em>Conference Record of the Thirteenth Annual
Symposium on Principles of Programming Languages</em>.
1986.
</li>
<li>Fritz Henglein. "Global Tagging Optimization by
Type Inference". <em>Proceedings of the 1992 ACM
Conference on Lisp and Functional Programming</em>.
June 1992. Available online: <a href=
"http://portal.acm.org/citation.cfm?id=141542&amp;coll=Portal">
ACM Digital Library</a>.
</li>
<li>Fritz Henglein and Jakob Rehof. "Safe polymorphic
type inference for a Dynamically Typed Language:
Translating Scheme to ML". <em>ACM Conference on
Functional Programming Languages and Computer
Architecture (FPCA'95)</em>. 1995. Available online:
<a href=
"http://citeseer.nj.nec.com/rd/2643588%2C140352%2C1%2C0.25%2CDownload/http%253A%252F%252Fciteseer.nj.nec.com/compress/0/papers/cs/7451/http%253AzSzzSzresearch.microsoft.comzSz%257ErehofzSzfpca95.ps.gz/henglein95safe.ps">
ps</a> <a href=
"http://citeseer.nj.nec.com/rd/2643588%2C140352%2C1%2C0.25%2CDownload/http%253A%252F%252Fciteseer.nj.nec.com/cache/papers/cs/7451/http%253AzSzzSzresearch.microsoft.comzSz%257ErehofzSzfpca95.pdf/henglein95safe.pdf">
pdf</a>.
</li>
</ul><a name="cogen" id="cogen"></a>
<h3>
Code Generation
</h3>
<ul>
<li>Robert G. Burger, Oscar Waddell and R. Kent Dybvig.
"Register Allocation Using Lazy Saves, Eager Restores,
and Greedy Shuffling". <em>ACM SIGPLAN 1995 Conference
on Programming Language Design and Implementation</em>.
June 1995. Available online: <a href=
"http://www.cs.indiana.edu/~dyb/papers/Reg-Alloc-PLDI95.ps.gz">
ps</a>.
</li>
<li>Marc Feeley, Guy Lapalme. "Closure Generation Based
on Viewing LAMBDA As EPSILON Plus COMPILE". <em>Journal
of Computer Languages</em>. Vol. 17, No. 4. 1992.
Available online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/complang92.ps.gz">
ps</a>.
</li>
<li>R. Kent Dybvig, Robert Hieb and Tom Butler.
"Destination-Driven Code Generation". Indiana
University Computer Science Department. Technical
Report #302. February 1990. Available online:
<a href="http://www.cs.indiana.edu/~dyb/papers/ddcg.ps">
ps</a>.
</li>
<li>Marc Feeley, Guy Lapalme. "Using Closures for Code
Generation". <em>Journal of Computer Languages</em>.
Vol. 12, No. 1. 1987. Available online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/complang87.ps.gz">
ps</a>.
</li>
<li>Mario Latendresse. "Automatic generation of compact
programs and virtual machines for Scheme". <em>Scheme
and Functional Programming 2000</em>. September 2000.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/latendresse.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/latendresse.pdf">
pdf</a>.
</li>
<li>Mario Latendresse. "Génération de machines
virtuelles pour l'exécution de programmes compressés".
PhD. Thesis. Université de Montréal. April 2000.
Available online: <a href=
"http://www.iro.umontreal.ca/~latendre/publications/these.ps">
ps</a>.
</li>
</ul><a name="gc" id="gc"></a>
<h3>
Garbage Collection and Memory Management
</h3>
<ul>
<li>William D Clinger and Felix S. Klock II. "Scalable
Garbage Collection with Guaranteed MMU". <em>2009
Workshop on Scheme and Functional Programming</em>.
August 2009. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2009/02-clinger.pdf">
pdf</a>.
</li>
<li>Adam Wick and Matthew Flatt. "Memory Accounting
without Partitions". <em>ISMM 2004</em>. 2004.
Available online: <a href=
"http://www.cs.utah.edu/plt/publications/ismm04-wf.pdf">
pdf</a>.
</li>
<li>Stephen Paul Carl. "A Framework for
Memory-Management Experimentation". <em>2004 Scheme
Workshop</em>. September 2004. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2004/carl.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2004/carl.pdf">
pdf</a>.
</li>
<li>Lars Thomas Hansen and William D. Clinger. "An
Experimental Study of Renewal-Older-First Garbage
Collection". <em>International Conference on Functional
Programming (ICFP'2002)</em>. October 2002. Available
online: <a href=
"ftp://ftp.ccs.neu.edu/pub/people/will/p131-hansen.pdf">
pdf</a>.
</li>
<li>Adam Wick, Matthew Flatt and Wilson Hsieh.
"Reachability-based memory accounting". <em>Workshop on
Scheme and Functional Programming (2002)</em>. October
2002. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2002/wick.pdf">
pdf</a>.
</li>
<li>Richard A. Kelsey. "Tail-Recursive Stack
Disciplines for an Interpreter". Available online:
<a href=
"ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/stack-gc.ps.gz">
ps</a>.
</li>
<li>Julia L. Lawall and Daniel P. Friedman. "Toward
Leakage Containment". Computer Science Department,
Indiana University. February 1992. Available online:
<a href=
"ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/iucstr346.ps.gz">
ps</a>.
</li>
<li>James S. Miller and Guillermo J. Rozas. "Garbage
Collection is Fast, But a Stack is Faster". MIT AI Lab.
AIM-1462. March 1994. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-1462.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-1462.pdf">
pdf</a>.
</li>
<li>R. Kent Dybvig, David Eby and Carl Bruggeman.
"Don't Stop the BiBOP: Flexible and Efficient Storage
Management for Dynamically-Typed Languages". Indiana
University. technical report #400. March 1994.
Available online: <a href=
"http://www.cs.indiana.edu/~dyb/papers/bibop.ps">ps</a>.
</li>
<li>R. Kent Dybvig, David Eby and Carl Bruggeman.
"Guardians in a Generation-based Collector". <em>ACM
SIGPLAN 1993 Conference on Programming Language Design
and Implementation</em>. June 1993. Available online:
<a href=
"http://www.cs.indiana.edu/~dyb/papers/guardians-pldi93.ps.gz">
ps</a>.
</li>
<li>Martin Larose, Marc Feeley. "A Compacting
Incremental Collector and its Performance in a
Production Quality Compiler". <em>Proceedings of the
1998 International Symposium on Memory Management</em>.
October 1998. Available online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/ismm98.ps.gz">
ps</a>.
</li>
<li>Manuel Serrano, Marc Feeley. "Storage Use Analysis
and its Applications". <em>ACM SIGPLAN International
Conference on Functional Programming</em>. May 1996.
Available online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/icfp96.ps.gz">
ps</a>.
</li>
<li>Danny Dubé, Marc Feeley, Manuel Serrano. "Un GC
temps réel semi-compactant". <em>Journées Francophones
des Langages Applicatifs</em>. January 1996. Available
online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/jfla96.ps.gz">
ps</a>.
</li>
<li>Manuel Serrano and Hans J. Boehm. "Understanding
Memory allocations of Scheme Programs".
<em>International Conference on Functional Programming,
ICFP'00</em>. September 2000. Available online:
<a href="http://www.inria.fr/mimosa/Manuel.Serrano/publi/sb-icfp00.ps.gz">
ps</a>.
</li>
<li>David Gudeman. "Representing Type Information in
Dynamically Typed Languages". University of Arizona. TR
93-27. October 1993. Available online: <a href=
"ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/typeinfo.ps.gz">
ps</a>.
</li>
<li>Paul R. Wilson. "Uniprocessor Garbage Collection
Techniques". Available online: <a href=
"ftp://ftp.cs.utexas.edu/pub/garbage/bigsurv.ps">ps</a>.
</li>
<li>Paul R. Wilson, Michael S. Lam and Thomas G. Moher.
"Caching Considerations for Generational Garbage
Collection". <em>1992 ACM Symposium on Lisp and
Functional Programming</em>. June 1992. Available
online: <a href=
"ftp://ftp.cs.utexas.edu/pub/garbage/cache.ps">ps</a>.
</li>
<li>Olivier Danvy. "Memory Allocation and Higher-Order
Functions". <em>Interpreters and Interpretive
Techniques (SIGPLAN'87)</em>. June 1987.
</li>
<li>Guy Lewis Steele, Jr.. "Macaroni is Better than
Spaghetti". <em>Proceedings of the Symposium on
Artificial Intelligence and Programming Languages</em>.
August 1977. Available online: <a href=
"http://portal.acm.org/citation.cfm?id=806933&amp;coll=portal&amp;dl=ACM">
ACM Digital Library</a>.
</li>
</ul><a name="misc-topics" id="misc-topics"></a>
<h3>
Miscellaneous Implementation Topics
</h3>
<ul>
<li>Felix S. Klock II. "The layers of Larceny's foreign
function interface". <em>2008 Workshop on Scheme and
Functional Programming</em>. September 2008. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2008/07-klock.pdf">
pdf</a>.
</li>
<li>Marcus Crestani. "Foreign-Function Interfaces for
Garbage-Collected Programming Languages". <em>2008
Workshop on Scheme and Functional Programming</em>.
September 2008. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2008/06-crestani.pdf">
pdf</a>.
</li>
<li>Andrew W. Keep and R. Kent Dybvig. "Ftypes:
Structured foreign types". <em>2011 Workshop on Scheme
and Functional Programming</em>. October 2011.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2011/03-keep.pdf">
pdf</a>.
</li>
<li>Nguyen-Minh Bui. "Toward abstract profiling". <em>
2007 Workshop on Scheme and Functional
Programming</em>. September 2007. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2007/10-bui.pdf">
pdf</a>.
</li>
<li>Guillaume Marceau, Gregory H. Cooper, Jonathan P.
Spiro, Shriram Krishnamurthi and Steven P. Reiss. "The
Design and Implementation of a Dataflow Language for
Scriptable Debugging". <em>Automated Software
Engineering Journal, 2006</em>. 2006. Available online:
<a href=
"http://www.cs.brown.edu/~sk/Publications/Papers/Published/mcskr-dataflow-lang-script-debug-journal/">
downloadable paper</a>.
</li>
<li>Eli Barzilay and Dmitry Orlovsky. "Foreign
Interface for PLT Scheme". <em>2004 Scheme
Workshop</em>. September 2004. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2004/barzilay.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2004/barzilay.pdf">
pdf</a>.
</li>
<li>Guillaume Marceau and Gregory H. Cooper and Shriram
Krishnamurthi and Steven P. Reiss. "A Dataflow Language
for Scriptable Debugging". <em>IEEE International
Symposium on Automated Software Engineering
(ASE2004)</em>. September 2004. Available online:
<a href=
"http://www.cs.brown.edu/~sk/Publications/Papers/Published/mckr-dataflow-lang-script-debug/">
downloadable paper</a>.
</li>
<li>Damien Ciabrini. "Debugging Scheme Fair Threads".
<em>2004 Scheme Workshop</em>. September 2004.
Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2004/ciabrini.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2004/ciabrini.pdf">
pdf</a>.
</li>
<li>Damien Ciabrini and Manuel Serrano. "Bugloo: A
Source Level Debugger for Scheme Programs Compiled into
JVM Bytecode". <em>3th International Lisp
Conference</em>. October 2003. Available online:
<a href=
"http://www-sop.inria.fr/mimosa/fp/Bugloo/doc/cia03.pdf">
pdf</a>.
</li>
<li>Marc Feeley and Danny Dubé. "PICBIT: A Scheme
System for the PIC Microcontroller". <em>Scheme
Workshop 2003</em>. November 2003. Available online:
<a href=
"http://repository.readscheme.org/ftp/papers/sw2003/PICBIT.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2003/PICBIT.pdf">
pdf</a>.
</li>
<li>John Clements and Matthias Felleisen. "A
Tail-Recursive Semantics for Stack Inspections".
<em>European Symposium on Programming (ESOP'2003)</em>.
April 2003. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/esop2003-cf.ps.gz">
ps</a> <a href=
"http://www.ccs.neu.edu/scheme/pubs/esop2003-cf.pdf">pdf</a>.
</li>
<li>Danny Dubé. "BIT: A very compact Scheme system for
embedded applications". <em>Scheme and Functional
Programming 2000</em>. September 2000. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/dube.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/dube.pdf">
pdf</a>.
</li>
<li>Dominique Boucher. "GOld: a link-time optimizer for
Scheme". <em>Scheme and Functional Programming
2000</em>. September 2000. Available online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/boucher.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2000/boucher.pdf">
pdf</a>.
</li>
<li>Fred Bayer. "LispMe: An Implementation of Scheme
for the PalmPilot". <em>2nd Workshop on Scheme and
Functional Programming</em>. September 2001. Available
online: <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/bayer.ps.gz">
ps</a> <a href=
"http://repository.readscheme.org/ftp/papers/sw2001/bayer.pdf">
pdf</a>.
</li>
<li>Lars Thomas Hansen. "The Impact of Programming
Style on the Performance of Scheme Programs". Masters
Thesis. University of Oregon. August 1992. Available
online: <a href=
"ftp://ftp.cs.indiana.edu/pub/scheme-repository/doc/pubs/impact.ps.gz">
ps</a>.
</li>
<li>Pieter H. Hartel, Marc Feeley, Martin Alt, Lennart
Augustsson, Peter Baumann, Marcel Beemster, Emmanuel
Chailloux, Christine H. Flood, Wolfgang Grieskamp, John
H. G. Van Groningen, Kevin Hammond, Bogumil Hausman,
Melody Y. Ivory, Richard E. Jones, Jasper Kamperman,
Peter Lee, Xavier Leroy, Rafael D. Lins, Sandra
Loosemore, Niklas Röjemo, Manuel Serrano, Jean-Pierre
Talpin, Jon Thackray, Stephen Thomas, Pum Walters,
Pierre Weis, Peter Wentworth. "Benchmarking
Implementations of Functional Languages with
``Pseudoknot'' a Float-Intensive Benchmark".
<em>Journal of Functional Programming</em>. Vol. 6, No.
4. 1996. Available online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/pseudoknot.ps.gz">
ps</a>.
</li>
<li>Pieter H. Hartel, Marc Feeley, Martin Alt, Lennart
Augustsson, Peter Baumann, Marcel Beemster, Emmanuel
Chailloux, Christine H. Flood, Wolfgang Grieskamp, John
H. G. Van Groningen, Kevin Hammond, Bogumil Hausman,
Melody Y. Ivory, Richard E. Jones, Jasper Kamperman,
Peter Lee, Xavier Leroy, Rafael D. Lins, Sandra
Loosemore, Niklas Röjemo, Manuel Serrano, Jean-Pierre
Talpin, Jon Thackray, Stephen Thomas, Pum Walters,
Pierre Weis, Peter Wentworth. "Benchmarking
Implementations of Functional Languages with
``Pseudoknot'' a Float-Intensive Benchmark".
<em>Journal of Functional Programming</em>. Vol. 6, No.
4. 1996. Available online: <a href=
"http://www.iro.umontreal.ca/~feeley/papers/pseudoknot.ps.gz">
ps</a>.
</li>
<li>Matthias Felleisen and Paul A. Steckler.
"Implementing a Static Debugger for a First-Order
Functional Programming Language". Rice University. TR
00-359. 2000. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/tr00-359.ps.gz">ps</a>.
</li>
<li>John Clements, Matthew Flatt, Matthias Felleisen.
"Modeling an Algebraic Stepper". <em>Proceedings of
ESOP 2001</em>. 2001. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/esop2001-cff.ps.gz">
ps</a> <a href=
"http://www.ccs.neu.edu/scheme/pubs/esop2001-cff.pdf">
pdf</a>.
</li>
<li>John Clements and Matthias Felleisen. "A
Tail-Recursive Machine with Stack Inspection".
<em>Transactions on Programming Languages and
Systems</em>. 2004. Available online: <a href=
"http://www.ccs.neu.edu/scheme/pubs/cf-toplas04.pdf">pdf</a>.
</li>
<li>Robert G. Burger. "Efficient Compilation and
Profile-Driven Dynamic Recompilation in Scheme". PhD.
Thesis. Indiana University Computer Science Department.
March 1997. Available online: <a href=
"http://www.cs.indiana.edu/~burger/Dissertation.ps.gz">
ps</a>.
</li>
<li>Robert G. Burger and R. Kent Dybvig. "An
infrastructure for profile-driven dynamic
recompilation". <em>IEEE Computer Society 1998
International Conference on Computer Languages</em>.
May 1998. Available online: <a href=
"http://www.cs.indiana.edu/~dyb/papers/Infrastructure.ps.gz">
ps</a>.
</li>
<li>Robert G. Burger and R. Kent Dybvig. "Printing
Floating Point Numbers Quickly and Accurately". <em>ACM
SIGPLAN 1996 Conference on Programming Language Design
and Implementation</em>. June 1996. Available online:
<a href=
"http://www.cs.indiana.edu/~dyb/FP-Printing-PLDI96.ps.gz">
ps</a>.
</li>
<li>William D. Clinger. "How to read floating point
numbers accurately". <em>Proceedings of the conference
on Programming language design and implementation</em>.
June 1990. Available online: <a href=
"http://www.acm.org/pubs/citations/proceedings/pldi/93542/p92-clinger/">
ACM Digital Library</a>.
</li>
<li>Guy Lewis Steele and Jon L. White. "How to print
floating-point numbers accurately". <em>Proceedings of
the conference on Programming language design and
implementation</em>. June 1990. Available online:
<a href=
"http://www.acm.org/pubs/citations/proceedings/pldi/93542/p112-steele/">
ACM Digital Library</a>.
</li>
<li>Christian Queinnec. "Validation Suite Generation".
<em>Revue Bigre+Globule</em>. (65). July 1989.
Available online: <a href=
"http://pagesperso-systeme.lip6.fr/Christian.Queinnec/Papers/vsg.ps.gz">
ps</a>.
</li>
</ul>
<p>
<img width="1" height="40" border="0" src=
"./imgs/dot_clear.gif">
</p>
<div class="collophon" align="right">
Drop "Hosted by concurrency.cc" This statement was displayed on the footer of each page. It is no longer accurate.
2024-06-16 13:16:33 -04:00
Last modified: Saturday, August 11th, 2012
4:55:47pm<br>
Run format script
2024-06-16 09:58:08 -04:00
HTML generated using <a href=
"http://celtic.benderweb.net/webit/">WebIt!</a>.
</div>
</td>
</tr>
</table>
</body>
</html>