Origin in Mathematical Logic
|
|
- Bernice Carpenter
- 5 years ago
- Views:
Transcription
1 Lambda Calculus
2 Origin in Mathematical Logic Foundation of mathematics was very much an issue in the early decades of 20th century. Cantor, Frege, Russel s Paradox, Principia Mathematica, NBG/ZF The Combinatory Logic and the λ-calculus were originally proposed as part of foundational systems, which is based on a concept of function rather than a concept of set.
3 Combinatory Logic Schönfinkel [4Sep , Russian] proposed Combinatory Logic as a variable free presentation of functions [1924]. von Neumann [28Dec Feb.1957] used a combinatory notation in his formulation of set theory. Curry [12Sep Sep.1982] reinvented Combinatory Logic in an effort to formalize the notion of substitution.
4 Lambda Calculus Alonzo Church [14Jun Aug.1995] invented the λ-calculus with a foundational motivation [1932]. The ambition to provide a foundation for mathematics failed after the discovery of Kleene-Rosser Paradox in the logic part of Church s theory. As a foundation for computation and programming, the functional part of Church s theory has been extremely rich and very successful.
5 CL/λ was proposed to describe the basic properties of function abstraction, application, substitution. In λ abstraction and substitution are taken as primitive concept. In CL they are defined in terms of more primitive operators.
6 I. Syntax and Semantics
7 Lambda Calculus is a functional model of computation.
8 Syntax Grammar for λ-term: M := x λx.m M M, where x is a variable, λx.m is an abstraction term, and M M is an application term. λx 1.λx 2... λx k.m is often abbreviated to λx 1 x 2... x k.m or λ x.m, M M to MM, and (... ((MM 1 )M 2 )... M k 1 )M k to MM 1 M 2... M K. Let be the syntactic (grammar) equality.
9 Operational Semantics Structural Semantics: (λx.m)n M{N/x}, β reduction MN M N, if M M, structural rule MN MN, if N N, eager evaluation λx.m λx.m, if M M, partial evaluation. Let be the reflexive and transitive closure of. The conversion relation = is the equivalence closure of.
10 Bound Variable, Closed Term The variable x in λx.m is bound. (α-conversion) A variable in a term is free if it is not bound. (notation fv(m)) A λ-term is closed if it contains no free variables. Λ: the set of λ-terms; Λ 0 : the set of closed λ-terms.
11 Redex The following reductions make use of α-conversion: (λxy.yxx)((λuv.v)y) λz.z((λuv.v)y)((λuv.v)y) λz.z(λv.v)((λuv.v)y) λz.z(λv.v)(λv.v). An alternative evaluation strategy: (λxy.yxx)((λuv.v)y) (λxy.yxx)(λv.v) λy.y(λv.v)(λv.v). A subterm of the form (λx.m)n is called a redex, and M{N/x} a reduct of the reduction that contracts the redex.
12 λ-term as Proof A combinator is a closed λ-term. Some famous combinators are: I K S def = λx.x, def = λxy.x, def = λxyz.xz(yz). It is easy to see that I = SKK. Logical interpretation of I, K, S. Theorem. M Λ 0. L {K, S} +.L M. Proof. This will be an easy consequence of the translations between λ-calculus and Combinatory Logic.
13 A Term that Generates All Let X be λz.zksk. Then K = XXX and S = X(XX). Corollary. M Λ 0. L {X} +.L = M.
14 Normal Form Let Ω be (λx.xx)(λx.xx). Then Ω Ω Ω... This is the simplest divergent λ-term. A λ-term M is in normal form if M M for no M. We will show that the normal form of a term is unique.
15 Fixpoint Lemma. F. X.FX = X. Proof. Define the fixpoint combinator Y by Y def = λf.(λx.f (xx))(λx.f (xx)). It is easily seen that F (YF ) = YF. However it is not the case that YF F (YF ).
16 Fixpoint The Turing fixpoint Θ is defined by AA, where A def = λxy.y(xxy). Clearly ΘF F (ΘF ).
17 Fixpoint Suppose we need to find some F such that Fxy = FyxF. The equality follows from F = λxy.fyxf. So we may let F be a fixpoint of λf.fyxf.
18 Gödel s Fixpoint Construction Let PA be the first order Peano Arithmetic. We write PA ϕ if ϕ is provable in PA. Every syntactic object s of PA can be coded up by a numeral s s in PA, where s is the Gödel number of s. Theorem. Let ψ(x) be a formula of PA with free variable x. Then there is a sentence ϕ of PA such that PA ϕ ψ( ϕ ).
19 Gödel s Fixpoint Construction Write n 1 n 2 if there are sentences φ 1, φ 2 of PA such that n 1 = φ 1, n 2 = φ 2 and PA φ 1 = φ 2. We only have to show that n.n ψ( n ). Let, be a pairing function with de-pairing functions ( ) 0, ( ) 1. Let ( ).( ) be the primitive recursive function such that Let λx.n denote x, n. Then n.m (n) 1 { m / (n) 0 }. (λx. ψ(x)).m = ψ( m ). Let ( ) ( ) be a representation of ( ).( ) in the sense that PA n m = n.m.
20 Gödel s Fixpoint Construction Now let v = λx. ψ(x x) and n = v.v. We have n = (λx. ψ(x x)).v = ψ( v v ) ψ( v.v ) = ψ( n ). We are done by letting n be ϕ.
21 II. Church-Rosser Property
22 Church-Rosser Theorem Although the reduction is nondeterministic, it has the following confluence (diamond, Church-Rosser) property: If M M and M M, then some M exists such that M M and M M. In other words the result of evaluating a λ-term is unique.
23 Proof of Church-Rosser Theorem Define the reduction inductively as follows: (i) M M; (ii) if M M then λx.m λx.m ; (iii) if M M and N N then MN M N ; (iv) if M M and N N then (λx.m)n M {N /x}. Fact. If M M and N N then M{N/x} M {N /x}. Fact. satisfies the confluence property. Fact. is the transitive closure of.
24 Implication of Church-Rosser Theorem Fact. If M = N then M Z and N Z for some Z. Fact. If N is a nf of M then M N. Fact. Every λ-term has at most one nf. Fact. If M, N are distinct nf s, then M N. Theorem. The theory λ is consistent.
25 III. Combinatory Logic
26 In Curry s Combinatory Logic (CL) abstraction and substitution are replaced by even more primitive operations.
27 Syntax Grammar for combinatory term: P := x K S PP, where x is a variable, K, S are constant terms, and PP is an application term. C: the set of combinatory terms. C 0 : the set of closed combinatory terms.
28 Operational Semantics Structural Semantics: KPQ w P, SPQR w (PR)(QR). The relation w is called weak reduction. w : the reflexive and transitive closure of w. = w : the equivalence closure of w.
29 Diamond Property Theorem. The relation w satisfies the Church-Rosser property. Proof. Let = be the disjoint parallel weak reduction. It is easy to show that = satisfies the Church-Rosser property. We are done by observing that w is the transitive closure of =. Corollary. CL is consistent.
30 Translation from CL to λ Translation from CL to λ: (x) λ x, (K) λ λxy.x, (S) λ λxyz.xz(yz), (PQ) λ (P) λ (Q) λ. Fact. If P = w Q then (P) λ = (Q) λ. The converse is not true. For example λ SK = KI, but CL SK = KI. This is why w is called weak reduction.
31 Translation from λ to CL The operator λ x. is defined inductively as follows: λ x.x SKK, λ x.r KR, if R {K, S} or R is a variable x, λ x.pq S(λ x.p)(λ x.q). Fact. (λ x.p)q = w P{Q/x}. Translation from λ to CL: (x) CL x, (MN) CL (M) CL (N) CL, (λx.m) CL λ x.(m) CL. Fact. ((M) CL ) λ M.
32 Making CL the Same as λ Curry has showed that the β-conversion of the λ coincides with the weak conversion of CL if the latter is extended with five conversion axioms, one of which being S(K(S(KS)))(S(KS)(S(KS))) = S(S(KS)(S(KK)(S(KS)(S(K(S(KS)))S))))(KS). We will not go into that for the obvious reason.
33 IV. Solvability
34 1. Given λ-term M, are there λ-terms N 1,..., N n such that MN 1... N n = I? 2. Given λ-terms M and P, are there λ-terms N 1,..., N n such that MN 1... N n = P? 3. Given λ-term M, are there λ-terms N 1,..., N n such that MN 1... N n = N for some nf N?
35 Definition Suppose M Λ 0. We say that M is solvable if n. N 1,..., N n.mn 1... N n = I. M is unsolvable otherwise. M is (un)solvable if its closure λ x.m is (un)solvable.
36 Definition Y is solvable since Y(KI) = I. Ω is unsolvable. λ x.ym 1... M k is solvable.
37 Simple Property of Solvability Fact. λx.m is solvable iff M is solvable. Fact. If MN is solvable then M is solvable. Fact. If M{N/x} is solvable then M is solvable.
38 Head Normal Form A λ-term is either of the head normal form, hnf for short, λx 1... λx m.xm 1... M n, where x is called head variable, or of the form λx 1... λx m.(λx.m 0 )M 1... M n, where (λx.m 0 )M 1 is called head redex. M has head normal form if M = N for some head normal form N.
39 Head Reduction A reduction M N is a head reduction, notation M h N, if it is obtained by contracting the head redex. The reflexive and transitive closure of h is denoted by h. Notice that a λ-term has a unique head reduction path. We say that a head reduction path terminates if it reaches a hnf. Theorem. (Wadsworth, 1971) M has a hnf iff the head reduction path of M terminates. Proof. An immediate corollary of Curry s Standardization Theorem.
40 Wadsworth Theorem Theorem. (Wadsworth, 1971) M is solvable iff M has a hnf. Proof. If MÑ = I, then MÑ has a hnf. So M has a hnf. The converse implication holds by noticing that λ x.z M is solvable.
41 Remark Computationally hnf s make more sense than nf s. Denotationally it is difficult to distinguish nf s from those hnf s that are not nf s.
42 V. Completeness
43 Church Numeral Church introduced the following encoding of numbers: c n def = λfx.f n (x). Rosser defined the following arithmetic operations: A + A A exp def = λxypq.xp(ypq), def = λxyz.x(yz), def = λxy.yx.
44 Boolean Term The Boolean values are encoded by: true false def = λxy.x, def = λxy.y. The term if B then M else N is represented by BMN.
45 Pairing The pairing and projections can be defined as follows: [M, N] π 0 π 1 def = λz.if z then M else N, def = λz.z true, def = λz.z false.
46 Barendregt Numeral Barendregt introduced the following encoding of natural numbers: 0 n + 1 def = I, def = [false, n ]. We call the normal forms 0, 1, 2,... numerals. The successor, predecessor and test-for-zero can be defined by S + P Zero def = λz.[false, z], def = λz.z false, def = λz.z true.
47 Lambda Definability A k-ary function f is λ-definable if there is a combinator F such that for all numbers n 1,..., n k one has the following terminating head reduction path F n 1... n k h f (n 1,..., n k ) if f (n 1,..., n k ) is defined, and the following divergent head reduction path if f (n 1,..., n k ) is undefined. F n 1... n k h h h h...
48 Numerals are Solvable Fact. n. n KII h I.
49 Definability of Initial Function The zero function, successor function and projection functions are λ-defined respectively by Z S + U k i def = λx 1... x k. 0, def = λx.[false, x], def = λx 1... x k.x i. These terms admit only head reduction.
50 Definability of Composition Suppose f, g 1 ( x),..., g k ( x) are λ-defined by F, G 1,..., G k. Then f (g 1 ( x),..., g k ( x)) is λ-defined by λ x.(g 1 xkii)... (G k xkii)f (G 1 x)... (G k x).
51 Definability of Recursion Consider the function f defined by the recursion: f ( x, 0) = h( x), f ( x, y + 1) = g( x, y, f ( x, y)). Suppose h, g are λ-defined by H, G respectively. Intuitively f is λ-defined by F such that F h λ xy.if Zero(y) then H x else G x(p y)(f x(p y)). By the Fixpoint Theorem we may define F by Θ ( λf.λ xy.if Zero(y) then H x else G x(p y)(f x(p y)) ).
52 Definability of Minimization Let µ P be defined as follows: µ P def = Θ(λhz.if Pz then z else h[false, z]). If P n h false for all n, then µ P 0 h if P 0 then 0 else µ P 1 h h h µ P 1 if P 1 then 1 else µ P 2 µ P 2 h..., and consequently µ P 0 is unsolvable.
53 Definability of Minimization Suppose g( x, z) is a total recursive function and f ( x) is define by µz.(g( x, z) = 0). Assume that g is λ-defined by G. Then f is λ-defined by F def = λ x.µ λz.zero(g xz) 0.
54 Kleene Theorem Theorem [Kleene, 1936]. A partial function is computable iff it is λ-definable. Proof. Suppose a k-ary function is λ-defined by F. Then the graph set {(n 1,..., n k, m) F n 1... n k = m } is recursive enumerable.
55 VI. Finite Development
56 Relationship between two Redexes Suppose 0 = (λx 0.P 0 )Q 0 and 1 = (λx 1.P 1 )Q 1 are two redexes in a λ-term. Their relationship can be summarized as follows: 0, 1 are disjoint; 0, 1 coincide; 0 is inside P 1 ; 0 is inside Q 1 ; 1 is inside P 0 ; 1 is inside Q 0. Let M 0 M 0 be the reduction by contracting the redex 0. In the reduction the redex 1 may be unaffected, modified, eliminated, duplicated or even contracted. Lemma. is weakly Church-Rosser.
57 Residual Let be a redex in M. The residuals of after a sequence of reductions M M are what has turned into in M. Let (λa.a(ix))(xb). Consider the following reduction: (λx.xx)a aa, (λx.xx), (λx.y) y, (λx.x) (λx.x)(xb(ix)), (λx. )P (λa.a(ip))(pb), (λa.ax)(xb). It is important to make explicit the contracting redex. See Lévy s example: I(Ix) Ix.
58 Indexing Reduction An indexed λ-term has some of its λ indexed by natural numbers. Example: (λ 0 x.λy.x((λz 1.zz)K)y)I. Write M idx N if M N for some indexed redex.
59 Contracting Indexed Redexes Let M be an indexed λ-term. The λ-term M is obtained from M by removing all indexes in M. The operation r( ), defined on the indexed λ-terms, is structurally defined as follows: r(x) x; r(pq) r(p)r(q) if P is not an indexed abstraction; r(λx.p) λx.r(p); r(λ i x.pq) r(p){r(q)/x}. Lemma. Suppose M is an indexed λ-term. Then M r(m).
60 Strip Lemma Lemma. If M M 1 and M N, then M 1 N 1 and N N 1 for some N 1.
61 The Second Proof of Church-Rosser Theorem Corollary. The relation satisfies the diamond property.
62 We now generalize the idea used in the proof of Strip Lemma. The central idea is that idx is strongly normalizing. Divergence is caused by continuous creation of new redexes.
63 Notation for Residual Let F be a finite set of redex occurrences in M, denoted by F M. The notation (M, F) stands for the indexed λ-term obtained by indexing the redex occurrences prescribed in F by 0. Write (M, F) (N, F ) for the obvious lifting of σ : M N. We call F the residual of F relative to σ, denoted by F/σ = F.
64 Development Suppose F M. A development of (M, F) is a reduction path σ : M M M0... such that each redex i M i is the residual of a redex of F relative to i 1. σ : M N is a complete development of (M, F), notation σ : (M, F) cpl N, if σ is a development of (M, F) and F/σ =. A development of M is a development of (M, F M ), where F M is the set of all redex occurrences in M. M dev N iff N occurs in some development of M.
65 Weighted λ-term A weighted λ-term M is a pair (M, I ) where M is an indexed λ-term and I is a weighting function that assigns a positive integer to each variable occurrence in M. Let M be a weighted λ-term and N M. Define N to be the sum of weights occurring in N. A weighting is decreasing if for every indexed redex (λ i x.p)q in M one has x > Q for every occurrence of x in P. Example: (λ i x.x 6 x 7 )(λx.x 2 x 3 ) and (λ i x.x 4 x 7 )(λx.x 2 x 3 ). Fact. Every indexed λ-term has a decreasing weighting.
66 Weighted λ-term Lemma. Let M (M, I ) be a weighted λ-term with decreasing weighting I. Suppose M idx N (N, I ). Then and I is a decreasing weighting. M > N
67 Indexed Reduction is Strongly Normalizing Proposition. idx is strongly normalizing. Proof. Suppose M 0 idx M 1 idx M 2 idx... idx M n. Let I 0 be a decreasing weighting for M 0. Then (M 0, I 0 ) idx (M 1, I 1 ) idx (M 2, I 2 ) idx... idx (M n, I n ) such that (M 0, I 0 ) > (M 1, I 1 ) > (M 2, I 2 ) >... > (M n, I n ).
68 Finiteness of Development Theorem. Suppose F M. All developments of (M, F) are finite. Corollary. Every development of (M, F) can be extended to a complete one. Corollary. idx is weakly Church-Rosser. Corollary. idx is Church-Rosser. Proof. Use Newman Lemma [WCR SN CR].
69 Finite Development Theorem Theorem. Suppose F M. All developments of (M, F) are finite. Every development of (M, F) can be extended to a complete development of (M, F). All developments of (M, F) end with the same λ-term.
70 The Third Proof of Church-Rosser Property Suppose M is an indexed λ-term. Cpl(M) denotes the unique normal form with respect to the indexed reduction. A reduction M N is a complete reduction, notation M l N, if N Cpl(M, F) for some F M. Suppose R R. Then (λx.xx)r l RR, (λx.xx)r l R R, (λx.xx)r l (λx.xx)r, but not (λx.xx)r l RR. Lemma. l satisfies the diamond property. So is Church-Rosser since it is the transitive closure of l.
71 We have seen that it is often beneficial to adopt some reduction strategy (head reduction, indexed reduction, complete reduction). We take a look at another reduction strategy that can be economically implemented.
72 Standard Reduction A reduction M M1 2 M2... is standard if i is not a residual of some redex to the left of j for any j < i. Write M s N if there is some standard reduction from M to N. Example: λa.(λb.(λc.c)bb)d.
73 Internal Reduction An internal redex is a redex that is not a head redex. A one-step internal reduction M i N is a reduction M N in which the contracted redex is an internal redex. Write M l,i N if M i N that is at the same time a complete reduction. I(Ix) and Ix are internal redexes of M λx.(λz.zz)(i(ix))). Now M i (λz.zz)(ix), M l,i (λz.zz)x, M h λx.(i(ix)))(i(ix))), M h λx.(i(ix))), M l λx.xx.
74 Decomposition of Complete Reduction Lemma. If M l N then M h l,i N. Proof. By Finite Development Theorem, we can contract all the head redexes first and then all the internal redexes. This is possible because head reduction and internal reduction do not interfere with each other. The latter reduction is also a complete reduction.
75 Internal Reduction Commutes with Head Reduction Lemma. If M i h N then M h i N. Proof. Suppose M l,i h N. Then by Finite Development Theorem M h i N. By the above decomposition lemma, one has that M h i N. We are done by a simple diagram chase.
76 Decomposition of Reduction Lemma. If M N then M h i N. Proof. An interleaving of head and internal reductions can be reordered using the previous lemma.
77 Standardization Theorem Theorem (Curry and Feys, 1958). If M N then M s N. Proof. The proof is carried out by induction on the size of N. By the previous lemma, M h Z i N for some Z. 1. If N is a variable, then Z must be the same variable. 2. If N λ x.n 1... N k then Z λ x.z 1... Z k such that Z j s N j by induction.
78 An Application of Standardization Theorem Corollary M has hnf iff its head reduction terminates. Proof. Suppose M = λ x.y M. By Church-Rosser Theorem and Standardization Theorem, M s λ x.yñ for some Ñ. The point is that before an internal redex is contracted, the head reduction has already reached a hnf.
79 Reference H. Barendregt, The Lambda Calculus: Its Syntax and Semantics. Volume 103 of Studies in Logic and Foundations of Mathematics, North-Holland. F. Cardone and J. Hindley, Lambda Calculus and Combinators in 20th Century. Handbook of the History of Logic (D. Gabbay and J. Woods eds.), Volume 5: Logic from Russel to Church, , Elsevier.
Origin in Mathematical Logic
Lambda Calculus Origin in Mathematical Logic Foundation of mathematics was very much an issue in the early decades of 20th century. Cantor, Frege, Russel s Paradox, Principia Mathematica, NBG/ZF Origin
More informationLambda Calculus. Yuxi Fu. 31 May, 2013
Lambda Calculus Yuxi Fu 31 May, 2013 Origin in Mathematical Logic Foundation of mathematics was very much an issue in the early decades of 20th century. Cantor, Frege, Russel s Paradox, Principia Mathematica,
More informationLambda-Calculus (I) 2nd Asian-Pacific Summer School on Formal Methods Tsinghua University, August 23, 2010
Lambda-Calculus (I) jean-jacques.levy@inria.fr 2nd Asian-Pacific Summer School on Formal Methods Tsinghua University, August 23, 2010 Plan computation models lambda-notation bound variables conversion
More informationLambda Calculus. Andrés Sicard-Ramírez. Semester Universidad EAFIT
Lambda Calculus Andrés Sicard-Ramírez Universidad EAFIT Semester 2010-2 Bibliography Textbook: Hindley, J. R. and Seldin, J. (2008). Lambda-Calculus and Combinators. An Introduction. Cambridge University
More informationCombinators & Lambda Calculus
Combinators & Lambda Calculus Abstracting 1/16 three apples plus two pears = five fruits concrete 3+2 = 5 abstract objects a+b = b+a a (b c) = (a b) c abstract quantities abstract operations a, b[r(a,
More informationThe Lambda-Calculus Reduction System
2 The Lambda-Calculus Reduction System 2.1 Reduction Systems In this section we present basic notions on reduction systems. For a more detailed study see [Klop, 1992, Dershowitz and Jouannaud, 1990]. Definition
More informationModels of computation
Lambda-Calculus (I) jean-jacques.levy@inria.fr 2nd Asian-Pacific Summer School on Formal ethods Tsinghua University, August 23, 2010 Plan computation models lambda-notation bound variables odels of computation
More informationsummer school Logic and Computation Goettingen, July 24-30, 2016
Università degli Studi di Torino summer school Logic and Computation Goettingen, July 24-30, 2016 A bit of history Alonzo Church (1936) The as formal account of computation. Proof of the undecidability
More informationIntroduction to λ-calculus
p.1/65 Introduction to λ-calculus Ken-etsu FUJITA fujita@cs.gunma-u.ac.jp http://www.comp.cs.gunma-u.ac.jp/ fujita/ Department of Computer Science Gunma University :Church 32, 36, 40; Curry 34 1. Universal
More informationMathematical Logic IV
1 Introduction Mathematical Logic IV The Lambda Calculus; by H.P. Barendregt(1984) Part One: Chapters 1-5 The λ-calculus (a theory denoted λ) is a type free theory about functions as rules, rather that
More informationLecture 2. Lambda calculus. Iztok Savnik, FAMNIT. March, 2018.
Lecture 2 Lambda calculus Iztok Savnik, FAMNIT March, 2018. 1 Literature Henk Barendregt, Erik Barendsen, Introduction to Lambda Calculus, March 2000. Lambda calculus Leibniz had as ideal the following
More informationProgramming Language Concepts: Lecture 18
Programming Language Concepts: Lecture 18 Madhavan Mukund Chennai Mathematical Institute madhavan@cmi.ac.in http://www.cmi.ac.in/~madhavan/courses/pl2009 PLC 2009, Lecture 18, 30 March 2009 One step reduction
More informationFORMAL SYSTEMS: COMBINATORY LOGIC
FORMAL SYSTEMS: COMBINATORY LOGIC AND λ-calculus Andrew R. Plummer Department of Linguistics The Ohio State University 30 Sept., 2009 OUTLINE 1 INTRODUCTION 2 APPLICATIVE SYSTEMS 3 USEFUL INFORMATION COMBINATORY
More informationAdvanced Lambda Calculus. Henk Barendregt & Giulio Manzonetto ICIS Faculty of Science Radboud University Nijmegen, The Netherlands
Advanced Lambda Calculus Henk Barendregt & Giulio Manzonetto ICIS Faculty of Science Radboud University Nijmegen, The Netherlands Form of the course Ordinary lecture Seminar form Exam: working out an exercise
More informationFunctional Programming with Coq. Yuxin Deng East China Normal University
Functional Programming with Coq Yuxin Deng East China Normal University http://basics.sjtu.edu.cn/ yuxin/ September 10, 2017 Functional Programming Y. Deng@ECNU 1 Reading materials 1. The Coq proof assistant.
More informationChurch s undecidability result
Church s undecidability result Alan Turing Birth Centennial Talk at IIT Bombay, Mumbai Joachim Breitner April 21, 2011 Welcome, and thank you for the invitation to speak about Church s lambda calculus
More informationLecture 3. Lambda calculus. Iztok Savnik, FAMNIT. October, 2015.
Lecture 3 Lambda calculus Iztok Savnik, FAMNIT October, 2015. 1 Literature Henk Barendregt, Erik Barendsen, Introduction to Lambda Calculus, March 2000. Lambda calculus Leibniz had as ideal the following
More informationSmall families. (at INRIA with Gérard and in the historical λ-calculus) Jean-Jacques Lévy
Small families (at INRIA with Gérard and in the historical λ-calculus) Jean-Jacques Lévy INRIA Rocquencourt and Microsoft Research-INRIA Joint Centre June 22, 2007 caml years coq sixty years is 31,557,600
More informationComputability via the Lambda Calculus with Patterns
Computability via the Lambda Calculus with Patterns Bodin Skulkiat (Corresponding author) Department of Mathematics, Faculty of Science Chulalongkorn University, Bangkok, Thailand Tel: 66-89-666-5804 E-mail:
More informationRewriting, Explicit Substitutions and Normalisation
Rewriting, Explicit Substitutions and Normalisation XXXVI Escola de Verão do MAT Universidade de Brasilia Part 1/3 Eduardo Bonelli LIFIA (Fac. de Informática, UNLP, Arg.) and CONICET eduardo@lifia.info.unlp.edu.ar
More information3.2 Equivalence, Evaluation and Reduction Strategies
3.2 Equivalence, Evaluation and Reduction Strategies The λ-calculus can be seen as an equational theory. More precisely, we have rules i.e., α and reductions, for proving that two terms are intensionally
More informationOn the Standardization Theorem for λβη-calculus
On the Standardization Theorem for λβη-calculus Ryo Kashima Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro, Tokyo 152-8552, Japan. e-mail: kashima@is.titech.ac.jp
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
More informationHenk Barendregt and Freek Wiedijk assisted by Andrew Polonsky. Radboud University Nijmegen. March 5, 2012
1 λ Henk Barendregt and Freek Wiedijk assisted by Andrew Polonsky Radboud University Nijmegen March 5, 2012 2 reading Femke van Raamsdonk Logical Verification Course Notes Herman Geuvers Introduction to
More informationLogic and Probability Lecture 3: Beyond Boolean Logic
Logic and Probability Lecture 3: Beyond Boolean Logic Wesley Holliday & Thomas Icard UC Berkeley & Stanford August 13, 2014 ESSLLI, Tübingen Wesley Holliday & Thomas Icard: Logic and Probability, Lecture
More informationReducibility proofs in λ-calculi with intersection types
Reducibility proofs in λ-calculi with intersection types Fairouz Kamareddine, Vincent Rahli, and J. B. Wells ULTRA group, Heriot-Watt University, http://www.macs.hw.ac.uk/ultra/ March 14, 2008 Abstract
More informationClassical Combinatory Logic
Computational Logic and Applications, CLA 05 DMTCS proc. AF, 2006, 87 96 Classical Combinatory Logic Karim Nour 1 1 LAMA - Equipe de logique, Université de Savoie, F-73376 Le Bourget du Lac, France Combinatory
More informationAn Introduction to the Lambda Calculus
An Introduction to the Lambda Calculus Mayer Goldberg February 20, 2000 1 Notation and Conventions It is surprising that despite the simplicity of its syntax, the λ-calculus hosts a large body of notation,
More informationProofs in classical logic as programs: a generalization of lambda calculus. A. Salibra. Università Ca Foscari Venezia
Proofs in classical logic as programs: a generalization of lambda calculus A. Salibra Università Ca Foscari Venezia Curry Howard correspondence, in general Direct relationship between systems of logic
More informationLazy Strong Normalization
Lazy Strong Normalization Luca Paolini 1,2 Dipartimento di Informatica Università di Torino (ITALIA) Elaine Pimentel 1,2 Departamento de Matemática Universidade Federal de Minas Gerais (BRASIL) Dipartimento
More informationAdvanced Lambda Calculus Lecture 5
Advanced Lambda Calculus Lecture 5 The fathers Alonzo Church (1903-1995) as mathematics student at Princeton University (1922 or 1924) Haskell B. Curry (1900-1982) as BA in mathematics at Harvard (1920)
More informationCompleteness Theorems and λ-calculus
Thierry Coquand Apr. 23, 2005 Content of the talk We explain how to discover some variants of Hindley s completeness theorem (1983) via analysing proof theory of impredicative systems We present some remarks
More information5. Peano arithmetic and Gödel s incompleteness theorem
5. Peano arithmetic and Gödel s incompleteness theorem In this chapter we give the proof of Gödel s incompleteness theorem, modulo technical details treated in subsequent chapters. The incompleteness theorem
More informationl-calculus and Decidability
U.U.D.M. Project Report 2017:34 l-calculus and Decidability Erik Larsson Examensarbete i matematik, 15 hp Handledare: Vera Koponen Examinator: Jörgen Östensson Augusti 2017 Department of Mathematics Uppsala
More informationOn Upper Bounds on the Church-Rosser Theorem
On Upper Bounds on the Church-Rosser Theorem Ken-etsu Fujita Department of Computer Science Gunma University Kiryu, Japan fujita@cs.gunma-u.ac.jp The Church-Rosser theorem in the type-free λ-calculus is
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationCategories, Proofs and Programs
Categories, Proofs and Programs Samson Abramsky and Nikos Tzevelekos Lecture 4: Curry-Howard Correspondence and Cartesian Closed Categories In A Nutshell Logic Computation 555555555555555555 5 Categories
More informationProgramming Language Concepts: Lecture 16
Programming Language Concepts: Lecture 16 Madhavan Mukund Chennai Mathematical Institute madhavan@cmi.ac.in http://www.cmi.ac.in/~madhavan/courses/pl2009 PLC 2009, Lecture 16, 23 March 2009 λ-calculus:
More informationLecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem. Michael Beeson
Lecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem Michael Beeson The hypotheses needed to prove incompleteness The question immediate arises whether the incompleteness
More informationRealisability methods of proof and semantics with application to expansion
Realisability methods of proof and semantics with application to expansion First Year Examination Supervisors : Professor Fairouz Kamareddine and Doctor Joe B. Wells Student : Vincent Rahli ULTRA group,
More informationLambda Calculus with Types. Henk Barendregt ICIS Radboud University Nijmegen The Netherlands
Lambda Calculus with Types Henk Barendregt ICIS Radboud University Nijmegen The Netherlands New book Cambridge University Press / ASL Perspectives in Logic, 2011 Lambda Calculus with Types (698 pp) Authors:
More informationλ Slide 1 Content Exercises from last time λ-calculus COMP 4161 NICTA Advanced Course Advanced Topics in Software Verification
Content COMP 4161 NICTA Advanced Course Advanced Topics in Software Verification Toby Murray, June Andronick, Gerwin Klein λ Slide 1 Intro & motivation, getting started [1] Foundations & Principles Lambda
More informationParadox Machines. Christian Skalka The University of Vermont
Paradox Machines Christian Skalka The University of Vermont Source of Mathematics Where do the laws of mathematics come from? The set of known mathematical laws has evolved over time (has a history), due
More informationCharles Wells 1. February 25, 1999
NOTES ON THE λ-calculus Charles Wells 1 February 25, 1999 Department of Mathematics Case Western Reserve University 10900 Euclid Ave. Cleveland, OH 44106-7058 USA charles@freude.com http://www.cwru.edu/artsci/math/wells/home.html
More informationVictoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY
Gödel s Proof Victoria Gitman and Thomas Johnstone New York City College of Technology, CUNY vgitman@nylogic.org http://websupport1.citytech.cuny.edu/faculty/vgitman tjohnstone@citytech.cuny.edu March
More informationTraditional and Non Traditional lambda calculi
Strategies July 2009 Strategies Syntax Semantics Manipulating Expressions Variables and substitutions Free and bound variables Subterms and substitution Grafting and substitution Ordered list of variables
More informationarxiv: v1 [cs.lo] 29 May 2014
An Introduction to the Clocked Lambda Calculus Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, and Andrew Polonsky VU University Amsterdam, The Netherlands Abstract We give a brief introduction to the
More informationIntersection and Singleton Type Assignment Characterizing Finite Böhm-Trees
Information and Computation 178, 1 11 (2002) doi:101006/inco20022907 Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees Toshihiko Kurata 1 Department of Mathematics, Tokyo Metropolitan
More informationTYPED LAMBDA CALCULI. Andrzej S. Murawski University of λeicester.
TYPED LAMBDA CALCULI Andrzej S. Murawski University of λeicester http://www.cs.le.ac.uk/people/amurawski/mgs2011-tlc.pdf THE COURSE The aim of the course is to provide an introduction to the lambda calculus
More informationSemantics with Intersection Types
Semantics with Intersection Types Steffen van Bakel Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen s Gate, London SW7 2BZ, U.K., E-mail: svb@doc.ic.ac.uk (Sections
More informationIntroduction to dependent type theory. CIRM, May 30
CIRM, May 30 Goals of this presentation Some history and motivations Notations used in type theory Main goal: the statement of main properties of equality type and the univalence axiom First talk P ropositions
More informationGraph lambda theories
Under consideration for publication in Math. Struct. in Comp. Science Graph lambda theories A N T O N I O B U C C I A R E L L I 1 and A N T O N I N O S A L I B R A 2 1 Equipe PPS (case 7014), Université
More informationComputational Soundness of a Call by Name Calculus of Recursively-scoped Records. UMM Working Papers Series, Volume 2, Num. 3.
Computational Soundness of a Call by Name Calculus of Recursively-scoped Records. UMM Working Papers Series, Volume 2, Num. 3. Elena Machkasova Contents 1 Introduction and Related Work 1 1.1 Introduction..............................
More informationn-dimensional Boolean algebras
n-dimensional Boolean algebras Antonio Bucciarelli IRIF, Univ Paris Diderot joint work with Antonio Ledda, Francesco Paoli and Antonino Salibra Outline 1 Church algebras and the λ-calculus 2 n-dimensional
More informationNotes on the λ-calculus
Notes on the λ-calculus J.R.B. Cockett Department of Computer Science, University of Calgary Calgary, T2N 1N4, Alberta, Canada November 30, 2017 1 Introduction The λ-calculus was one of the first descriptions
More informationAlonzo Church ( ) Lambda Calculus. λ-calculus : syntax. Grammar for terms : Inductive denition for λ-terms
Alonzo Church (1903-1995) Lambda Calculus 2 λ-calculus : syntax Grammar for terms : t, u ::= x (variable) t u (application) λx.t (abstraction) Notation : Application is left-associative so that t 1 t 2...
More informationModels of Computation,
Models of Computation, 2010 1 The Lambda Calculus A brief history of mathematical notation. Our notation for numbers was introduced in the Western World in the Renaissance (around 1200) by people like
More informationPropositional and Predicate Logic - XIII
Propositional and Predicate Logic - XIII Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - XIII WS 2016/2017 1 / 22 Undecidability Introduction Recursive
More informationThe Call-by-Need Lambda Calculus
The Call-by-Need Lambda Calculus John Maraist, Martin Odersky School of Computer and Information Science, University of South Australia Warrendi Road, The Levels, Adelaide, South Australia 5095 fmaraist,oderskyg@cis.unisa.edu.au
More informationTyped Lambda Calculi. Nikos Tzeveλekos Queen Mary, University of London 1 / 23
Typed Lambda Calculi Nikos Tzeveλekos Queen Mary, University of London 1 / 23 What is the Lambda Calculus A minimal formalism expressing computation with functionals s ::= x λx.s ss All you need is lambda.
More informationConstructive approach to relevant and affine term calculi
Constructive approach to relevant and affine term calculi Jelena Ivetić, University of Novi Sad, Serbia Silvia Ghilezan,University of Novi Sad, Serbia Pierre Lescanne, University of Lyon, France Silvia
More informationAutomata Theory. Definition. Computational Complexity Theory. Computability Theory
Outline THEORY OF COMPUTATION CS363, SJTU What is Theory of Computation? History of Computation Branches and Development Xiaofeng Gao Dept. of Computer Science Shanghai Jiao Tong University 2 The Essential
More informationPart II Logic and Set Theory
Part II Logic and Set Theory Theorems Based on lectures by I. B. Leader Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationCharacterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus Patrick Baillot 1, Erika De Benedetti 2, and Simona Ronchi Della Rocca 2 1 CNRS, ENS de Lyon, INRIA, UCBL, Université
More informationSHARING IN THE WEAK LAMBDA-CALCULUS REVISITED
SHARING IN THE WEAK LAMBDA-CALCULUS REVISITED TOMASZ BLANC, JEAN-JACQUES LÉVY, AND LUC MARANGET INRIA e-mail address: tomasz.blanc@inria.fr INRIA, Microsoft Research-INRIA Joint Centre e-mail address:
More informationInfinite λ-calculus and non-sensible models
Infinite λ-calculus and non-sensible models Alessandro Berarducci Dipartimento di Matematica, Università di Pisa Via Buonarroti 2, 56127 Pisa, Italy berardu@dm.unipi.it July 7, 1994, Revised Nov. 13, 1994
More informationThe Representability of Partial Recursive Functions in Arithmetical Theories and Categories
The Representability of Partial in Arithmetical Theories and Categories Department of Mathematics and Statistics University of Ottawa Foundational Methods in Computer Science May 30 June 2, 2018 First-order
More informationTuring Centenary Lecture
Turing Centenary Lecture P.D.Welch University of Bristol Visiting Research Fellow, Isaac Newton Institute Early Life King s College 1931 King s College 1931 Hardy Eddington He attended Eddington s lectures
More informationFIXED POINTS AND EXTENSIONALITY IN TYPED FUNCTIONAL PROGRAMMING LANGUAGES
FIXED POINTS AND EXTENSIONALITY IN TYPED FUNCTIONAL PROGRAMMING LANGUAGES a dissertation submitted to the department of computer science and the committee on graduate studies of stanford university in
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationType Theory and Constructive Mathematics. Type Theory and Constructive Mathematics Thierry Coquand. University of Gothenburg
Type Theory and Constructive Mathematics Type Theory and Constructive Mathematics Thierry Coquand University of Gothenburg Content An introduction to Voevodsky s Univalent Foundations of Mathematics The
More informationCall-by-value non-determinism in a linear logic type discipline
Call-by-value non-determinism in a linear logic type discipline Alejandro Díaz-Caro? Giulio Manzonetto Université Paris-Ouest & INRIA LIPN, Université Paris 13 Michele Pagani LIPN, Université Paris 13
More informationWhat are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos
What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It
More informationKvantifikator för en Dag
Philosophical Communications, Web Series, No. 35, pp. 155-162 Dept. of Philosophy, Göteborg University, Sweden ISSN 1652-0459 Kvantifikator för en Dag Essays dedicated to Dag Westerståhl on his sixtieth
More informationThe Lambda Calculus. Stephen A. Edwards. Fall Columbia University
The Lambda Calculus Stephen A. Edwards Columbia University Fall 2014 Lambda Expressions Function application written in prefix form. Add four and five is (+ 4 5) Evaluation: select a redex and evaluate
More informationThe Lambda Calculus is Algebraic
Under consideration for publication in J. Functional Programming 1 The Lambda Calculus is Algebraic PETER SELINGER Department of Mathematics and Statistics University of Ottawa, Ottawa, Ontario K1N 6N5,
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationModel Theory MARIA MANZANO. University of Salamanca, Spain. Translated by RUY J. G. B. DE QUEIROZ
Model Theory MARIA MANZANO University of Salamanca, Spain Translated by RUY J. G. B. DE QUEIROZ CLARENDON PRESS OXFORD 1999 Contents Glossary of symbols and abbreviations General introduction 1 xix 1 1.0
More informationNon-Idempotent Typing Operators, beyond the λ-calculus
Non-Idempotent Typing Operators, beyond the λ-calculus Soutenance de thèse Pierre VIAL IRIF (Univ. Paris Diderot and CNRS) December 7, 2017 Non-idempotent typing operators P. Vial 0 1 /46 Certification
More informationSimply Typed λ-calculus
Simply Typed λ-calculus Lecture 1 Jeremy Dawson The Australian National University Semester 2, 2017 Jeremy Dawson (ANU) COMP4630,Lecture 1 Semester 2, 2017 1 / 23 A Brief History of Type Theory First developed
More informationBeyond First-Order Logic
Beyond First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) Beyond First-Order Logic MFES 2008/09 1 / 37 FOL
More informationPropositions as Types
Propositions as Types Martin Pfeifhofer & Felix Schett May 25, 2016 Contents 1 Introduction 2 2 Content 3 2.1 Getting Started............................ 3 2.2 Effective Computability And The Various Definitions.......
More informationOn Undefined and Meaningless in Lambda Definability
On Undefined and Meaningless in Lambda Definability Fer-Jan de Vries Computer Science, University of Leicester, Leicester, UK fdv1@le.ac.uk Abstract We distinguish between undefined terms as used in lambda
More informationReview. Principles of Programming Languages. Equality. The Diamond Property. The Church-Rosser Theorem. Corollaries. CSE 230: Winter 2007
CSE 230: Winter 2007 Principles of Programming Languages Lecture 12: The λ-calculus Ranjit Jhala UC San Diego Review The lambda calculus is a calculus of functions: e := x λx. e e 1 e 2 Several evaluation
More informationDecidability: Church-Turing Thesis
Decidability: Church-Turing Thesis While there are a countably infinite number of languages that are described by TMs over some alphabet Σ, there are an uncountably infinite number that are not Are there
More informationUsing models to model-check recursive schemes
Using models to model-check recursive schemes S Salvati and I Walukiewicz Université de Bordeaux, INRIA, CNRS, LaBRI UMR5800 Abstract We propose a model-based approach to the model checking problem for
More information258 Handbook of Discrete and Combinatorial Mathematics
258 Handbook of Discrete and Combinatorial Mathematics 16.3 COMPUTABILITY Most of the material presented here is presented in far more detail in the texts of Rogers [R], Odifreddi [O], and Soare [S]. In
More informationA Stochastic Lambda-Calculus for Probabilistic Programming
A Stochastic Lambda-Calculus for Probabilistic Programming (Preliminary Report) Radu Mardare, Prakash Panangaden, and Dana Scott Logical Structures in Computation Reunion Workshop December 2017 Randomizing
More informationAn Implicit Characterization of PSPACE
An Implicit Characterization of PSPACE Marco Gaboardi Dipartimento di Scienze dell Informazione, Università degli Studi di Bologna - Mura Anteo Zamboni 7, 40127 Bologna, Italy, gaboardi@cs.unibo.it and
More informationA Common Notation System for the Lambda-Calculus and Combinatory Logic
A Common Notation System for the Lambda-Calculus and Combinatory Logic Masahiko Sato Graduate School of Informatics, Kyoto University Joint work with Takafumi Sakurai and Helmut Schwichtenberg IFIP WG
More informationCS 4110 Programming Languages & Logics. Lecture 16 Programming in the λ-calculus
CS 4110 Programming Languages & Logics Lecture 16 Programming in the λ-calculus 30 September 2016 Review: Church Booleans 2 We can encode TRUE, FALSE, and IF, as: TRUE λx. λy. x FALSE λx. λy. y IF λb.
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationEquivalent Computers. Lecture 39: Lambda Calculus. Lambda Calculus. What is Calculus? Real Definition. Why?
#,, - Lecture 39: Lambda Calculus Equivalent Computers z z z... term = variable term term (term) λ variable. term λy. M α λv. (M [y α v]) where v does not occur in M. (λx. M)N β M [ x α N ] Turing Machine
More informationSequent Combinators: A Hilbert System for the Lambda Calculus
Sequent Combinators: A Hilbert System for the Lambda Calculus Healfdene Goguen Department of Computer Science, University of Edinburgh The King s Buildings, Edinburgh, EH9 3JZ, United Kingdom Fax: (+44)
More informationFirst-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig
First-Order Logic First-Order Theories Roopsha Samanta Partly based on slides by Aaron Bradley and Isil Dillig Roadmap Review: propositional logic Syntax and semantics of first-order logic (FOL) Semantic
More informationDEGREES OF EXTENSIONALITY IN THE THEORY OF BÖHM TREES AND SALLÉ S CONJECTURE.
DEGREES OF EXTENSIONALITY IN THE THEORY OF BÖHM TREES AND SALLÉ S CONJECTURE. BENEDETTO INTRIGILA, GIULIO MANZONETTO, AND ANDREW POLONSKY Dipartimento di Ingegneria dell Impresa, Università di Roma Tor
More informationComputability Theory. CS215, Lecture 6,
Computability Theory CS215, Lecture 6, 2000 1 The Birth of Turing Machines At the end of the 19th century, Gottlob Frege conjectured that mathematics could be built from fundamental logic In 1900 David
More informationThe λ-calculus and Curry s Paradox Drew McDermott , revised
The λ-calculus and Curry s Paradox Drew McDermott drew.mcdermott@yale.edu 2015-09-23, revised 2015-10-24 The λ-calculus was invented by Alonzo Church, building on earlier work by Gottlob Frege and Moses
More informationSimply Typed Lambda-Calculi (II)
THEORY AND PRACTICE OF FUNCTIONAL PROGRAMMING Simply Typed Lambda-Calculi (II) Dr. ZHANG Yu Institute of Software, Chinese Academy of Sciences Fall term, 2011 GUCAS, Beijing Introduction PCF Programming
More information