http:^^www.cs.bu.edu^groups^church^bibliography^

This data set contains WWW-pages collected from computer science departments of various universities

<blockquote>
This report details the design and implementation of the ZINC
system.  This is an experimental implementation of the ML
language, which has later evolved in the Caml Light system.
This system is strongly oriented toward separate compilation
and the production of small, standalone programs; type safety
is ensured by a Modula-2-like module system.  ZINC uses
simple, portable techniques, such as bytecode interpretation;
a sophisticated execution model helps counterbalance the
interpretation overhead. 
</blockquote>

<li>
N. Bj&oslash;rner.
Minimal typing derivations.
In <cite>Record 1994 ACM SIGPLAN Workshop on ML and its Applications</cite>.

</ul>

<h2> Program Representation, Optimization and Analysis </h2>

<ul>

<li>
A.W. Appel and T. Jim.
<!WA57><a href="http://www.cs.princeton.edu/faculty/appel/papers/cpcps.ps">
Continuation-passing, closure-passing style</a>.
Appeared in <cite>Proc. 16th ACM Symp. Principles of Programming
Languages</cite>, pp. 293--302, Jan. 1989.

<li>
Z. Shao and A.W. Appel.
<!WA58><a href="ftp://ftp.cs.princeton.edu/reports/1994/454.ps.Z">
Space-Efficient Closure Representations</a>.
Technical Report CS-TR-454-94, Princeton Univ., 1994.
Appeared in <cite>Proc. 1994 ACM Conf. Lisp and Functional
Programming</cite>, June 1994.

<li>
Y. Minamide, G. Morrisett, and R. Harper.
<!WA59><A href="http://foxnet.cs.cmu.edu/papers/closure.ps">
Typed Closure Conversion</a>, 
Technical Report CMU-CS-FOX-95-05, 1995.

<li>
R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck.
Efficiently computing static single assignment form and the control
dependence graph.
<cite>Trans. Programming Languages and Systems</cite>, 13(4):451--490,
Oct. 1991.

<li>
C. Hall.
Using Hindley-Milner type inference to optimize list representation.
In <cite>Proc. 1994 ACM Conf. LISP and Functional Programming</cite>.

<li>
Z. Shao, J.H. Reppy, and A.W. Appel.
<!WA60><a href="ftp://ftp.cs.princeton.edu/reports/1994/453.ps.Z">
Unrolling Lists</a>.
Technical Report CS-TR-453-94,
Princeton Univ., 1994.
Appeared in
<cite>Proc. 1994 ACM Conf. on Lisp and Functional Programming</cite>,
June 1994.

</ul>

<h3> Control and Data Flow Analysis </h3>

<ul>

<li>
N. Heintz.
<!WA61><A HREF="ftp://reports.adm.cs.cmu.edu/usr/anon/1993/CMU-CS-93-193.ps">
Set Based Analysis of ML Programs</A>
Technical Report CMU-CS-FOX-93-03, 1993.

<li>
C. Colby and P. Lee.
<!WA62><A href="http://foxnet.cs.cmu.edu/papers/trace.ps">
Trace-based Program Analysis</a>.
Technical Report CMU-CS-FOX-95-04, 1995.
See also the
<!WA63><A href="http://www.cs.cmu.edu/afs/cs/user/petel/ftp/talks/trace-small.ps.gz">
slides for a talk</a>
about trace-based analysis.

<p>
<li>
<strong>
<!WA64><a href="http://www.cs.bu.edu/groups/church/people/henglein.html">F Henglein</a> and <!WA65><a href="http://www.cs.bu.edu/groups/church/people/mossin.html">C Mossin</a></strong>.<br>
<i>Polymorphic Binding-Time Analysis</i>.
<br> In <i>Proceedings of European Symposium on Programming</i> (
D  Sannella, ed.), pp.&#32;287-301. Volume&#32;788 of Lecture Notes in Computer Science. Springer-Verlag. April, 1994.
<p><i>Keywords</i>: binding time analysis, polymorphism, polymorphic recursion
<p><i>Summary</i>: A polymorphic binding time analysis with polymorphic
 recursion is proposed as an alternative to polyvariant binding time analysis.
 The type system is proven to have the principal typing property, and the
 analysis is proven to be correct and partially complete (unfolding a
 definition cannot improve the results of the analysis).
<p><i>Pointers</i>:
<!WA66><a href="ftp://ftp.diku.dk/diku/semantics/papers/D-198.dvi.Z">dvi.Z</a>.

