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

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

R. Harper, M. Lillibridge.
<!WA23><A HREF="http://www.cs.cmu.edu:8001/afs/cs/user/rwh/public/papers/sharing.ps">
A Type-Theoretic Approach to Higher-Order Modules with Sharing</A>.
Technical Report CMU-CS-FOX-93-04, 1993.
A version appeared in <cite>Proc. 21st Ann. ACM SIGACT-SIGPLAN Symp. Principles
of Programming Languages</cite>, Jan. 1994.

</ul>

<h3> Separate Compilation </h3>

<ul>

<li>
Z. Shao and A.W. Appel.
<!WA24><a href="ftp://ftp.cs.princeton.edu/reports/1992/395.ps.Z">
Smartest Recompilation</a>.
Technical Report CS-TR-395-92, Princeton Univ., 1992.
Appeared in 
<cite>Proc. 20th ACM Symp. Principles of Programming Languages</cite>,
Jan. 1993.

<li>
X. Leroy.
<!WA25><A HREF="file://ftp.inria.fr/INRIA/Projects/cristal/Xavier.Leroy/manifest-types.dvi.gz">
Manifest types, modules, and separate compilation</a>.
In <cite>Proc. Principles of Programming Languages</cite>, 1994.

<blockquote>
This paper presents a variant of the SML module system that
introduces a strict distinction between abstract types and
manifest types (types whose definitions are part of the module
specification), while retaining most of the expressive power
of the SML module system.  The resulting module system
provides much better support for separate compilation. 
</blockquote>

<li>
R. Harper, P. Lee, F. Pfenning, and E. Rollins.
<!WA26><A HREF="http://www.cs.cmu.edu:8001/afs/cs/user/petel/ftp/papers/incremental-recomp.ps">
Incremental Recompilation for Standard ML of New Jersey</A>.
Technical Report CMU-CS-FOX-94-02, 1994.

</ul>

<h3> Record Types </h3>

<UL>
<li>
      Didier R閙y.
<!WA27><A HREF="file://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/taoop1.dvi.Z">
      Records and Variants as a natural Extension of ML</A>.
      In "Theoretical  Aspects Of Object-Oriented Programming:   Types,
      Semantics and Language Design".  MIT Press, April 1994.
      Carl A. Gunter and John C. Mitchell.
<P>
      We describe an extension of ML with  records where inheritance is
      given  by ML   generic  polymorphism.  All common  operations  on
      records but  concatenation are supported,    in particular the  free
      extension of records.  Other  operations such as renaming  of fields
      are added.  The solution relies on an extension  of ML, where the
      language of types is sorted  and considered modulo equations, and on
      a record extension of types.  The solution is simple and modular and
      the type inference algorithm is efficient in practice. (<!WA28><A HREF="http://www.cs.bu.edu/publi-bib/taoop1.html">BibTeX reference</A>.)
<P>

<li>
      Didier R閙y.
      <!WA29><A HREF="file://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/free-concatenation.dvi.Z">
        Typing Record Concatenation for Free</A>.
      INRIA Research Report 1739, 1992.
<P>
      We show that any functional language with record extension possesses
      record concatenation  for free.  We exhibit  a translation  from the
      latter into the former.  We obtain a type system for a language with
      record concatenation  by composing the translation with typechecking
      in a language with   record extension.  We apply   this method to  a
      version  of ML with record extension   and obtain an extension of
      ML with either asymmetric or symmetric concatenation.  The latter
      extension is simple,  flexible  and   has  a very  efficient    type
      inference  algorithm  in  practice.   Concatenation   together  with
      removal of fields  needs  one  more   construct than  extension   of
      records.   It can  be added  to   the version of  ML with  record
      extension.  However, many   typed languages with record  cannot type
      such a construct.  The method still  applies to them, producing type
      systems for record concatenation without  removal of fields.  Object
      systems   also  benefit of the   encoding  which shows that multiple
      inheritance does not  actually require the  concatenation of records
      but only their extension. (<!WA30><A HREF="http://www.cs.bu.edu/publi-bib/free-concatenation.html">BibTeX reference</A>.)
<P>

