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"
7 head = "The Formal Systems of the λδ (\lambda\delta) Family"
9 <sitemap name="sitemap"/>
11 <section9 name="foreword">Foreword</section9>
13 The formal systems of the λδ (\lambda\delta) family are typed λ-calculi aiming to support
14 the foundational frameworks for Mathematics that require an underlying specification language,
16 <link to="http://www.math.unipd.it/~maietti/">Minimalist Foundation (MF)</link>
20 The λδ family is developed within the
21 <link to="http://helm.cs.unibo.it/">Hypertextual Electronic Library of Mathematics (HELM)</link>
22 as a set of machine-checked digital specifications.
25 This is the family logo: <rlink to="images/crux_177.png">crux_177.png</rlink>
26 (revised <notice class="alpha" text="2012-09"/>).
29 <notice class="alpha" text="Notice:"/>
30 to view this site correctly, please select a font
31 with <link to="http://www.unicode.org/">Unicode</link> support.
34 <ucs-bronze char="03BB"/>
37 <!-- ===================================================================== -->
39 <section9 name="citations">Citations</section9>
41 This is a list of publications citing λδ documentation.
46 <notice class="alpha">An extended type system with lambda-typed lambda-expressions</notice>
47 (2018). Technical report. Faculty of Computer Science, Technical University of Berlin.
52 <notice class="alpha">An extended type system with lambda-typed lambda-expressions (extended version)</notice>
53 (2018). Technical report. Faculty of Computer Science, Technical University of Berlin.
57 M.E. Maietti, S. Maschio:
58 <notice class="alpha">An extensional Kleene realizability semantics for the Minimalist Foundation</notice>
59 (2015). In Leibniz International Proceedings in Informatics, 39, pp 162-186. Schloss Dagstuhl, Leibniz-Zentrum für Informatik.
63 C. Dunchev, F. Guidi, C. Sacerdoti Coen, E. Tassi:
64 <notice class="alpha">ELPI: Fast, Embeddable, λProlog Interpreter</notice>
65 (2015). In proc. of LPAR 20. Lecture Notes in Computer Science, 9450, pp. 460-468. Springer.
69 A. Asperti, W. Ricciotti, C. Sacerdoti Coen, E. Tassi:
70 <notice class="alpha">Formal metatheory of programming languages in the Matita interactive theorem prover</notice>
71 (2012). In Journal of Automated Reasoning, 49(3), pp. 427-451. Springer.
76 <notice class="alpha">Consistency of the minimalist foundation with Church thesis and Bar Induction</notice>
77 (2012). Submitted article.
82 <notice class="alpha">Theoretical and implementation aspects in the mechanization of the metatheory of programming languages</notice>
83 (July 2011). Ph.D. Thesis in Computer Science, Technical Report UBLCS-2011-09, University of Bologna.
88 <notice class="alpha">Faithful Reproductions of the Automath Landau Formalization</notice>
89 (2011). Technical report.
94 <notice class="alpha">A minimalist two-level foundation for constructive mathematics</notice>
95 (2009). In Annals of Pure and Applied Logic, 160(3), pp. 319-354. Elsevier.
100 <notice class="alpha">First Year Report: Realisability methods of proof and semantics with application to expansion</notice>
101 (July 2007). Technical report.
104 <!-- ===================================================================== -->
106 <section9 name="disclaimer">Disclaimer</section9>
108 The systems of the λδ family <notice class="alpha" text="are not"/> related intentionally to
109 any other system having (variations of) the symbols λ and δ in its name or syntax.
110 Examples include (but are not limited to):
114 <notice class="alpha">λ-δ</notice> of
116 <notice class="alpha">The calculi of lambda-conversion</notice>
118 Annals of Mathematics Studies 6.
119 Princeton University Press.
123 <notice class="alpha">∆Λ</notice> of
125 <notice class="alpha">Generalizing Automath by means of a lambda-typed lambda calculus</notice>
127 In Lecture Notes in Pure and Applied Mathematics 106, pp. 71-92.
132 <notice class="alpha">λ<sub>∆</sub></notice> of
133 N.J. Rehof, M.H. Sørensen:
134 <notice class="alpha">The λ<sub>∆</sub>-calculus</notice>
136 In Lecture Notes in Computer Science, 789, pp. 516–542.
141 <notice class="alpha">λ∆</notice> of
142 S. Ronchi Della Rocca, L. Paolini:
143 <notice class="alpha">The Parametric Lambda Calculus</notice>
145 Texts in Theoretical Computer Science, An EATCS Series.
150 <notice class="alpha">λD</notice> of
151 R. Nederpelt, H. Geuvers:
152 <notice class="alpha">Type Theory and Formal Proof</notice>
154 Cambridge University Press.
158 <notice class="alpha">Cλξ</notice> of
160 <notice class="alpha">A namefree lambda calculus with facilities for internal definition of expressions and segments</notice>
163 Eindhoven University of Technology, Eindhoven.
168 Moreover, the systems of the λδ family <notice class="alpha" text="are not"/> related intentionally to
169 <link to="http://umineko.wikia.com/wiki/Lambdadelta">Lady Lambdadelta</link>,
170 the Witch of Certainty of the sound novel
171 <link to="https://it.wikipedia.org/wiki/Umineko_no_naku_koro_ni">Umineko no Naku Koro ni</link>.