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 Systems of the λδ (\lambda\delta) Family"
8 <sitemap name="sitemap"/>
10 <section9 name="foreword">Foreword</section9>
12 The formal systems of the λδ (\lambda\delta) family are typed λ-calculi aiming to support
13 the foundational frameworks for Mathematics that require an underlying specification language
14 (for example the <link to="http://www.math.unipd.it/~maietti/">Minimalist Foundation</link>
15 and its predecessors).
18 The λδ family is developed within the
19 <link to="http://helm.cs.unibo.it/">Hypertextual Electronic Library of Mathematics</link>
20 as a set of machine-checked digital specifications.
23 This is the family logo: <rlink to="images/crux_177.png">crux_177.png</rlink>
24 (revised <notice class="alpha" text="2012-09"/>).
27 <notice class="alpha" text="Notice for the user of Internet Explorer."/>
28 To view this site correctly, please select a font
29 with <link to="http://www.unicode.org/">Unicode</link> support.
30 For example "Lucida Sans Unicode" (it should be already installed on your system).
31 To change the current font follow:
32 "Tools" menu → "Internet Options" entry → "General" tab → "Fonts" button.
35 <!-- ===================================================================== -->
37 <section9 name="citations">Citations</section9>
39 This is a list of publications citing λδ documentation.
43 C. Dunchev, F. Guidi, C. Sacerdoti Coen, E. Tassi:
44 <notice class="alpha">ELPI: Fast, Embeddable, λProlog Interpreter</notice>
45 (2015). In proc. of LPAR 20. Lecture Notes in Computer Science, 9450, pp. 460-468. Springer.
49 A. Asperti, W. Ricciotti, C. Sacerdoti Coen, E. Tassi:
50 <notice class="alpha">Formal metatheory of programming languages in the Matita interactive theorem prover</notice>
51 (2012). In Journal of Automated Reasoning, 49(3), pp. 427-451. Springer.
56 <notice class="alpha">Consistency of the minimalist foundation with Church thesis and Bar Induction</notice>
57 (2012). Submitted article.
62 <notice class="alpha">Theoretical and implementation aspects in the mechanization of the metatheory of programming languages</notice>
63 (July 2011). Ph.D. Thesis in Computer Science, Technical Report UBLCS-2011-09, University of Bologna.
68 <notice class="alpha">Faithful Reproductions of the Automath Landau Formalization</notice>
69 (2011). Technical report.
74 <notice class="alpha">A minimalist two-level foundation for constructive mathematics</notice>
75 (2009). In Annals of Pure and Applied Logic, 160(3), pp. 319-354. Elsevier.
80 <notice class="alpha">First Year Report: Realisability methods of proof and semantics with application to expansion</notice>
81 (July 2007). Technical report.
84 <!-- ===================================================================== -->
86 <section9 name="disclaimer">Disclaimer</section9>
88 The systens of the λδ family <notice class="alpha" text="are not"/> related intentionally to any other system
89 having (variations of) the symbols λ and δ in its name or syntax.
90 Examples include (but are not limited to):
94 <notice class="alpha">λ-δ</notice> of
96 <notice class="alpha">The calculi of lambda-conversion</notice>
98 Annals of Mathematics Studies 6.
99 Princeton University Press.
103 <notice class="alpha">∆Λ</notice> of
105 <notice class="alpha">Generalizing Automath by means of a lambda-typed lambda calculus</notice>
107 In Lecture Notes in Pure and Applied Mathematics 106, pp. 71-92.
112 <notice class="alpha">λ<sub>∆</sub></notice> of
113 N.J. Rehof, M.H. Sørensen:
114 <notice class="alpha">The λ<sub>∆</sub>-calculus</notice>
116 In Lecture Notes in Computer Science, 789, pp. 516–542.
121 <notice class="alpha">λ∆</notice> of
122 S. Ronchi Della Rocca, L. Paolini:
123 <notice class="alpha">The Parametric Lambda Calculus</notice>
125 Texts in Theoretical Computer Science, An EATCS Series.
130 <notice class="alpha">λD</notice> of
131 R. Nederpelt, H. Geuvers:
132 <notice class="alpha">Type Theory and Formal Proof</notice>
134 Cambridge University Press.
138 <notice class="alpha">Cλξ</notice> of
140 <notice class="alpha">A namefree lambda calculus with facilities for internal definition of expressions and segments</notice>
143 Eindhoven University of Technology, Eindhoven.