<li>
    <B> Didier R閙y. "A case study of typechecking with constrained types:
    Typing record concatenation".  </B> <em> Unpublished draft.
    Presented at the workshop on Advances in type systems
    for computing at the Newton Institute, Cambridge, U.K. August 
    1995. </em>
    You may view the <!WA31><A HREF=ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/sub-concat.txt>abstract</A>,
    the <!WA32><A HREF="ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/sub-concat.bib">BibTeX reference</A>, 
    or the <!WA33><A HREF="ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/sub-concat.dvi">dvi file</A>. 
    <P>
</UL>

<h3> Imperative Features </h3>

<ul>

<li>
    <B>A Generalization of Exceptions and Control in ML"
    (joint work with Carl A. Gunter and Jon G. Riecke)</B>
    Presented at <em> FPCA 95</em>, San Diego. 
<P>
    You may view the <!WA34><A HREF=ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/prompt.txt>abstract</A>,
    the <!WA35><A HREF="ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/prompt.bib">BibTeX reference</A>, 
    or the <!WA36><A HREF="ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/prompt.dvi">dvi file</A>. 
    You may also retreive the <!WA37><A HREF="http://www.cs.bu.edu/groups/church/bibliography/prompt.sml">code of the appendix</A>)

<p>
<li>
    Carl A. Gunter, Didier R閙y, Jon G. Riecke.
<!WA38><A HREF="file://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/prompt.dvi.Z">
    Prompting ML</A>.
    Unpublished Draft, January 1995.
<P>
    We add functional continuations and prompts to a language with an
    ML-style type system.  The operators significantly extend and
    simplify the control operators in SML/NJ, and can be themselves
    used to implement (simple) exceptions.  We prove that well-typed
    terms never produce run-time type errors and give a module for
    implementing them in the latest version of SML/NJ.
    (The code of the appendix is avalaible <!WA39><A HREF="ftp://ftp.inria.fr/INRIA/Projects/cristal/Didier.Remy/prompt.sml">here</A>)
<P>
 (<!WA40><A HREF="http://www.cs.bu.edu/publi-bib/*prompt-draft.html">BibTeX reference</A>.)
<P>

<li>
R. Harper, B.F. Duba, and D. MacQueen.
<!WA41><A HREF="http://www.cs.cmu.edu:8001/afs/cs/user/rwh/public/papers/typing-callcc.ps">Typing first-class continuations in ML</A>.
<cite>J. Functional Programming</cite>, 3(4):465--484, Oct. 1993.

<li>
R. Harper.
<!WA42><A HREF="http://www.cs.cmu.edu:8001/afs/cs/user/rwh/public/papers/refs.ps"> 
A simplified account of polymorphic references</A>.
<cite>Information Processing Letters</cite>, 51:201--206, 1994.

<li>
K. Yi.
<!WA43><a href="ftp://ftp.research.att.com/dist/ml/papers/94-sas-yi.ps">
Compile-time detection of uncaught exceptions in standard ML programs</a>.
In <cite>Proc. Symp. Static Analysis</cite>, 1994.

</ul>

<h3> Dynamic Types </h3>

<ul>

<li>
M. Abadi, L. Cardelli, B.C. Pierce, and D. Remy.
<!WA44><a href="http://www.research.digital.com/SRC/personal/Luca_Cardelli/Papers/PolyDyn.ps">
Dynamic Typing in Polymorphic Languages</a>.
1994.

<p>
<li>
X. Leroy and M. Mauny.
<!WA45><A HREF="file://ftp.inria.fr/INRIA/Projects/cristal/Xavier.Leroy/dynamics-in-ML.dvi.gz">
Dynamics in ML</a>.
<cite>J. Functional Programming</cite>, 3(4), 1993.
<P>
    Objects with dynamic types allow the integration of operations
    that essentially require run-time type-checking into
    statically-typed languages. This article presents two
    extensions of the ML language with dynamics, based on our work
    on the CAML implementation of ML, and discusses their
    usefulness. The main novelty of this work is the combination
    of dynamics with polymorphism. 

<p>
<li>
F. Henglein.
<!WA46><a href="ftp://ftp.diku.dk/diku/semantics/papers/D-163.dvi.Z">
Dynamic typing: Syntax and proof theory</a>.
In <cite>Science of Computer Programming</cite>, 1993.

<p>

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