<p>

<li>
A. Sabry and M. Felleisen.
<!WA67><A href="http://foxnet.cs.cmu.edu/afs/cs/user/sabry/Mosaic/cps-flow-tr.dvi">
Is Continuation Passing Useful for Data-Flow Analysis?</a>.
Technical Report, Rice Univ., 1994.
<!WA68><A href="http://foxnet.cs.cmu.edu/afs/cs/user/sabry/Mosaic/cps-flow-pldi.dvi">
Another version</a> appears in
<cite>Proc. Programming Language Design and Implementation</cite>, 1994.

</ul>

<h3> Register Allocation </h3>

<ul>

<li>
A.W. Appel and Z. Shao.
<!WA69><a href="ftp://ftp.cs.princeton.edu/reports/1991/326.ps.Z">
Callee-save Registers in Continuation-Passing Style</a>.
Technical Report CS-TR-326-91, Princeton Univ., 1991.
Appeared in <cite>Lisp and Symbolic Computation</cite>, 5:189--219, 1992.

<li>
P. Briggs, K.D. Cooper, and L. Torczon.
Improvements to graph coloring register allocation.
<cite>Trans. Programming Languages and Systems</cite>,
16(3):428--455, May 1994.

<li>
L. George and A.W. Appel.
<!WA70><a href="ftp://ftp.cs.princeton.edu/reports/1995/498.ps.Z">
Iterated Register Coalescing</a>.
Technical Report CS-TR-498-95, Princeton Univ., Aug. 1995.

</ul>

<h3>Boxing</h3>

<ul>

<li>
X. Leroy.
<!WA71><A HREF="file://ftp.inria.fr/INRIA/Projects/cristal/Xavier.Leroy/unboxed-polymorphism.dvi.gz">
Unboxed objects and polymorphic typing</a>.
In <cite>Proc. Principles of Programming Languages</cite>, 1992.

<blockquote>
This paper presents a program transformation that allows
languages with polymorphic typing (e.g. ML) to be implemented
with unboxed, multi-word data representations, more efficient
than the conventional boxed representations.  The
transformation introduces coercions between various
representations, based on a typing derivation.  A prototype ML
compiler utilizing this transformation demonstrates important
speedups.
</blockquote>

<p>
<li>
Fritz Henglein and Jasper J&oslash;rgensen.
<!WA72><a href="ftp://ftp.diku.dk/diku/semantics/papers/D-179.dvi.Z">
Formally optimal boxing</a>.
In <CITE>Proceedings 21st ACM SIGPLAN-SIGACT Symposium on
Principles of Programming Languages</CITE>, pages 213-226.

<p>
<li>
R. Harper and G. Morrisett.
<!WA73><A HREF="http://foxnet.cs.cmu.edu/papers/intensional.ps">
Compiling Polymorphism Using Intensional Type Analysis</A>.
Technical Report CMU-CS-FOX-94-07, 1994.

</ul>

<h2> Run-Time Systems </h2>

<ul>

<li>
M. Tofte and J.-P. Talpin.
Implementation of the typed call-by-value lambda-calculus 
using a stack  of regions.
In <cite>Proc. 21st Ann. ACM SIGPLAN-SIGACT Symp.
Principles of Programming Languages</cite>, 1994. 
 
<li>
Aiken, et. al.
<!WA74><a href="http://kiwi.cs.berkeley.edu/~nogc/paper.ps"> 
Better static memory management: improving region-based analysis of 
higher-order languages</a>.
In <cite>Proc. Programming Language Design and Implementation</cite>, 1995.
Also available as an expanded, 52-page
<!WA75><A HREF="http://kiwi.cs.berkeley.edu/~nogc/tr.ps">technical report</A>.

<li>
M.J.R. Goncalves and A.W. Appel.
<!WA76><a href="http://www.cs.princeton.edu/faculty/appel/papers/cache.ps">
Cache performance of fast-allocating programs</a>.
In <cite>Proc. 7th Int'l Conf. Functional Programming and Computer 
Architecture</cite>, pp. 293--305.
ACM Press, June 1995.

<li>
Andrew W. Appel.
<!WA77><a href="ftp://ftp.cs.princeton.edu/reports/1989/220.ps.Z">A runtime system</a>.
<CITE>Lisp and Symbolic Computation</CITE>, 3:343-380, 1990.

<li>
A.W. Appel and Z. Shao.
<!WA78><a href="ftp://ftp.cs.princeton.edu/reports/1994/450.ps.Z">
An Empirical and Analytic Study of Stack vs. Heap Cost
for Languages with Closures</a>.
Technical Report CS-TR-450-94, Princeton Univ., Mar. 8, 1994.
A
<!WA79><a href="http://www.cs.princeton.edu/faculty/appel/papers/stack2.ps.Z">
revised version</a> to appear in <cite>J. Functional Programming</cite>.

<li>
D. Tarditi, A. Diwan, and E. Moss.
<!WA80><A HREF="ftp://reports.adm.cs.cmu.edu/usr/anon/1993/CMU-CS-93-210.ps">
Memory Subsystem Performance of Programs Using Copying Garbage
Collection</A>.
Technical Report CMU-CS-FOX-93-06, 1993.
Appeared in <cite>Proc. 21st Ann.
ACM SIGACT-SIGPLAN Symp. Principles of Programming
Languages</cite>.

<li>
D. Tarditi, A. Diwan, and E. Moss.
<!WA81><A HREF="ftp://reports.adm.cs.cmu.edu/usr/anon/1993/CMU-CS-93-227.ps">
Memory Subsystem Performance of Programs with Intensive Heap
Allocation</A>.
Technical Report CMU-CS-FOX-93-07, 1993.

<li>
P. Fradet.
Collecting more garbage.
In <cite>Proc. 1994 ACM Conf. LISP and Functional Programming</cite>.

<li>
A.W. Appel.
<!WA82><a href="http://www.cs.princeton.edu/faculty/appel/papers/142.ps">
Runtime Tags Aren't Necessary</a>.
Technical Report CS-TR-142-88, Princeton Univ., Mar. 1988.
Appeared in <cite>Lisp and Symbolic Computation</cite>, 19(7):703--705,
July 1989.

</ul>

<h2> Miscellaneous Compiler Related Papers </h2>

<ul>

<li>
Andrew W. Appel.
<!WA83><a href="ftp://ftp.cs.princeton.edu/reports/1994/451.ps.Z">
Axiomatic Bootstrapping: A Guide for Compiler Hackers</a>.
Technical Report CS-TR-451-94, Princeton Univ., 
Mar. 9, 1994.
Appeared in 
<cite>Record 1994 ACM SIGPLAN Workshop on ML and its Applications</cite>.
A <!WA84><a href="http://www.cs.bu.edu/groups/church/toplas/subscribe.html">
revised version with diagrams</a>
appears in </cite>Trans. Programming Languages and Systems</cite>,
16(6):1699--1718, Nov. 1994.

<li>
R. Harper, P. Lee, F. Pfenning, and E. Rollins.
A compilation manager for standard ML of New Jersey.
In <cite>Record 1994 ACM SIGPLAN Workshop on ML and its Applications</cite>.
(Probably closely related to the other paper by the same group of 4.)

<li>
N. Haines, E. Biagioni, R. Harper, and B.G. Milnes.
<!WA85><A HREF="ftp://reports.adm.cs.cmu.edu/usr/anon/1993/CMU-CS-93-172.ps">
Note on Conditional Compilation in Standard ML</A>.
Technical Report CMU-CS-FOX-93-02, 1993.

<li>
D. Tarditi, P. Lee, and A. Acharya.
<!WA86><A HREF="http://foxnet.cs.cmu.edu/papers/petel-sml2c.ps">
No assembly required: Compiling Standard ML to C</A>.
<cite>Letters on Programming Languages and Systems</cite>, June 1992.

</ul>

<h2> Correct and Optimal Lambda-Calculus Evaluation </h2>

  <ul>
    <li>Gonthier, Abadi and L&eacute;vy.
	<!WA87><a href="http://www.cs.brandeis.edu/~mairson/Seminar/GAL-LC.ps">
	  The geometry of optimal lambda reduction</a>.
    <li>Gonthier, Abadi and L&eacute;vy.
	<!WA88><a href="http://www.cs.brandeis.edu/~mairson/Seminar/GAL-LL.ps">
	  Linear logic without boxes</a>.
    <li>Lawall and Mairson.
	<!WA89><a href="http://www.cs.brandeis.edu/~mairson/Papers/icfp96.ps">
	  Optimality and inefficiency:
		what isn't a cost model of the lambda calculus?</a>.
    <li>Lawall and Mairson.
	<!WA90><a href="http://www.cs.brandeis.edu/~mairson/Papers/LM96b.ps.gz">
	  On the global dynamics of optimal graph reduction</a>.
  </ul>

</body>
</html>