<page xmlns="http://lambdadelta.info/"
description = "\lambda\delta home page"
title = "\lambda\delta home page"
+ logo = "crux"
head = "The Formal Systems of the λδ (\lambda\delta) Family"
>
<sitemap name="sitemap"/>
</body>
<body>
This is the family logo: <rlink to="images/crux_177.png">crux_177.png</rlink>
- (revised <notice class="alpha" notice="2012-09"/>).
+ (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).
<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.
+ <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"/>
+ <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"/>
+ <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 <span class="emph">are not</span> related intentionally to any other system
- having (variations of) the symbols λ and δ in its name or syntax.
+ 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">
- <span class="emph">λ-δ</span> of
+ <notice class="alpha">λ-δ</notice> of
A. Church:
- <span class="emph">The calculi of lambda-conversion</span>
+ <notice class="alpha">The calculi of lambda-conversion</notice>
(1941).
Annals of Mathematics Studies 6.
Princeton University Press.
</topitem>
<topitem name="D2">
- <span class="emph">∆Λ</span> of
+ <notice class="alpha">∆Λ</notice> of
N.G. de Bruijn:
- <span class="emph">Generalizing Automath by means of a lambda-typed lambda calculus</span>
+ <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">
- <span class="emph">λ<sub>∆</sub></span> of
+ <notice class="alpha">λ<sub>∆</sub></notice> of
N.J. Rehof, M.H. Sørensen:
- <span class="emph">The λ<sub>∆</sub>-calculus</span>
+ <notice class="alpha">The λ<sub>∆</sub>-calculus</notice>
(1994).
In Lecture Notes in Computer Science, 789, pp. 516–542.
Springer.
</topitem>
<topitem name="D4">
- <span class="emph alpha">λ∆</span> of
+ <notice class="alpha">λ∆</notice> of
S. Ronchi Della Rocca, L. Paolini:
- <span class="emph">The Parametric Lambda Calculus</span>
+ <notice class="alpha">The Parametric Lambda Calculus</notice>
(2004).
Texts in Theoretical Computer Science, An EATCS Series.
Springer.
</topitem>
<topitem name="D5">
- <span class="emph">λD</span> of
+ <notice class="alpha">λD</notice> of
R. Nederpelt, H. Geuvers:
- <span class="emph">Type Theory and Formal Proof</span>
+ <notice class="alpha">Type Theory and Formal Proof</notice>
(2014).
Cambridge University Press.
</topitem>
<topitem name="D6">
- <span class="emph">Cλξ</span> of
+ <notice class="alpha">Cλξ</notice> of
N.G. de Bruijn:
- <span class="emph">A namefree lambda calculus with facilities for internal definition of expressions and segments</span>
+ <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>
+ <body>
+ <img logo="smile"/>
+ Moreover, the systens of the λδ family <notice class="alpha" text="are not"/> related intentionally to
+ <link to="http://umineko.wikia.com/wiki/Lambdadelta">Lady Lambdadelta</link>,
+ the Witch of Certainty of the sound novel
+ <link to="https://it.wikipedia.org/wiki/Umineko_no_naku_koro_ni">Umineko no Naku Koro ni</link>.
+ </body>
+
<footer/>
</page>
projects / helm.git / blobdiff