<section9 name="foreword">Foreword</section9>
<body>
The formal system λδ (\lambda\delta) is a typed λ-calculus aiming to support
- the foundations of Mathematics that require an underlying specification language
- (for example the <link to="http://www.math.unipd.it/~maietti/">Minimal Type Theory</link>
+ the foundational frameworks for Mathematics that require an underlying specification language
+ (for example the <link to="http://www.math.unipd.it/~maietti/">Minimalist Foundation</link>
and its predecessors).
</body>
<body>
λδ is developed in the context of the
<link to="http://helm.cs.unibo.it/">Hypertextual Electronic Library of Mathematics</link>
as a machine-checked digital specification
- that is not the formal counterpart of some previously published informal material.
+ that is not the formal counterpart of previous informal material.
</body>
<body>
- λδ comes in several versions listed in the following table,
- which includes the major milestones:
+ This is the System logo: <rlink to="images/crux_177.png">crux_177.png</rlink>
+ (revised <notice class="alpha" notice="2012-09"/>).
</body>
- <table name="versions"/>
-
- <section3 name="notice">Notice for the Internet Explorer user</section3>
<body>
+ <notice class="alpha" notice="Notice for the user of Internet Explorer."/>
To view this site correctly, please select a font
with <link to="http://www.unicode.org/">Unicode</link> support.
For example "Lucida Sans Unicode" (it should be already installed on your system).
"Tools" menu → "Internet Options" entry → "General" tab → "Fonts" button.
</body>
+<!-- ===================================================================== -->
+
+ <section9 name="citations">Citations</section9>
+ <body>
+ This is a list of publications citing λδ documentation.
+ </body>
+
+ <topitem name="C7">
+ C. Dunchev, F. Guidi, C. Sacerdoti Coen, E. Tassi:
+ <notice class="alpha" notice="ELPI: fast, Embeddable, λProlog Interpreter"/>
+ (2015). In proc. of LPAR 20. LNCS 9450, pp. 460-468.
+ </topitem>
+
+ <topitem name="C6">
+ A. Asperti, W. Ricciotti, C. Sacerdoti Coen, E. Tassi:
+ <notice class="alpha" notice="Formal metatheory of programming languages in the Matita interactive theorem prover"/>
+ (2012). In JAR 49(3), pp. 427-451.
+ </topitem>
+
+ <topitem name="C5">
+ M.E. Maietti:
+ <notice class="alpha" notice="Consistency of the minimalist foundation with Church thesis and Bar Induction"/>
+ (2012). Submitted article.
+ </topitem>
+
+ <topitem name="C4">
+ W. Ricciotti:
+ <notice class="alpha" notice="Theoretical and implementation aspects in the mechanization of the metatheory of programming languages"/>
+ (July 2011). Ph.D. Thesis in Computer Science, Technical Report UBLCS-2011-09, University of Bologna.
+ </topitem>
+
+ <topitem name="C3">
+ C.E. Brown:
+ <notice class="alpha" notice="Faithful Reproductions of the Automath Landau Formalization"/>
+ (2011). Technical report.
+ </topitem>
+
+ <topitem name="C2">
+ M.E. Maietti:
+ <notice class="alpha" notice="A minimalist two-level foundation for constructive mathematics"/>
+ (2009). In APAL 160(3), pp. 319-354.
+ </topitem>
+
+ <topitem name="C1">
+ V. Rahili:
+ <notice class="alpha" notice="First Year Report: Realisability methods of proof and semantics with application to expansion"/>
+ (July 2007). Technical report.
+ </topitem>
+
<footer/>
</page>
projects / helm.git / blobdiff