</ul>


<h3> Overloading </h3>

<ul>

<p>
<li>
Philip Wadler and Stephen Blott.
How to make <EM>ad-hoc</EM> polymorphism less <EM>ad hoc</EM>.
In <CITE>Proceedings 16st ACM SIGPLAN-SIGACT Symposium on
Principles of Programming Languages</CITE></A>, pages 60-76.

<p>
<li>
Mark P. Jones.
<CITE>Qualified Types: Theory and Practice</CITE>.
Cambridge University Press, November 1994.

<p>
<li>
Mark P. Jones.
Simplifying and improving qualified types.
In <CITE>Proceedings 1995 Conference on Functional
Programming and Computer Architecture</CITE>, pages
160-169.

<p>
<li>
Stefan Kaes.
Typing in the presence of overloading, subtyping, and recursive types.
In <CITE>Proceedings 1992 Conference on Lisp and Functional
  Programming</CITE>, pages 193-204.

<p>
<li>
Martin Odersky, Philip Wadler, and Martin Wehr.
A second look at overloading.
In <CITE>Proceedings 1995 Conference on Functional
Programming and Computer Architecture</CITE>, pages 135-146.

<p>
<li>
Geoffrey S. Smith.
Principal type schemes for functional programs with overloading and subtyping.
<CITE>Science of Computer Programming</CITE>, 23:197-226, 1994.

</ul>
<h3> Miscelaneous Features </h3>

<ul>

<li>
E. Biagioni.
<!WA49><a href="http://www.cs.bu.edu/groups/church/bibliography/papers/esb-sequences.ps">
Sequence Types for Functional Languages</a>.
Technical Report CMU-CS-FOX-95-06, 1995.

</ul>

<h2> Compiler Architecture </h2>

<ul>

<li>
A.W. Appel.
<cite><!WA50><a href="http://www.cs.bu.edu/groups/church/bibliography/cwc.html">Compiling with Continuations</a></cite>.
Cambridge University Press, 1992.

<li>
S.L. Peyton-Jones.
<cite>The Implementation of Functional Programming Languages</cite>.

<li>
Z. Shao.
<cite><!WA51><a href="ftp://daffy.cs.yale.edu/pub/papers/shao/thesis.ps">
Compiling Standard ML for Efficient Execution on Modern Machines</a></cite>.
Ph.D. Dissertation,
Dept. Computer Science, Princeton Univ.,
Nov. 1994.

<li>
R. Kelsey.
<cite><!WA52><a href="http://www.cs.bu.edu/groups/church/bibliography/Kelsey.ps">
A Correspondence between Continuation Passing Style
and Static Single Assignment</a></cite>.
Unpublished, Jan. 1995.

<li>
A.W. Appel and D.B. MacQueen.
<!WA53><a href="http://www.cs.princeton.edu/faculty/appel/papers/smlnj.ps">
Standard ML of New Jersey</a>.
Technical Report CS-TR-329-91, Princeton Univ., 1991.
Appeared in <cite>Third Int'l Symp. Programming Language Implementation
and Logic Programming</cite>, vol. 528 of LNCS, pp. 1--13.
Springer-Verlag, Aug. 1991.

<li>
Z. Shao and A.W. Appel.
<!WA54><a href="ftp://ftp.cs.princeton.edu/reports/1995/487.ps.Z">A Type-Based
Compiler for Standard ML</a>.
CS-TR-487-95, Princeton University,
March 28, 1995.
Appears in
<cite>Proc. 1995 ACM Conf. on Programming Language Design and Implementation</cite>,
(SIGPLAN Notices, 30(6)), pp. 116--129, June 1995.

<li>
Amr Sabry.
<!WA55><A href="http://foxnet.cs.cmu.edu/afs/cs/user/sabry/Mosaic/essence-pldi.dvi">
The essence of compiling with continuations</a>.
In <cite>Proc. Programming Language Design and Implementation</cite>, 1993.

<li>
X. Leroy.
<!WA56><A HREF="file://ftp.inria.fr/INRIA/Projects/cristal/Xavier.Leroy/economical-ML-implementation.ps.gz">
The ZINC Experiment, an Economical Implementation of the ML Language</a>.
Technical Report 117, INRIA, 1990.