<page xmlns="http://lambdadelta.info/"
description = "\lambda\delta home page"
title = "\lambda\delta home page"
- head = "The Formal System λδ (\lambda\delta)"
+ head = "The Formal Systems of the λδ (\lambda\delta) Family"
>
<sitemap name="sitemap"/>
<section9 name="foreword">Foreword</section9>
<body>
- The formal system λδ (\lambda\delta) is a typed λ-calculus aiming to support
+ The formal systems of the λδ (\lambda\delta) family are typed λ-calculi aiming to support
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
+ The λδ family is developed within 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 previous informal material.
+ as a set of machine-checked digital specifications.
</body>
<body>
- This is the System logo: <rlink to="images/crux_177.png">crux_177.png</rlink>
- (revised <notice class="alpha" notice="2012-09"/>).
+ This is the family logo: <rlink to="images/crux_177.png">crux_177.png</rlink>
+ (revised <notice class="alpha" text="2012-09"/>).
</body>
<body>
- <notice class="alpha" notice="Notice for the user of Internet Explorer."/>
+ <notice class="alpha" text="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).
<section9 name="citations">Citations</section9>
<body>
- This is a list of publications citing λδ (not including our own).
+ This is a list of publications citing λδ documentation.
</body>
+ <topitem name="C7">
+ C. Dunchev, F. Guidi, C. Sacerdoti Coen, E. Tassi:
+ <notice class="alpha">ELPI: Fast, Embeddable, λProlog Interpreter</notice>
+ (2015). In proc. of LPAR 20. Lecture Notes in Computer Science, 9450, pp. 460-468. Springer.
+ </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.
+ <notice class="alpha">Formal metatheory of programming languages in the Matita interactive theorem prover</notice>
+ (2012). In Journal of Automated Reasoning, 49(3), pp. 427-451. Springer.
</topitem>
<topitem name="C5">
M.E. Maietti:
- <notice class="alpha" notice="Consistency of the minimalist foundation with Church thesis and Bar Induction"/>
+ <notice class="alpha">Consistency of the minimalist foundation with Church thesis and Bar Induction</notice>
(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"/>
+ <notice class="alpha">Theoretical and implementation aspects in the mechanization of the metatheory of programming languages</notice>
(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). Typescript note.
+ <notice class="alpha">Faithful Reproductions of the Automath Landau Formalization</notice>
+ (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.
+ <notice class="alpha">A minimalist two-level foundation for constructive mathematics</notice>
+ (2009). In Annals of Pure and Applied Logic, 160(3), pp. 319-354. Elsevier.
</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). Typescript note.
+ <notice class="alpha">First Year Report: Realisability methods of proof and semantics with application to expansion</notice>
+ (July 2007). Technical report.
+ </topitem>
+
+<!-- ===================================================================== -->
+
+ <section9 name="disclaimer">Disclaimer</section9>
+ <body>
+ The systens of the λδ family <notice class="alpha" text="are not"/> related intentionally to any other system
+ having (variations of) the symbols λ and δ in its name or syntax.
+ Examples include (but are not limited to):
+ </body>
+
+ <topitem name="D1">
+ <notice class="alpha">λ-δ</notice> of
+ A. Church:
+ <notice class="alpha">The calculi of lambda-conversion</notice>
+ (1941).
+ Annals of Mathematics Studies 6.
+ Princeton University Press.
+ </topitem>
+
+ <topitem name="D2">
+ <notice class="alpha">∆Λ</notice> of
+ N.G. de Bruijn:
+ <notice class="alpha">Generalizing Automath by means of a lambda-typed lambda calculus</notice>
+ (1987).
+ In Lecture Notes in Pure and Applied Mathematics 106, pp. 71-92.
+ Marcel Dekker.
+ </topitem>
+
+ <topitem name="D3">
+ <notice class="alpha">λ<sub>∆</sub></notice> of
+ N.J. Rehof, M.H. Sørensen:
+ <notice class="alpha">The λ<sub>∆</sub>-calculus</notice>
+ (1994).
+ In Lecture Notes in Computer Science, 789, pp. 516–542.
+ Springer.
+ </topitem>
+
+ <topitem name="D4">
+ <notice class="alpha">λ∆</notice> of
+ S. Ronchi Della Rocca, L. Paolini:
+ <notice class="alpha">The Parametric Lambda Calculus</notice>
+ (2004).
+ Texts in Theoretical Computer Science, An EATCS Series.
+ Springer.
+ </topitem>
+
+ <topitem name="D5">
+ <notice class="alpha">λD</notice> of
+ R. Nederpelt, H. Geuvers:
+ <notice class="alpha">Type Theory and Formal Proof</notice>
+ (2014).
+ Cambridge University Press.
+ </topitem>
+
+ <topitem name="D6">
+ <notice class="alpha">Cλξ</notice> of
+ N.G. de Bruijn:
+ <notice class="alpha">A namefree lambda calculus with facilities for internal definition of expressions and segments</notice>
+ (1978).
+ TH-report 78-WSK-03.
+ Eindhoven University of Technology, Eindhoven.
</topitem>
<footer/>
projects / helm.git / blobdiff