Commit c7a5be52 authored by Pietro Abate's avatar Pietro Abate

[r2006-07-18 05:20:59 by afrisch] Empty log message

Original author: afrisch
Date: 2006-07-18 05:21:00+00:00
parent d6b0ea92
......@@ -25,9 +25,9 @@ OCamlDuce is distributed under the Q Public License version 1.0.
<ul>
<li>A <a
href="http://cristal.inria.fr/~frisch/ocamlcduce/ocamlduce.pdf">technical
href="papers/ocamlduce_icfp.pdf">technical
report</a> describes the theory behind OCamlDuce's type system (to be
presented in PLAN-X 2006).</li>
presented in ICFP 2006).</li>
<li><local href="ocaml_install">How to get OCamlDuce:</local> download,
installation instructions, packages.</li>
<li><local href="ocaml_manual">User's manual</local>.</li>
......
......@@ -441,6 +441,30 @@ monomorphic system.</p> </abstract>
</paper>
</li> </ul>
<ul>
<li>
<paper file="papers/ocamlduce_icfp.pdf">
<title>OCaml + XDuce</title>
<author>A. Frisch</author>
<comment>ICFP 2006</comment>
<abstract> <p> This paper presents the core type system and type inference
algorithm of OCamlDuce, a merger between OCaml and XDuce. The
challenge was to combine two type checkers of very different natures
while preserving the best properties of both (principality and
automatic type reconstruction on one side; very precise types and
implicit subtyping on the other side). Type inference can be described
by two successive passes: the first one is an ML-like unification-based
algorithm which also extracts data flow constraints about XML values;
the second one is an XDuce-like algorithm which computes XML types in
a direct way. An optional preprocessing pass, called strengthening,
can be added to allow more implicit use of XML subtyping. This pass is
also very similar to an ML type checker.</p> </abstract>
</paper>
</li> </ul>
</section>
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment