1 <?xml version="1.0" encoding="UTF-8"?>
3 <page xmlns="http://lambdadelta.info/"
4 description = "\lambda\delta home page"
5 title = "\lambda\delta home page"
6 head = "The Formal System λδ (\lambda\delta)"
8 <sitemap name="sitemap"/>
10 <section9 name="foreword">Foreword</section9>
12 The formal system λδ (\lambda\delta) is a typed λ-calculus aiming to support
13 the foundations of Mathematics that require an underlying specification language
14 (for example the <link to="http://www.math.unipd.it/~maietti/">Minimal Type Theory</link>
15 and its predecessors).
18 λδ is developed in the context of the
19 <link to="http://helm.cs.unibo.it/">Hypertextual Electronic Library of Mathematics</link>
20 as a machine-checked digital specification
21 that is not the formal counterpart of some previously published informal material.
24 This is the System logo: <rlink to="images/crux_177.png">crux_177.png</rlink>
25 (revised <notice class="alpha" notice="2012-09"/>).
28 <notice class="alpha" notice="Notice for the user of Internet Explorer."/>
29 To view this site correctly, please select a font
30 with <link to="http://www.unicode.org/">Unicode</link> support.
31 For example "Lucida Sans Unicode" (it should be already installed on your system).
32 To change the current font follow:
33 "Tools" menu → "Internet Options" entry → "General" tab → "Fonts" button.
36 <!-- ===================================================================== -->
38 <section9 name="citations">Citations</section9>
40 This is a list of publications citing λδ (not including our own).
44 A. Asperti, W. Ricciotti, C. Sacerdoti Coen, E. Tassi:
45 <notice class="alpha" notice="Formal metatheory of programming languages in the Matita interactive theorem prover"/>
46 (2012). In JAR 49(3), pp. 427-451.
51 <notice class="alpha" notice="Consistency of the minimalist foundation with Church thesis and Bar Induction"/>
52 (2012). Submitted article.
57 <notice class="alpha" notice="Theoretical and implementation aspects in the mechanization of the metatheory of programming languages"/>
58 (July 2011). Ph.D. Thesis in Computer Science, Technical Report UBLCS-2011-09, University of Bologna.
63 <notice class="alpha" notice="Faithful Reproductions of the Automath Landau Formalization"/>
64 (2011). Typescript note.
69 <notice class="alpha" notice="A minimalist two-level foundation for constructive mathematics"/>
70 (2009). In APAL 160(3), pp. 319-354.
75 <notice class="alpha" notice="First Year Report: Realisability methods of proof and semantics with application to expansion"/>
76 (July 2007). Typescript note.