Combinatory Logic: Pure, Applied and Typed

CRC Press Taylor & Francis Group 6000 Broken Sound Parkway NW, Suite 300 Boca Raton, FL 33487-2742 © 2012 by Taylor & F...

Author: Katalin Bimbó

103 downloads 1278 Views 3MB Size Report

This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form

DOWNLOAD PDF

CRC Press Taylor & Francis Group 6000 Broken Sound Parkway NW, Suite 300 Boca Raton, FL 33487-2742 © 2012 by Taylor & Francis Group, LLC CRC Press is an imprint of Taylor & Francis Group, an Informa business No claim to original U.S. Government works Version Date: 20110621 International Standard Book Number-13: 978-1-4398-0001-0 (eBook - PDF) This book contains information obtained from authentic and highly regarded sources. Reasonable efforts have been made to publish reliable data and information, but the author and publisher cannot assume responsibility for the validity of all materials or the consequences of their use. The authors and publishers have attempted to trace the copyright holders of all material reproduced in this publication and apologize to copyright holders if permission to publish in this form has not been obtained. If any copyright material has not been acknowledged please write and let us know so we may rectify in any future reprint. Except as permitted under U.S. Copyright Law, no part of this book may be reprinted, reproduced, transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying, microfilming, and recording, or in any information storage or retrieval system, without written permission from the publishers. For permission to photocopy or use material electronically from this work, please access www.copyright.com (http://www.copyright.com/) or contact the Copyright Clearance Center, Inc. (CCC), 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400. CCC is a not-for-profit organization that provides licenses and registration for a variety of users. For organizations that have been granted a photocopy license by the CCC, a separate system of payment has been arranged. Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identification and explanation without intent to infringe. Visit the Taylor & Francis Web site at http://www.taylorandfrancis.com and the CRC Press Web site at http://www.crcpress.com

© 2012 by Taylor & Francis Group, LLC

Contents

Preface

ix

1

Elements of combinatory logic 1.1 Objects, combinators and terms . . . . . . . . . . . . . . . . . . . 1.2 Various kinds of combinators . . . . . . . . . . . . . . . . . . . . 1.3 Reductions and combinatory bases . . . . . . . . . . . . . . . . . .

1 1 6 12

2

Main theorems 2.1 Church–Rosser property . . . . . . . . . . . . 2.2 Normal forms and consistency . . . . . . . . . 2.3 Fixed points . . . . . . . . . . . . . . . . . . 2.4 Second fixed point theorem and undecidability

. . . .

29 29 38 44 52

. . . .

53 54 64 81 85

3

. . . .

. . . .

. . . .

Recursive functions and arithmetic 3.1 Primitive and partial recursive functions . . . . . . . 3.2 First modeling of partial recursive functions in CL . 3.3 Second modeling of partial recursive functions in CL 3.4 Undecidability of weak equality . . . . . . . . . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

4

Connections to λ -calculi 93 4.1 λ -calculi: Λ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 4.2 Combinators in Λ . . . . . . . . . . . . . . . . . . . . . . . . . . 106 4.3 Back and forth between CL and Λ . . . . . . . . . . . . . . . . . 110

5

(In)equational combinatory logic 121 5.1 Inequational calculi . . . . . . . . . . . . . . . . . . . . . . . . . . 121 5.2 Equational calculi . . . . . . . . . . . . . . . . . . . . . . . . . . 128

6

Models 6.1 Term models . . . . . . . . . . 6.2 Operational models . . . . . . . 6.3 Encoding functions by numbers 6.4 Domains . . . . . . . . . . . . 6.5 Models for typed CL . . . . . . 6.6 Relational models . . . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

. . . . . .

133 134 136 148 155 165 174

vii © 2012 by Taylor & Francis Group, LLC

viii

Contents

7

Dual and symmetric combinatory logics 179 7.1 Dual combinators . . . . . . . . . . . . . . . . . . . . . . . . . . . 179 7.2 Symmetric combinators . . . . . . . . . . . . . . . . . . . . . . . 201 7.3 Structurally free logics . . . . . . . . . . . . . . . . . . . . . . . . 210

8

Applied combinatory logic 221 8.1 Illative combinatory logic . . . . . . . . . . . . . . . . . . . . . . 221 8.2 Elimination of bound variables . . . . . . . . . . . . . . . . . . . . 227

9

Typed combinatory logic 237 9.1 Simply typed combinatory logic . . . . . . . . . . . . . . . . . . . 237 9.2 Intersection types for combinators . . . . . . . . . . . . . . . . . . 268

Appendix A.1 Elements of combinatory logic . . . . . A.2 Main theorems . . . . . . . . . . . . . A.3 Recursive functions and arithmetic . . . A.4 Connections to λ -calculi . . . . . . . . A.5 (In)equational combinatory logic . . . A.6 Models . . . . . . . . . . . . . . . . . A.7 Dual and symmetric combinatory logic A.8 Applied combinatory logic . . . . . . . A.9 Typed combinatory logic . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

. . . . . . . . .

275 275 284 288 292 294 296 302 308 312

Bibliography

321

List of Symbols

331

Index

335


Preface Combinatory logic was invented in the 1920s and has been developing ever since — often in the company of λ -calculi. Both of these formalisms, together with their variants, can capture the notion of a computable function or algorithm. This places combinatory logic next to recursion theory and computer science. On the other hand, typed combinatory logic straightforwardly connects with intuitionistic logic and other nonclassical logics, for example, relevance logics and linear logic. All this links combinatory logic to mathematical logic, philosophical logic and computational logic. This book intends to present combinatory logic — starting with the basics — as a self-contained subject. λ -calculi are mentioned, because it seems unavoidable due to the historical development of these areas. However, λ -calculi are not given here as much prominence as is some other texts. The key themes that are explicit (and sometimes implicit) in the following chapters are the connections to computability and to nonclassical logics. This implies that some other matters are given less emphasis. Nevertheless, the book aims to give a snapshot of the current state of the development of combinatory logic — together with pointers toward further possible advancements. There is a comprehensive two-volume book on combinatory logic by Haskell B. Curry and his collaborators and students. Those volumes, however, had been completed by the late 1950s and early 1970s, respectively. Of course, mathematical and logical knowledge is typically cumulative, but the way concepts and results are presented might change even when the core results are preserved. Arguably, the role and the perception of combinatory logic within the discipline of logic has changed in the past 30–40 years. During those decades, many new results have been obtained. This creates a need and imparts a justification for a new presentation of the subject with some emphases shifted. Combinatory logic is briefly mentioned or dealt with in quite a few books on λ calculi, because of the relationship between λ -calculi and combinatory logics. (See, for instance, [], [] and [].) I take the reverse approach here: the book focuses on combinatory logic itself, and I give a concise introduction to λ -calculi (in chapter 4), primarily, for the sake of comparison. Curry seems to have deemed important to supplement his books with sections on history. (See, for instance, [], [] and [].) Combinatory logic has matured since its early days, and it seems to me that brief sections would not suffice to provide an accurate historical account. Recently, separate and detailed publications appeared on the history of combinatory logic and λ -calculus in volumes on the history of logic, which also suggest that the history of the subject is better to be treated in itself.

ix © 2012 by Taylor & Francis Group, LLC

x

Preface

In sum, I did not aim at providing a historical account of the development of combinatory logic in this book. Instead of trying to follow previous presentations closely, for the sake of historical accuracy, I intended to give an exposition in which the concepts are introduced as the results require them. Although some of the results are labeled by their usual labels, such as “Church–Rosser theorem,” I did not try to attach a label to each claim, lemma and theorem in order to point to the first or to a widely accessible publication. An attempt to conduct more vigorous labeling either would have limited the scope of the presentation or would have opened the door for misattributions due to minor (or even more significant) differences in the underlying concepts. An extensive bibliography is included at the end of the book, which also includes texts that are either exclusively historical or at least more historically oriented than this book. I wrote this book to give a state-of-the-art view of combinatory logic in the early 21st century. In order to make the book relatively easy to read, I started with an elementary introduction and I placed into the appendix various concepts and definitions that are useful or occasionally presupposed in the main text of the book, but do not belong to combinatory logic itself. I hope that this will help anybody to read the book, who has some aptitude toward formal thinking. Combinatory logic is not as widely taught as I think it should be. Therefore, a purpose of this book is to serve as a readily accessible source of knowledge for experts in logic, computer science, mathematics, philosophy and certain related disciplines, who are perhaps, less familiar with this branch of logic. Another potential use of the book, what I kept in mind during the writing, is as a text in a course. The examples and exercises in the text are intended to facilitate learning combinatory logic, alone or in the context of a course. (The starring of the exercises indicates the expected difficulty of their solutions.) The first couple of chapters of the book (perhaps, with a selection of further sections from later chapters) covers topics that can provide the content of an undergraduate course on combinatory logic. The whole book is suitable to be used as the main text for a graduate course — at a beginning or advanced level, depending on the background of the students. Because of the many connections combinatory logic has, I hope that the book will also be used to supplement courses, for example, on philosophical logic, on computability and on the foundations of mathematics. My first acquaintance with combinatory logic happened in the early 1990s, when I took a course of Raymond Smullyan, at Indiana University in Bloomington. The power and elegance of combinatory logic quickly enthralled me. The close connection between nonclassical logics and combinatory logic reinforced my interest in the subject. Among relevance logicians, it is common knowledge that Alonzo Church invented the implicational fragment of the logic of relevant implication (what he called “the theory of weak implication”), which corresponds to types for his λI -calculus. J. Michael Dunn and Robert K. Meyer invented structurally free logics and dual combinators in the 1990s. These logics both tighten the


xi

Preface

connection between relevance logic and combinatory logic, and expand the bond between combinatory logic and a wide range of nonclassical logics. My own research results in combinatory logic concern some of the newer developments such as dual combinatory logic. The connection between nonclassical logics and combinatory logic means that I always keep in mind combinators when I work on a substructural logic. Some of my work and results in the proof theory of relevance logic (and indirectly in the proof theory of classical logic) had been motivated by combinatory logic and structurally free logics. The splice of combinatory logic and relevance logic has proved fruitful in many ways. For example, J. Michael Dunn and I have solved the famous problem of T→ , which remained open for half a century, by combining insights from proof theory and combinatory logic. I am indebted to Robert Stern, the acquiring editor for this book, for his patience and for allowing me to ask for a new deadline (or two) for the submission of the manuscript. (The project of writing this book was substantially delayed when — somewhat unexpectedly — I had to teach a course on real ethics, that is, on formal decision theory as part of my regular teaching duties at the University of Alberta.) I am also grateful to Jennifer Ahringer for her help during the production process. I am grateful to Graham Sullivan, who, as a research assistant, proofread parts of the book and provided helpful comments and corrections. I am indebted to the University of Alberta for awarding a grant from the Endowment Fund for the Future Support for the Advancement of Scholarship Research Fund that allowed me to have a research assistant for a couple of months at the time when the manuscript of the book was nearing its completion. The book was typeset using the program TEX (by D. Knuth) with the LATEX format. I also utilized various packages that were developed under the auspices of the American Mathematical Society. The actual writing of this book took place in Edmonton. I always enjoy the prospect of having another snow fall, what can (and sometime does) happen here as early as September and as late as June.

Edmonton, 2011


KB

Chapter 1 Elements of combinatory logic

Functions are everywhere, and combinatory logic is one of the theories that make them their objects of study. To start with, let us consider a simple function such as + , the addition of integers. + can be applied to numbers; for instance, 46 + 68 is the result of this application, which is also denoted by 114 . Then we can view + as a certain map from ordered pairs of integers into integers, or, further, as a set of ordered triples. From another perspective, + can be thought of as a rule to compute the sum of two integers — indeed, this is how each of us first became acquainted with + . In both cases, knowing that + is commutative and associative (and has other properties) is useful in identifying seemingly different versions of + . Just as light has a dual character — being a wave and being a beam of particles — functions have two sides to them: they are collections of input–output pairs, and they are rules for computation from inputs to the output. Combinatory logic (henceforth, CL) is the logic of functions, in which the two aspects of functions mentioned above are in constant interplay. Functions are the objects in CL, and every object of CL can be thought of as a function. The functions need not always be thought of as functions on numbers, though we will see in chapter 3 how to represent numerical functions in CL.

1.1

Objects, combinators and terms

The objects in CL are called terms, and they stand for functions. Some of the terms cannot be divided into more elemental components: such terms are either constants or variables. The only way to put terms together is via (function) application, and the result of this operation is always a term. Let us consider some examples from elementary algebra before proceeding to formal definitions. The natural numbers are denoted, in the usual decimal notation, by nonempty strings of digits like 0, 1, . . . , 11, . . . , 98 765, . . . . (In formalized arithmetic, these numbers are denoted, respectively, by 0 and the successor function applied sufficiently many times to 0 .) These expressions are constants, although in an elementary exposition they are not thought of as functions. Another kind of constants are functions like + (addition), · (multiplication), − (subtraction), etc. The three functions we listed are binary (i.e., each takes two arguments), but there are func-

1 © 2012 by Taylor & Francis Group, LLC

2

Bimbó: Combinatory Logic

tions of other arities too. The absolute value function has arity 1 , that is, it is unary, and we can have functions taking n arguments (where n is a positive integer). It is just not that useful in practice to have a quinary addition, let us say +5 , that produces the sum of five numbers. (A quinary addition is easily emulated by the binary addition, because + is associative.) Variables may enter into algebraic expressions too, and they are often denoted by x, y, z, x0 , x1 , x2 , . . . . So far we emphasized some similarities between algebraic terms and combinatory terms. They both may contain constants and variables. Each function takes a fixed number of inputs (i.e., arguments), but different functions can have more or fewer arguments than others. Also, the use of delimiters (such as parentheses) is common. 5 + 7 · 13 is ambiguous — unless we have agreed that · takes precedence over + . In other words, (5 + 7) · 13 and 5 + (7 · 13) are different terms; moreover, their value is different too: (5 + 7) · 13 is 156 , whereas 5 + (7 · 13) is 96 . A notable difference between algebraic and combinatory terms is that in elementary algebra functions such as + are applicable to numbers only. That is, we would dismiss as nonsensical (or as “a misprint”) something like + · (5 + ·) , where · seems to have + as its argument and vice versa. We do not make any similar assumptions about the nonapplicability of terms in CL. We may reiterate also that variables in CL may stand for functions. This happens much more infrequently in algebra, except perhaps in definitions of properties of functions. For instance, f (x, y) is called a commutative operation when f (x, y) equals f (y, x) , for all x and y . This definition applies to any binary operation; that is, the whole sentence is understood as if “for all f ” were prefixed to it. Lastly, function application is a binary operation in CL that is explicitly introduced (though typically suppressed in the notation). The more explicit and more detailed analysis of function application in CL leads to several notions of computing with terms. We assume that the language of CL contains constants, typically, S and K . However, it may contain other constants too such as B , C , W , I and M — to name some. These constants are called combinators. There might be other sorts of constants in the language, including constants that are not definable from S and K (in a sense that we will explain later). B , C , W , M and I are all definable from S and K . For the definition of the set of terms, it is not particularly interesting which constants are included in the language, except that the definition, of course, applies only to those constants that are included. (We focus, especially in the first half of the book, exclusively on combinators.) We also assume that there is a denumerable set of variables, that is, there are infinitely many variables, but countably many (i.e., ℵ0 many). The language includes a binary operation called function application that is denoted by juxtaposition. D EFINITION 1.1.1. The set of CL-terms (or terms, for short) is inductively defined by (1)–(3).1 (1) If Z is a constant, then Z is a term; 1 As

usual, we leave tacit and hence omit mentioning that the least set generated by clauses (1)–(3) is the set, that is defined. This will be our practice in what follows.


Chapter 1.

Elements of CL

3

(2) if x is a variable, then x is a term; (3) if M and N are terms, then so is (MN) . We use uppercase sans serif letters for combinators. The letters chosen for particular combinators are often standard. To refer ambiguously to some combinator, we use Z ; in other words, Z is a meta-variable for combinators.2 The lowercase letters, x, y, z, . . . , with or without indices, serve as variables (as well as meta-variables for variables). The uppercase letters M , N , P and Q , with or without indices, are meta-variables for CL-terms in general. To put it differently, M can be instantiated with x or I , but also with (S(x(xy))) , etc. The binary application operation figures into the term (MN) in clause (3). We do not add a symbol like · or + to the term that results from M and N , but the resulting term is enclosed in parentheses. Example 1.1.2. S and K are terms, and so are the variables standing alone. These terms are called atomic to distinguish them from the rest of the terms, which are called complex or compound. Some of the latter are (Ix) , (x(yz)) , (zS) and ((SI)I) . There are denumerably many atomic terms and there are denumerably many complex terms; in total, the set of CL-terms is denumerable (i.e., the cardinality of the set of CL-terms is ℵ0 ). Exercise 1.1.1. Prove informally (or prove using structural induction) that every CLterm either is atomic or starts with a ‘ ( ’. Exercise 1.1.2. Sort the terms listed into the following categories: “atomic term,” “complex term” and “nonterm” (i.e., an expression that is not a term). (x) , SKK , x12 , (xx))(((xx)x)x) , (((S(KS))K)(x(yz))) , (((BM)((BW)B))x) , ((((WM)N)N)W) , C , z , (((x1 S)((x2 S)x3 ))((x5 (x4 K))y)) . Exercise∗ 1.1.3. Prove informally (or by structural induction) for every term that if the

term contains parentheses, then the parentheses are well-balanced. (The latter means that there are equal numbers of ( ’s and ) ’s, and that scanning the term from left to right, there are never more right parentheses that left ones.) Exercise 1.1.4. Prove that not all expressions that contain well-balanced parentheses are CL-terms.

We will often use meta-terms instead of terms, that is, expressions that contain some of the meta-variables M , N , P , . . . . By those (meta-)terms, we refer to an arbitrary term that instantiates the expression. Another notational convention concerns omitting parentheses. Delimiters pile up quickly, and then terms soon become practically unreadable. In CL, parentheses are normally omitted from left-associated terms, that is, a term of the form ((MN)P) 2Z

is a schematic letter that stands for any of the combinators in the meta-language, that is, in the language we use to talk about CL. We use ‘meta-variable’ similarly for other types of expressions.


4


may be written as (MNP) . The outmost parentheses are, as a rule, omitted too; continuing the example, we get MNP .3 Example 1.1.3. (Bxy)z is shorthand for (((Bx)y)z) . BWBx(BWBx) is a result of omitting some parentheses from ((((BW)B)x)(((BW)B)x)) . The former shorthand term could be further abbreviated by omitting the remaining pair of parentheses. The latter, however, cannot be further simplified. There are terms from which parentheses may be omitted in various ways; hence, we may get more than one abbreviated term. On the other hand, the insertion of all omitted parentheses leads to a unique term, which is important, because we do not want to introduce ambiguity into our notation. In view of this remark, we will call the abbreviated terms simply “terms” — unless the distinction between them is the point, as in the next couple of exercises. Exercise 1.1.5. Restore all the parentheses in the following abbreviated terms. Kx(Wyz)y , xxx , (SI)yB , x14 x152 , M1 (M2 (M3 xyy)z) . Exercise 1.1.6. Omit as many parentheses as possible from the following terms (without introducing ambiguity). (((yz)(II))x) , ((Mx)((By)(Wz))) , (W(Ix145 (Ix72 ))x58 ) , (((SK)K)x) , (((SM)M)(I(NP))) . Exercise 1.1.7. Is there a term that has at least two (distinct) abbreviated forms such

that neither can be obtained from the other by omitting parentheses? (Hint: If the answer is “yes,” give an example; if the answer is “no,” then prove that such abbreviated terms cannot exist.) Exercise 1.1.8. Prove informally (or by structural induction) that all terms contain an

even number of well-balanced parentheses, and that omitting parentheses preserves this property. Exercise 1.1.9. Give an example of an expression (from the language of CL) that is

not a term or an abbreviated term, but has an even number of parentheses. Give an example of an expression (from the language of CL) that is not a term or an abbreviated term, but contains well-balanced parentheses. Now that we have a precise definition of CL-terms, it will be helpful to point out a few more similarities and differences between algebraic terms and CL-terms. Arithmetic functions such as multiplication and addition are binary, and the function symbol is usually placed between the two arguments. We will see in the next section that the arity of W is 2 ; nonetheless, the arguments of W follow the function symbol (that is, the arguments come after W ). In general, putting a function (or relation) symbol between its arguments is called infix notation. In CL, a prefix notation is used instead, that is, functions precede (or are prefixed to) their arguments. 3 We parenthesize

M , N , P , . . . , as if they were atomic terms — as long as they have not been instantiated. This, of course, does not imply that they have to be replaced or instantiated by atomic terms.


Chapter 1.

Elements of CL

5

In mathematics, in general, there is great variation as to where the arguments of a function are located. Consider as examples exponentiation, logarithmic functions, integrals and derivatives. For less frequently used functions, the notation is less idiosyncratic: an n -ary function may be simply denoted by f (x1 , . . . , xn ) . If f were a constant in CL, then the term in which the function f is followed by the arguments x1 , . . . , xn would look like (...( f x1 ) . . . xn ) . In other words, the commas are all dropped and a pair of parentheses surrounds a function applied to an argument rather than a series of arguments. Exercise 1.1.10. Assume that # and ∗ are combinatory constants (of arity 2 ) that stand, respectively, for addition and multiplication in CL. (a) Translate the following arithmetical terms into CL. z + z , x · y , (x + y) · x , x1 · (x2 · x3 · x3 + x4 · x5 + x7 ) , x · (x + y) . (b) Translate the following terms from CL into arithmetics. #x(#xx) , (∗(#yz))((#x)y) , ∗(∗(∗(∗(∗xz)y)y)x)(yx) , #M(N#P) , ##(∗KI)(∗K∗) .

We have not exhausted the range of investigations of syntactic properties of terms.4 However, we introduce here yet another syntactic concept. Informally, M is a subterm of N if M is itself a term and M is part of N . D EFINITION 1.1.4. The subterm of relation on the set of CL-terms (i.e., M is a subterm of N ) is defined inductively by (1)–(5). (1) x is a subterm of x ; (2) Z is a subterm of Z ; (3) M is a subterm of the terms (NM) and (MN) ; (4) (NP) is a subterm of (NP) ; (5) if M is a subterm of N and N is a subterm of P , then M is a subterm of P . All subterms of a term are themselves terms. Terms have more that one subterm — unless they are atomic; and all terms are subterms of infinitely many terms. The joint effect of (1), (2) and (4) is that every term is a subterm of itself, which may appear strange at first (given the ordinary meaning of “sub-”). However, the reflexivity of the “subterm of” relation is intended, because it simplifies some other definitions. (The notion of a proper subterm is also definable — see section A.1.) Clause (5) means that the “subterm of” relation is transitive; indeed, it is a partial order on the set of terms. Exercise 1.1.11. List all the subterms of each of the following terms. (x(Wx)y) , yy(y(yy)) , (S(KW)S)(BWW) , zS(yS)(xWSK) , PM((PN)(PP))M , WMx(NNPPy) , (BM(x)(NM)) . 4 Some

further notions and definitions concerning terms, such as the definition of left-associated terms, the definition of occurrences of terms, the definition of free occurrences of a variable, etc., may be found in section A.1 of the appendix.


6


We stated but did not prove that the “subterm of” relation is a partial order. Granted that reflexivity and transitivity are established, it remains to show that the relation is antisymmetric. This is the content of the next exercise. Exercise 1.1.12. Prove that if M is a subterm of N and N is a subterm of M , then M

is the same term as N . Exercise 1.1.13. Complex CL-terms have more than one term that is their subterm.

Define inductively an operation that gives the set of subterms for a term. Exercise 1.1.14. Exercise 1.1.11 in effect asked you to list the elements of the set of

subterms of seven terms. Give another definition of the set of subterms of a term using the “subterm of” relation.

1.2

Various kinds of combinators

Combinators are characterized by the number of arguments they can have (i.e., their arity) and by the effect they have when applied to as many arguments as their arity. The arity of a combinator is always a positive integer. For example, I is a unary combinator, whereas S takes three arguments. The effect of the application of a combinator is given by its axiom. A combinatory axiom consists of two terms with a symbol (such as B ) inserted between them. The following table shows the axioms of some well-known combinators.5 Ix B x Kxy B x Mx B xx

Bxyz B x(yz) Cxyz B xzy B0 xyz B y(xz)

Sxyz B xz(yz) Wxy B xyy Jxyzv B xy(xvz)

The terms on the left-hand side of the B tacitly indicate the arity of the combinator, because the combinator precedes as many variables as its arity. Notice also that these variables are not assumed to be the same. For instance, we have the term Wxy (not Wxx ) on the left-hand side of the B on the second line. The term on the right-hand side in an axiom shows the term that results after the application of the combinator. In the resulting terms, some of the variables may be repeated, omitted, or moved around. All the combinators listed above (but not all combinators in CL) have the property that their application does not introduce new variables and the resulting term is built solely from some of the variables that appeared as their arguments. Such combinators are called proper. Some combinators that are not proper (i.e., improper), are extremely important, and we will return to them later. However, they are the exceptions among the improper combinators. 5 B0

is not a single letter, and this combinator is sometimes denoted by Q . B0 is closely related to B ; this explains the notation, which we retain because it is widely used.


Chapter 1.

Elements of CL

7

Variables are used in logic when there is an operator binding them or there is a rule of substitution. CL contains no variable binding operators, which is one of the best features of CL; however, substitution is a rule. The combinatory axioms above gave a characterization of applications of combinators to variables only, but of course, we would like combinators to be applicable to arbitrary terms. Substitution ensures that this really happens, as we illustrate now. Example 1.2.1. I(yz) B yz is an instance of the axiom for I with yz substituted for x in both terms (that is, in Ix and in x ) in the axiom. Another instance of the same axiom is I(y(xz)) B y(xz) . (Notice that the presence of x in the term that is being substituted is unproblematic, and there is no danger of “circularity” here.) We get yet another example by substituting I for x , M for y and z for z (or leaving z as it is) in the axiom for B . BIMz is the left-hand side term, and I(Mz) is the right-hand side term. The latter term can be viewed also as obtained from the left-hand side term in the axiom for I by substituting Mz for x , which then gives Mz on the right. The last example shows that we may be interested in successive applications of combinators to terms. It also shows that substitution in distinct terms may result in the same term. Furthermore, the same term may be substituted for different variables; hence, the use of distinct variables in the axioms is not a restriction at all, but rather a way to ensure generality. The informal notion of substitution may be made precise as follows. D EFINITION 1.2.2. (S UBSTITUTION ) The substitution of a term M for the variable x in the term N is denoted by NxM , and it is inductively defined by (1)–(4). (1) If N is x , then NxM is M ,

(i.e., xxM is M );

(2) if N is y and y is a variable distinct from x , then NxM is N , (i.e., yxM is y ); (3) if N is Z , then NxM is N ,

(i.e., ZM x is Z );

M M M M (4) if N is (P1 P2 ) , then NxM is (P1 M x P2 x ) , (i.e., (P1 P2 )x is (P1 x P2 x ) ).

Substitution is a total operation in CL. There is no restriction on the shape of N or on occurrences of x in N in the definition, though the result of the substitution, in general, will depend on what N looks like. Substitution can be summed up informally by saying that all the x ’s in N (if there are any) are turned into M ’s. Substitution is a much more complicated operation in systems that contain a variable binding operator — such as λ -calculi or logics with quantifiers. Substitution was not very well understood in the early 20th century, and one of the motivations for combinatory logic — especially, in Curry’s work in the 1930s — was the clarification of substitution. Another motivation — mainly behind Schönfinkel’s work — was the elimination of bound variables from first-order logic. These two problems turn out to be one and the same, and the general solution in both cases leads to a combinatorially complete set of combinators. (We return to combinatorial completeness in the next section; see in particular definition 1.3.8 and lemma 1.3.9.)


8


Sometimes, it is convenient to substitute at once for more than one variable in a term. This operation is called simultaneous substitution. A simultaneous substitution can always be emulated by finitely many single substitutions, which means that simultaneous substitutions can be viewed as convenient notational devices. (However, see section A.1 for a more formal view of this operation.) We limit ourselves to a few examples. I,yy,J

Example 1.2.3. (Sxyz)x,y,z is SI(yy)J , that is, I is substituted for x , yy for y and J for z . A more revealing case is when one of the substituted terms contains a variable that is one of the variables for which a term is substituted simultaneously. yy,W For instance, (Jxyzv)x,y is the term J(yy)Wzv (rather than J(WW)Wzv ). Other notations for the substitution of M for x include [x/M] (and [M/x] ) placed in front of or after the term on which the operation is performed. For instance, [x/M]N or [x1 /M1 , x2 /M2 ]N are such notations, which may be clearer than NxM and NxM1 ,1x, 2M2 .6 (We will use the “slash-prefix” notation too.) Exercise 1.2.1. Write out the details of the following substitutions step-by-step. (a) (Ix(Wx))zx , (b) [z/x(xy)]S(xx)(yy)(xy) , (c) [x1 /M, x3 /B, x4 /W](x3 x1 (x3 x4 x3 )) ,

(d) (Sxyz)Kx,,y,Kz, x , (e) (CxyM)PPN . y

Substitution affects all occurrences of a variable. Another operation on terms affects selected occurrences of a subterm in a term, and it is called replacement. The result of replacing some subterms of a term by a term is, of course, a term. For our purposes, the visual identification of an occurrence of a subterm is sufficient — together with the remark that a completely rigorous numbering or identification of the subterms is possible. Example 1.2.4. The result of the replacement of an occurrence of a subterm SKKx in SKKx by Ix is Ix . (Recall that every term is its own subterm.) The result of replacement of the first occurrence (from left) of x in KSx(Sx) by M is KSM(Sx) , whereas the replacement of the second occurrence of x yields KSx(SM) . This shows that not all occurrences of a subterm (even if that term happens to be a variable) need to be replaced. Lastly, the replacement of the second occurrence of BW in BWBW(BWBW) by SKC gives us BWBW(SKCBW) . (This looks like, but in fact is not, a typo!) In the first example, the term we started with and the term we ended up with are very closely related in a sense that will soon become clear. A similar relationship holds in the second example, but only accidentally — because of the occurrence of K in a specific spot in the term. The last two examples show no such relationship between the input and the output terms. Generally speaking, replacement induces 6 There

are still other ways to denote substitution. Occasionally, ← or → is used instead of / . We do not intend to give an exhaustive list here, but you should be aware that the notation for substitution is anything but unvarying in the literature.


Chapter 1.

Elements of CL

9

desirable relationships between input and output terms only if such relationships obtain between the replaced subterm and the newly inserted subterm. The effect a combinator can have on a term may be thought of as replacing a term that is on the left-hand side of the B by a term that has the form of the term on the right-hand side of the B . More precisely, such replacements can be performed within any terms according to instances of combinatory axioms. The change that a combinator produces in a term is one of the most interesting criteria for classifying combinators. (We have already seen another grounds for categorization: the arity of combinators and the comparison of the set of atomic subterms of the terms on the left and on the right.) Terms are “structured strings,” that is, they typically contain parentheses that show grouping. Terms might differ with respect to the number of occurrences of some subterm, the order of subterms or whether a subterm occurs at all in a term. There are five salient features that we use to categorize combinators.7 The properties that are exemplified by I , B , K , C and M are the ones that are abstracted away and turned into defining properties of classes of combinators. Identity combinators. The letter I is intended to remind us that I is a unary identity function. As such, the effect of an application of I is that we get back the input term. (To put it more scintillatingly, I simply “drops off” from the term.) Functions like I can be envisioned for any arity, and accordingly we call the n -ary combinator Z an identity combinator when its axiom is (...((Zx1 )x2 ) . . . xn ) B (...(x1 x2 ) . . . xn ). The binary identity combinator may be taken to be BI , because BIyz B I(yz) and I(yz) B yz are instances of the axioms for B and I . (We already hinted at that we might consider series of replacement steps according to combinatory axioms; we will make this precise in the next section when we will define reduction to be a transitive relation.) Associators. Recall that the only alteration B introduces into a term is association to the right. A term comprising two atoms, such as two variables x, y or two constants S, C , can be grouped only in one way. Hence, B has the least arity ( 3 ) among associators. An n -ary combinator Z is an associator when Z ’s axiom is Zx1 . . . xn B M and M is not a left-associated term.

For example, M may be a term (x1 . . . xn ) with x1 through xn in the same order as on the left-hand side of the B , but with at least one subterm of the form xi N , where i 6= 1 . The following Z1 and Z2 are both quinary associators. Z1 x1 x2 x3 x4 x5 B x1 x2 x3 (x4 x5 ) 7 We

follow the usual classification of combinators (that may be found, e.g., in Curry and Feys []) with some slight modifications. A main difference is that we do not limit the use of labels such as “permutator” to regular combinators.


10

Bimbó: Combinatory Logic Z2 x1 x2 x3 x4 x5 B x1 (x2 x3 x4 x5 )

There are five possible ways to insert parentheses into a term that consists of four atomic terms. Curiously, B by itself is sufficient to define three combinators that yield the terms x1 x2 (x3 x4 ) , x1 (x2 x3 x4 ) and x1 (x2 (x3 x4 )) (when the arguments are x1 , x2 , x3 and x4 in that order), and an application of B yields x1 (x2 x3 )x4 . (Although B is a ternary combinator, we may form a term from the terms Bx1 x2 x3 and x4 , that reduces to the desired term.) B(x1 x2 )x3 x4 B x1 x2 (x3 x4 ) is an instance of B ’s axiom, and so is BBx1 x2 B B(x1 x2 ) . Then BB , sometimes denoted as D , associates x3 and x4 — leaving x1 and x2 grouped together. Dx1 x2 x3 x4 B x1 x2 (x3 x4 ) Exercise 1.2.2. Find combinators Z3 and Z4 that are composed of B ’s and have axioms Z3 x1 x2 x3 x4 B x1 (x2 x3 x4 ) and Z4 x1 x2 x3 x4 B x1 (x2 (x3 x4 )) .

Cancellators. An application of the combinator K to two arguments, let us say x and y , results in the term x , that is, y gets omitted or cancelled. This feature may seem spurious at first. However, when K and S are chosen as the only constants, the potential to form terms with some subterms disappearing after an application of K is essential. In general, an n -ary combinator Z is called a cancellator when the axiom of Z is Zx1 . . . xn B M with at least one of x1 , . . . , xn having no occurrences in M.

As another example of a cancellator, we could consider a combinator K2 such that when it is applied to x and y the term y results. KIx B I is an instance of the axiom for K ; hence, KI achieves the desired effect. We will see in chapter 3 that the capability to omit the first or the second argument that is exhibited by K and KI , as well as the definability of cancellators that retain only one of their n arguments is paramount, in the representation of recursive functions by combinators. Permutators. The combinators C and S both change the order of some of their arguments. Recall that the right-hand side terms in their axioms are xzy and xz(yz) . In the former, y and z are swapped; in the latter, an occurrence of z precedes an occurrence of y . A combinator taking n arguments is a permutator when its axiom is of the form Zx1 . . . xn B M with M containing an x j preceding an xi (for 1 ≤ i < j ≤ n).

Of course, M may contain several occurrences of either variable, but in the definition we only require the existence of at least one pair of occurrences with x j coming first. Exercise 1.2.3. Find a ternary combinator (composed of the constants already intro-

duced) such that if applied to x, y and z it produces the term yzx , that is, “it moves its first argument behind the two others.” This combinator is usually denoted by R and its axiom is Rxyz B yzx . The effect of R can be produced by combining the combinators that we already have.


Chapter 1.

Elements of CL

11

Exercise 1.2.4. Recall that the axiom for the combinator B0 is B0 xyz B y(xz) . First, define the combinator B0 using B and C . Next, find a combinator V that “reverses” the effect of R , that is, an application of V to three arguments x , y and z yields zxy . (Hint: B0 , B and some permutators may be useful in the latter definition.)

Duplicators. The combinators W and M “copy” or “duplicate” some of their arguments. W ’s application results in two occurrences of its second argument in the output term, and M returns two copies of its (only) input. An n -ary combinator Z is a duplicator when the axiom for Z is Zx1 . . . xn B M and M contains more than one occurrence of an xi (1 ≤ i ≤ n).

Notice that S is not only a permutator, but a duplicator too, because xz(yz) has two occurrences of z . S is an excellent example of a combinator that combines various kinds of effects. Indeed, in the terminology of [], the last four categories would be called “combinators with such-and-such effect.” (Cf. footnote 7.) The only category of combinators in which the shape of the resulting term is completely specified by our definitions is that of identities. Combinators that integrate various effects are useful, but it is also helpful to be able to dissect their blended effect into components. This will become transparent when we will delineate a subset of the set of the terms that can model arithmetic functions. Exercise 1.2.5. Classify all the combinators introduced so far according to their ef-

fects. (Hint: Some combinators will appear in more that one category.) Exercise 1.2.6. Define or find combinators (among the already introduced ones) that

demonstrate each pair of properties that can appear together. (Hint: You need 6 combinators in total.) We quickly mention two other classes of combinators now. Regular combinators. Combinators may be thought of as affecting the arguments of a function. Let us assume that f is a binary function; then f xy is the application of f to x and y . C f xy takes f , x and y as arguments and yields f yx , that is, f applied to its arguments in reversed order. This motivates singling out combinators that keep their first argument “in the left-most place.” These combinators are called regular, and the axiom for a regular combinator Z is Zx1 . . . xn B x1 M.

The combinators I , K , S , W , C , B , J and D are all regular, whereas B0 and R are not. Therefore, it is obvious by now that putting together regular combinators may give a combinator that is not regular. Because of the lack of preservation of regularity under application, we will not place an emphasis on regular combinators — despite the fact that they have an easy to understand informal meaning. Proper combinators. We already mentioned this kind of combinators. Z is a proper combinator if its axiom is Zx1 . . . xn B M and M contains no variables other than x1 , . . . , xn .


12


Informally speaking, combinators that introduce a new variable are hardly sensible (because an arbitrary term can be substituted for that variable). On the other hand, some combinators that introduce a constant make perfect sense and are important (even though they are not proper). The archetypical combinator of this kind is the fixed point combinator, often denoted by Y .8 The axiom for Y is Yx B x(Yx) . If x is a function, then Yx is its fixed point when the axiom is viewed from right to left (or B is thought of as some sort of equality). That is, by replacing Yx by z , x by f and B by = we get f z = z . Exercise∗ 1.2.7. Find a term built from some of the combinators mentioned so far (save Y ) that has the effect of Y .

We introduced some combinators as constants at the beginning of this section. These are the primitive combinators (also called undefined combinators) in our system. However, we have used the term “combinator” informally to refer to complex terms as well. We make this use official now. A complex term that is built entirely from (primitive) combinators is called a combinator too. The solution of the previous exercise shows that combining primitive proper combinators does not always preserve the property of being proper. Indeed, it is quite easy to generate improper combinators this way. Example 1.2.5. C and I are both proper combinators, but CII is not. This particular combinator is interesting in the context of typed systems, because its principal type schema is ((A → A) → B) → B (i.e., specialized assertion), which is a theorem of classical propositional logic and a characteristic axiom of the logic of entailment.

1.3

Reductions and combinatory bases

The understanding of the structure of CL-terms as well as of some of their other syntactic features is vital to grasping CL. However, CL is more about relations between terms than about the terms themselves. We have used phrases such as “combinators cause changes in terms,” and such changes may be characterized by pairs of terms: the first term is the term in which the combinator is applied and the second term is the term that results. We can describe the axioms this way too, and then define one-step reduction. D EFINITION 1.3.1. If Z is an n -ary combinator, then a term of the form ZM1 . . . Mn is a redex. The head of this redex is Z , and M1 , . . . , Mn are its arguments. A redex may contain one or more combinators, because the terms that instantiate the meta-variables M1 , . . . , Mn may or may not have combinators and redexes in 8 This

combinator is sometimes labeled as “fixpoint” or “paradoxical” combinator. We hasten to point out that pure CL is consistent, and so the latter name might seem to cozen.


Chapter 1.

Elements of CL

13

them. Also, Z may occur several times in the term, but it surely occurs at least once. That is, the definition is to be understood to mean that the particular occurrence of Z that is apparent in the definition of a redex is the head of the redex. D EFINITION 1.3.2. (O NE - STEP REDUCTION ) Let Z be a primitive combinator with axiom Zx1 . . . xn B P . If N is a term with a subterm of the form ZM1 . . . Mn , and N 0 is N with that subterm replaced by [x1 /M1 , . . . , xn /Mn ]P , then N one-step reduces to N 0 . This is denoted by N B1 N 0 . The definition is not as complicated as it may first seem. We already (tacitly) used B1 in examples to illustrate various types of combinators. When we said that I(yz) yields yz , we applied one-step reduction. IM is a subterm of I(yz) with M standing for yz . In I ’s axiom, x (on the right-hand side of the B ) plays P ’s role in the above definition, and [x/yz]x is yz . Thus I(yz) B1 yz — it is really quite straightforward. Example 1.3.3. The term BWBx(BWBx) contains two redexes. The head of one of them is the first occurrence of B (counting from left to right); the head of the other is the third occurrence of B . Having chosen the second redex for one-step reduction, we get BWBx(BWBx) B1 BWBx(W(Bx)) . The latter term contains one redex only, and after one-step reducing that, we get W(Bx)(W(Bx)) . (This term also has a redex, because the one-step reduction created a new redex.) Exercise∗ 1.3.1. Consider the term S(KS)KSKS . Perform as many one-step reductions as possible in every possible order. (Hint: Write out the one-step reductions as sequences of terms.)

One-step reduction may yield a term with no redexes, and it may yield a term with one or more remaining or new redexes. A one-step reduction of a duplicator may increase the number of redexes — including the number of occurrences of some already existing redexes. In other words, the number of successive one-step reductions counts the number of reduced redexes, but this number does not necessarily equal the number of redexes in the starting term minus the number of redexes in the resulting term. The term BWBx(BWBx) (from example 1.3.3) has two redexes. Once the first redex from the left is reduced, the resulting term W(Bx)(BWBx) contains a brand new redex headed by W . Exercise 1.3.2. For each of the categories of combinators introduced in the previous

section, consider terms in which one of the redexes M has a head belonging to that category, and all the other redexes are wholly inside arguments of the head of M . Work out how the number of occurrences of the already existing redexes changes with the one-step reduction of M . Exercise∗ 1.3.3. Example 1.3.3 showed that one-step reduction may create new re-

dexes — not merely new occurrences of already existing redexes. Can combinators from each category create new redexes? (Hint: If “yes,” then describe the shapes of suitable terms before and after B1 .)


14


The sample one-step reductions we performed on BWBx(BWBx) show that redexes need not be reduced in the same order as they occur in a term from left to right. This suggests that we may define reduction strategies or reduction orders to have more control over the reduction process. One special order for reductions — proceeding from left to right — has a theoretical importance in connection to normal forms, as well as a practical significance in thinking about CL as modeling computation. Sequential programming languages force a linear order upon computational steps; hence, the implicitly nondeterministic view projected by definition 1.3.2 may not be always tenable. One-step reductions surely entice us to contemplate successive one-step reductions. Indeed, given all the combinators with their diverse effects, what we are really interested in is the compound outcome of their repeated applications. D EFINITION 1.3.4. (W EAK REDUCTION ) The reflexive transitive closure of the one-step reduction relation is weak reduction, and it is denoted by Bw . If R is a binary relation on a set A , then the reflexive closure of R , contains all pairs of elements of A of the form ha, ai , for all a ∈ A . Accordingly, the weak reduction relation holds between every CL-term and itself: M Bw M . A term that has no redexes does not one-step reduce to any term, yet it weakly reduces to itself. Terms M such that M B1 M are rare and exceptional. One example is MM . If R is a binary relation on a set A , then R+ , the transitive closure of R includes all pairs ha, ci in which the second element is “accessible” from the first one via finitely many R -steps. If Rab1 , . . . , Rbn c for some b1 , . . . , bn , then R+ ac . For CLterms, this means that M B1 N B1 P yields that M weakly reduces to P , that is, M Bw P . Zero intermediate steps (i.e., n = 0 ) are allowed too, which means that any one-step reduction is a weak reduction: M Bw N if M B1 N . The reflexive transitive closure of R is usually denoted by R∗ . Thus Bw is defined as B∗1 , but the usual notation is Bw . The idea that every function can be viewed as unary is not reflected by weak reduction, and that is why this relation is called “weak.” Neither the axioms for combinators nor one-step reduction gives any hint as to how to compute with a term in which a combinator is followed by fewer terms than its arity. For instance, we have no clue how to apply the axiom for S to a term of the form SMN . We will return to this issue later on and introduce other reductions. Weak reduction is the most naturally arising reduction in CL, and Bw takes a central place in the theory. In arithmetic, there is no need to worry about the order in which the arithmetic operations are calculated — as long as the groupings within the term are respected. For instance, (5 + 7) · (2 + 3) may be calculated stepwise as 12 · (2 + 3) or (5 + 7) · 5 , then the next step in both cases is 12 · 5 , and the final result is 60 . There are many other ways to calculate the final result if one throws in applications of various identities (or “algebraic laws”), such as distributivity of multiplication over addition. Then (5 + 7) · 5 = (5 · 5) + (7 · 5) , and further 25 + (7 · 5) = 25 + 35 , etc. But our concern was simply the order of performing arithmetical operations that are explicit in an expression.


Chapter 1.

Elements of CL

15

One might wonder whether the CL-terms exhibit similar behavior. The short answer is that they do. If a term N weakly reduces to P1 and P2 , then there is always a term M to which P1 and P2 both weakly reduce. This property is called the confluence of weak reduction. We will return to this result, which is called the Church–Rosser theorem, as well as to its proof, in the next section. The notion of a normal form would make sense without the confluence of weak reduction. However, the Church–Rosser theorem means that CL-terms are well-behaved; hence, normal forms are even more important. D EFINITION 1.3.5. (W EAK NORMAL FORM ) A term M is in weak normal form, in wnf (or in nf, for short), iff M contains no redexes. Weak reduction is reflexive, that is, M Bw M is always a possible “further” step in a sequence of weak reductions. One-step reduction is obviously not reflexive, and it is useful to have a reduction — weak reduction — that is not just transitive, but reflexive too. However, the steps that are justified by reflexivity may be likened to having a “skip” step that can be inserted into chains of calculations at any point. Thus the above definition delineates a subset of terms that do not yield a term under B1 . Some obvious examples of terms in nf include the variables and the primitive combinators, each considered by itself. Some complex terms are in weak nf too. xI and SK are in nf, just as B(WI)(BWB) is. It is immediate that there are denumerably many terms that are in nf, and there are denumerably many combinators that are in nf. Exercise 1.3.4. Prove — without assuming an infinite set of primitive constants —

that there are infinitely many ( ℵ0 -many) combinators that are in nf. (Hint: You may assume that at least S and K are among the primitives.) Exercise 1.3.5. Consider the combinators I , B , S , K , C , W , M , B0 , J and D to be

primitive. Is there a subset of these combinators that does not yield infinitely many combinators in nf? There are terms that in one or more steps reduce to themselves. Let us note first that II Bw I , which is nearly II except that a copy of I is missing from the term. Replacing the identity combinator with the duplicator M we get the term MM , and MM B1 MM — as we already noted above. Another example involves the combinator W in the term WWW . In general, any combinator that produces a left-associated term in which all arguments occur exactly once, except that one of the arguments is duplicated, can be used (possibly, together with I ) to create at least one term that reduces to itself. Such a term is WI(WI) , which produces a cycle via one-step reductions: WI(WI) B1 I(WI)(WI) B1 WI(WI) . We have taken into account all the redexes at each step. Therefore, WI(WI) Bw WI(WI) and WI(WI) Bw I(WI)(WI) , and there is no other term to which WI(WI) reduces. Of course, I(WI)(WI) Bw I(WI)(WI) , which is another term built from W and I such that it reduces to itself. Exercise∗ 1.3.6. Consider duplicators that yield a left-associated term with one argu-

ment being duplicated and all other arguments occurring exactly once. Prove that all


16


such duplicators (just as M and W above) are suitable to generate terms that reduce to themselves. (Hint: First, give a general description of the shape of the resulting term from the axiom of such combinators.) These examples show that a term may reduce to itself via one or more one-step reductions. To emphasize again, B1 is not a reflexive relation. However, there is a CL-term M (e.g., when M is in the set of combinatory constants) such that M B1 M . If the set of combinators is combinatorially complete (or at least includes M or W , etc.), then there is a CL-term M such that M Bw M via a nonempty sequence of B1 steps. This means that another — but equivalent — way to characterize weak normal forms would be to say that M is in weak normal form iff there is no term N , which may be the same as M , such that M B1 N . The above examples showed that MM B1 MM , but not WI(WI) B1 WI(WI) , though WI(WI) Bw WI(WI) . Of course, M can be defined as WI , and now we make this concept more precise. D EFINITION 1.3.6. Let Z be a combinator with axiom Zx1 . . . xn B M . The CL-term Z0 , which is built from (primitive) combinators, defines Z when Z0 x1 . . . xn Bw M . This definition involves B and Bw , which suggests that there may be a difference in one-step reduction sequences when we take a combinator as undefined or when we build it up (i.e., define it) from other primitives. Exercise 1.3.7. (a) Define B and C from S and K (only). (b) Define S from B , W , C and I . Exercise∗ 1.3.8. Show that J is definable from I , B , W and C , and the latter three are definable from the first two (i.e., J and I ).

It is obvious that the combinator K is not definable from the combinators I , B , S , C , W , M , B0 , J and Y . This suggests that it is important to make clear which combinators we assume to be available for us. Exercise∗ 1.3.9. Prove informally (or by structural induction) that K is not definable

from the other combinators mentioned in the previous paragraph. A set of combinators determines a set of combinators that are either in the set or definable from it, which makes the next definition useful. D EFINITION 1.3.7. Let B be a finite nonempty set of combinatory constants. B is called a basis. The set of CL-terms, given a basis, is defined as in definition 1.1.1, where the constants are those in the basis. Exercise 1.3.7 asked you to show that B and C are definable by CL-terms over the basis { S, K } , whereas exercise 1.3.8 asked you to show the equivalence of the combinatory bases { I, J } and { I, B, C, W } . Just as expected, two combinatory bases are equivalent iff all the combinators definable from one are definable from the other. Defining the primitive combinators of the


Chapter 1.

Elements of CL

17

other basis (in both directions) is obviously sufficient to prove the equivalence of two bases. Clearly, not all bases are equivalent, because K is not definable from { I, J } , for instance. The set of all possible combinators is infinite. To substantiate this claim we could simply consider all the identity combinators In (for all n ∈ N ) — there are ℵ0 many of them. An interesting question to ask is whether there is a basis, preferably containing some “natural” or “not-too-complicated” combinators, that allows us to build up all the possible combinators there are. D EFINITION 1.3.8. A combinatory basis is combinatorially complete iff for any function f such that f x1 . . . xn Bw M , where M is a CL-term built from some of the variables x1 , . . . , xn , there is a combinator Z in the basis or in the set of combinators definable from the basis such that Zx1 . . . xn Bw M . f may be thought of as if it were a proper combinator itself. However, combinatorial completeness could be defined more broadly to include certain types of improper combinators too. For example, occurrences of any proper combinator in M may be allowed. In fact, a fixed point combinator is definable from any basis that is combinatorially complete in the sense of the above definition. In fact, in the definition, M could be allowed to contain occurrences of f itself. The main purpose of the limitation to proper combinators in the definition is to exclude from our consideration all the weird improper combinators that introduce new variables into their reduct (i.e., into the term that results from an application of the combinator to sufficiently many variables). We will see in chapter 2 that a fixed point combinator is definable from S and K , which will underpin more firmly our thinking about combinatorial completeness as having a wider class of functions definable. (Cf. example 2.3.4, as well as the exercises 2.3.2 and 2.3.5.) L EMMA 1.3.9. The combinatory bases { S, K } , { I, B, C, W, K } and { I, J, K } are combinatorially complete. Proof: First, we outline the proof that the first basis is combinatorially complete. Then we collect the facts that show that the latter two bases are equivalent to the first. 1. The idea behind showing that S and K suffice is to define a pseudo- λ -abstraction. This is usually called bracket abstraction or λ∗ -abstraction.9 There are many ways to define a λ∗ operation, and in chapter 4, we will look at some of those. The way the λ∗ is defined determines its features; hence, it affects the properties of the transition from the λ -calculus to CL. At this point our goal is merely to show that any function, in the sense of definition 1.3.8, can be simulated by a combinator over the { S, K } basis. We introduce for the purpose of talking about functions such as f the notation [x]. M . The [x] is a meta-language λx , and the [ ] ’s around a variable motivate the 9 Sch¨ onfinkel’s

work preceded the formulation of the notion of an algorithm in a precise sense. Nevertheless, the steps in the elimination of bound variables described in his paper may be seen to amount to a bracket abstraction algorithm.


18


name “the bracket abstraction.” M may or may not contain an occurrence of x , and [x]. M is interpreted as the function that returns MxN when applied to N . ( MxN is M itself if x ∈ / fv(M) .10 ) If f is an n -ary function, and so f (x1 , . . . , xn ) = M , where M is a term over the set of variables { x1 , . . . , xn } , then to find a suitable combinator we iteratively form [x1 ] . . . [xn ]. f (x1 , . . . , xn ) , which is just f , and on the other side of the equation we form [x1 ] . . . [xn ]. M . We apply the algorithm below starting with xn and M . The shape of the resulting combinatory term depends on the concrete M , hence, as a general notation, we denote the result by [xn ]. M . If n > 1 , then the next variable is xn−1 and the term to which the algorithm is applied is [xn ]. M , etc. (Because of the structure of the algorithm together with the finiteness of CL-terms, the recursion is well-founded.) (1) [xi ]. M 0 is SKK , if M 0 is xi ; (2) [xi ]. M 0 is KM 0 , if xi does not occur in M 0 (i.e., xi ∈ / fv(M 0 ) ); (3) [xi ]. M 0 is S([xi ]. N)([xi ]. P) , if M 0 is NP . We think of clauses (1)–(3) as numbered and ordered. If there are two clauses that are both applicable, then the earlier one is applied. Incidentally, (1) and (2) are never both applicable to a CL-term, and the same is true of (1) and (3). However, (3) could be applied to SKK , for example, giving S([xi ]. SK)([xi ]. K) . If we do not want to rely on the order of the clauses, then xi ∈ fv(NP) may be added as a proviso to (3). After each of x1 , . . . , xn has been abstracted, we have [x1 ] . . . [xn ]. M , which is the combinator for f . To show that this is really the term that can be taken for f , we show by induction that each subterm behaves as desired. If the subterm is xi , and this is the variable that is being abstracted, then after an application to the term N we have to get N , and SKKN Bw N . The other base case is when M 0 does not contain xi . Then the function should return M 0 itself for any N , and KM 0 N Bw M 0 . If xi occurs in N or P when the term is (NP) , then by the hypothesis of the induction, we assume that [xi ]. N and [xi ]. P are the CL-terms corresponding to N ’s and P ’s xi abstracts. Then by applying S([xi ]. N)([xi ]. P) to Q , we get ([xi ]. NQ)([xi ]. PQ) , as desired. 2. First, we note that the latter two bases are equivalent due to the results in exercise 1.3.8. Supplementing exercise 1.3.7 with two definitions, namely, SKK for I and S(CI) for W , the equivalence of the first two bases follows. S and K can define any f , and the combinators in the two other bases suffice too. qed Definition 1.3.6 made precise the notion of defining a combinator from other combinators. The above lemma then implies that any proper combinator is definable 10 We

are cheating here a bit, because we have not yet defined substitution for λ -abstraction-like expressions. However, [x]. M eventually will turn out to be a combinator, so this small gap is harmless. — We use the usual notation fv to denote the set of free variables of a term. See definition A.1.12 in the Appendix.


Chapter 1.

Elements of CL

19

from the basis { S, K } . The combinatorial completeness of this basis and clear informal interpretation of S and K explain why these are the best-known combinators. You have surely discovered that B is definable as S(KS)K (which is a solution to a question in exercise 1.3.7). Now we look at the above procedure to find a definition of B , where we think of this combinator as the function f . (We take x , y and z to be x1 , x2 and x3 , that is, Bx1 x2 x3 B x1 (x2 x3 ) , but we continue to write x, y, z for the sake of brevity.) Example 1.3.10. The resulting term is x(yz) , and in the first round, we want to find the CL-term for [z]. x(yz) . z ∈ fv(x(yz)) , so (2) is not applicable, but neither is (1), because the term is not simply z . Then by (3), we get S([z]. x)([z]. yz) . However, we are not finished yet, because there are two [z] ’s left. [z]. x turns into Kx , by (2), and [z]. yz yields S([z]. y)([z].z) . Having put the pieces together, we obtain S(Kx)(S([z]. y)([z]. z)) . Now we have gotten two [z] ’s again, but, of course, now they are prefixed to different subterms than before. The finiteness of the subterms terminates the abstraction of [z] , since [z]. y gives Ky and [z]. z gives SKK , by (2) and (1), respectively. Having gathered the bits together, we can see that the meta-term [z]. x(yz) refers to the CL-term S(Kx)(S(Ky)(SKK)) . Before we turn to the next abstraction, it may be helpful to emphasize that S(Kx) (S(Ky)(SKK)) contains no occurrences of z or of [z] . Of course, [z] is a metalanguage λ , and so [z]. x(yz) contains only bound occurrences of z — both in [z] and in the term x(yz) . Another name for bound variables is apparent variables (as distinguished from real variables). The CL-term S(Kx)(S(Ky)(SKK)) makes the “nonreal” character of z transparent. The next round is to find [y][z]. x(yz) , where [z]. x(yz) is the pure CL-term that we already have: S(Kx)(S(Ky)(SKK)) . That is, we want to find the CL-term that the meta-term [y]. S(Kx)(S(Ky)(SKK)) denotes. Now we list — without detailed justifications — the meta-terms that successively result, and finally the CL-term itself. (1) S([y]. S(Kx))([y]. S(Ky)(SKK)) (2) S(K(S(Kx)))(S([y]. S(Ky))([y]. SKK)) (3) S(K(S(Kx)))(S(S([y]. S)([y]. Ky))(K(SKK))) (4) S(K(S(Kx)))(S(S(KS)(S([y]. K)([y]. y)))(K(SKK))) (5) S(K(S(Kx)))(S(S(KS)(S(KK)(SKK)))(K(SKK))) The CL-term in (5) is [y][z]. x(yz) . The next round is to find [x][y][z]. x(yz) , where [y][z]. x(yz) is the just-mentioned CL-term. Exercise 1.3.10. Finish the example, that is, find the CL-term denoted by the metaterm [x]. S(K(S(Kx)))(S(S(KS)(S(KK)(SKK)))(K(SKK))) . (Hint: You should finally get a CL-term with 14 occurrences of S and 17 occurrences of K .)

It is already clear from the example, but even more from the exercise, that the term that results by the algorithm in the proof of lemma 1.3.9 is not S(KS)K . We could


20


obtain that term along the lines of the algorithm, if we would take some shortcuts, for instance, simply replacing [z]. yz by y . Recall that CL-terms are interpreted as functions. z ∈ / fv(y) , therefore, y as a function followed by an argument is yN , and [z]. yz followed by an argument is ([z]. yz)N , which we stipulated (by a meta-language β reduction) to be [z/N] yz , which is yN . Having applied the above algorithm, we would get the CL-term S(Ky)(SKK) . Once this term is applied to N , we have a redex; thus, S(Ky)(SKK)N Bw KyN(SKKN) . The two new redexes yield y and N , respectively. In sum, S(Ky)(SKK)N Bw yN too. With this insight, we want to find again [x][y][z]. x(yz) . First, we get [x][y]. S([z]. x) ([z]. yz) ; then we apply (1) and our shortcut to get [x][y]. S(Kx)y . The next step is another shortcut step, leading to [x]. S(Kx) . Then we get S([x]. S)([x]. Kx) , and by (2) and a shortcut, we get S(KS)K . The step that we labeled “shortcut” here will be called η in the λ -calculus in chapter 4. η may be thought of as an extensionality step, because we do not distinguish between [x]. Mx and M itself, when x ∈ / fv(M) . An informal rendering of the same abstraction process, which incorporates some heuristics about taking into account the effect of the combinators S and K , goes like this. We try to abstract z , and we know that SMNz Bw Mz(Nz) . We could prefix S to the term x(yz) if x would be followed by z too, as in xz(yz) . But to insert a dummy variable, we can use K , because KMz Bw M . That is, Kxz(yz) Bw x(yz) , and S(Kx)yz Bw Kxz(yz) . S(Kx)yz is a left-associated term, and z is in the last argument place, so as the next move we just drop it. But the same is true for S(Kx)y with respect to y — we drop that variable too. S(Kx) is very similar to x(yz) , if we look at x as S , y as K and z as x . So we might take instead KSx(Kx) (since KSx(Kx) Bw S(Kx) ), and then S(KS)Kx , and finally we drop x . The example and the exercise show that the algorithm is not guaranteed to produce the shortest possible definition for a function, but it surely produces one. In fact, the above algorithm typically yields quite a lengthy term. Shorter terms may be obtained by including η , as well as by expanding the combinatory basis and replacing (3) with several other more refined clauses. (See chapter 4 for details.) In arithmetic and in elementary mathematics, there is a weaker relation (than computing the value of a function) that is commonly used, namely, equality. For an illustration, let us consider 25 · 35 . Performing the exponentiations first, the expression computes to 32 · 243 , which further yields 7, 776 . However, instead of 25 · 35 7→ 7, 776 (which is, probably, not even a standard or widely used notation), simply 25 · 35 = 7, 776 is written. Sometimes, for instance, for encryption protocols to work, it is interesting that given a positive integer — such as 7, 776 — that number can be factored into primes.11 As the numerical example suggests, we can consider the converse of weak reduction, possibly, combined with Bw itself. 11 There

is a certain similarity between the lemma 1.3.9 and the prime factorization theorem in the sense that both yield an expression that computes to the given term or number. A dissimilarity is that there are only two primitive combinators ( S and K) , whereas there are infinitely many primes.


Chapter 1.

21

Elements of CL

D EFINITION 1.3.11. (O NE - STEP EXPANSION ) If M B1 N , then [N/M]P , that is, the replacement of an occurrence of N in P by M is a one-step expansion of P . We will use the notation P 1 C [N/M]P for one-step expansion. Example 1.3.12. The CL-term xx can be one-step expanded to any of the following terms. Ixx , x(Ix) , I(xx) , Mx , Kxyx , K(xx)y , Kxxx , etc. It might seem that expansion is completely arbitrary, but of course, it is not. The apparent arbitrariness is the result of the disappearance of the head of the reduced redex. B1 leaves few clues about the redex that is gone; hence, the converse step allows much freedom in creating a redex. D EFINITION 1.3.13. (W EAK EXPANSION ) The reflexive and transitive closure of one-step expansion is the weak expansion relation on the set of CL-terms, which is denoted by w C . Exercise∗ 1.3.11. Prove that weak expansion is the converse of weak reduction. That

is, as we have suggested by the choice of notation, M Bw N iff N w C M . Equality on numbers and other equality-like relations are equivalence relations, that is, they are reflexive, transitive and symmetric. The relation Bw is, obviously, not symmetric; neither is weak expansion symmetric. D EFINITION 1.3.14. (W EAK EQUALITY ) The transitive reflexive symmetric closure of B1 , the one-step reduction relation is weak equality, which is denoted by =w . Weak equality may be inductively characterized by (1)–(4). (1) If M B1 N , then M =w N ; (2) if M is a CL-term, then M =w M ; (3) if M =w N , then N =w M ; (4) if M =w N and N =w P , then M =w P . The last clause may be put succinctly as =+ w ⊆ =w , where closure of a binary relation.

+

denotes the transitive

Exercise 1.3.12. Verify that =w is the transitive symmetric closure of Bw . (Hint:

=w above is characterized starting with B1 in (1), and so is Bw in definition 1.3.4.) Weak reduction is a stronger relation than weak equality in the sense that there are ordered pairs of terms that belong to =w but not to Bw . For example, hx, Kxyi is in the =w relation (i.e., x =w Kxy ), but not in the Bw relation (i.e., x 6Bw Kxy ). The relationship between the binary relations we have so far on the set of CL-terms is B1 ( Bw ( =w . We have shown that both inclusions are proper (as the symbol ( indicates), but we might wonder now whether we have too many pairs included in =w . Perhaps,


22


all CL-terms are weakly equal to each other; that is, =w is the total relation on the set of CL-terms. In fact, not all terms are weakly equal, and this is what consistency means for CL. We will prove this and other consistency theorems in chapter 2. Not only is the weak equality relation not the total relation, but we can keep adding pairs of terms to it. We briefly mentioned η , which we justified by S(KM)(SKK)N weakly reducing to MN . In effect, the shortcut allowed us to identify M and S(KM)(SKK) by an appeal to what happens when these terms are applied to a term N . In a similar fashion, definition 1.3.6 says that a combinator Z is defined by a (compound) combinator Z0 if the application of Z0 to sufficiently many arguments yields the same term as the application of Z (to the same arguments) does. As yet another example, we may consider SKK and SKS . The two terms neither are the same nor weakly reduce to each other (or to any other term, for that matter) — they are in wnf. However, SKKx Bw x and SKSx Bw x . (It is not difficult to see that any other combinator would do in the place of the second occurrence of S , without affecting the result of weak reduction.) D EFINITION 1.3.15. (E XTENSIONAL WEAK EQUALITY, 1) [M1 /N1 , . . . , Mm /Nm ]R and R are extensionally weakly equal, denoted by [M1 /N1 , . . . , Mm /Nm ]R =wζ R , iff for each pair of terms Mi and Ni (where 1 ≤ i ≤ m ∈ N ), there is an ni (where ni ∈ N ) such that (1) holds. (1) For all terms Pi,1 , . . . , Pi,ni , there is a Qi such that Mi Pi,1 . . . Pi,ni Bw Qi and Ni Pi,1 . . . Pi,ni Bw Qi . Extensionality means that the shapes of the CL-terms, or the exact reduction steps are disregarded — as long as the end result remains the same. The name for this equality is a bit lengthy, and perhaps even cumbersome; thus, we will tend to use =wζ instead. The reason to use yet another Greek letter is that, roughly speaking, η is an example of extensionality, but not a sufficiently general one. In chapter 5, we add the rule ext to EQB1 . (This rule is sometimes labeled by ζ instead of ext .) If we would add a rule based on η to the same calculus, then a weaker system would result. It may be useful to note that the definition stipulates that M and N reduce to the same term whenever they are applied to the same terms P1 , . . . , Pn . We already saw in the discussion of associators that, if a combinator is n -ary, then forming the term with x1 , . . . , xn , . . . , xn+m as arguments gives a term by weak reduction in which xn+1 , . . . , xn+m remain unaffected. Thus, BP1 does not contain a redex headed by B . However, for n = 3 , BP1 P2 P3 Bw P1 (P2 P3 ) and so does S(KS)KP1 P2 P3 . Adding further terms, P4 , P5 , . . . , does not prevent the two terms from reducing to the same term. That is, the existence of some n is sufficient for the existence of infinitely many (larger) n ’s, for which the defining condition in definition 1.3.15 holds. The P ’s in the definition are arbitrary. But in the illustrations, we looked only at what happens when two terms are applied to x or x1 , . . . , xn . However, our choice of these variables represented another sort of generality: none of them occurred in the terms like SKS or S(KS)K (the definitions for I and B ). In fact, the following definition yields the same concept.


Chapter 1.

Elements of CL

23

D EFINITION 1.3.16. (E XTENSIONAL WEAK EQUALITY, 2) Q and [M1 /N1 , . . . , Mm /Nm ]Q are extensionally weakly equal, denoted by Q =wζ [M1 /N1 , . . . , Mm /Nm ]Q , iff for each hMi , Ni i (where 1 ≤ i ≤ m ∈ N ), there is an ni (where ni ∈ N ) such that (1) is true. (1) For a series of distinct variables xi,1 , . . . , xi,ni that do not occur in Mi or Ni (i.e., xi,1 , . . . , xi,ni ∈ / fv(Mi ) ∪ fv(Ni ) ), there is a Pi with Mi xi,1 . . . xi,ni Bw Pi and Ni xi,1 . . . xi,ni Bw Pi . Exercise∗∗ 1.3.13. Prove that the relations introduced in definitions 1.3.15 and 1.3.16 are the same relation on the set of CL-terms. (Hint: One direction is nearly trivial.)

In the case of =w , we first introduced a reduction relation Bw that was not symmetric (not even antisymmetric), and then we took the transitive symmetric closure of Bw to get =w . Both definitions 1.3.15 and 1.3.16 are, obviously, symmetric in M and N . There seems to be no reasonable way to carve out a reduction-like relation from either definition. Mx1 . . . xn Bw P does not specify the shape of P , and if we require Mx1 . . . xn Bw Px1 . . . xn for M to reduce to P in some sense, then we get a rather restricted notion. The algorithm to define bracket abstraction provides an alternative approach. The interesting cases of M =wζ N are when M and N are combinators, and they define the same function with respect to their input–output pairs. This suggests that if we fix a particular algorithm to define bracket abstraction, then that would provide a way to standardize combinators. Example 1.3.17. Let us consider the CL-term SK(KK) . SK(KK)x Bw x and so does Ix , as well as SKKx . Of course, these three combinators are not literally (letter by letter) the same, and they are not weakly equal either. However, we have SK(KK) =wζ I =wζ SKK . For each of these three combinators, there are infinitely many other combinators that are =wζ to it, but one of all those combinators plays a distinguished role. SKK is the CL-term denoted by [x]. x , when we assume the algorithm in the proof of lemma 1.3.9. For any combinator Z , given the fixed bracket abstraction algorithm, if Zx B x then the standard version of Z is SKK , because Z is just the unary identity combinator — extensionally speaking. The idea of the standard (or canonical) form for a combinator makes sense only in the extensional context. (Otherwise SK(KK) , I and SKK are simply distinct combinators.) The possibility of selecting a distinguished element of each =wζ equivalence class allows a reasonable definition of a reduction relation that is related to =wζ . D EFINITION 1.3.18. (S TRONG REDUCTION ) Let us assume that a bracket abstraction algorithm has been specified.12 The binary relation on the set of CL-terms called strong reduction, and denoted by Bs , is inductively defined by (1)–(3). 12 For

concreteness, we assume that the algorithm is the one defined in the proof of lemma 1.3.9 with η included. In the literature, sometimes the combinatory basis is expanded to { I, S, K } and SKK in (1) is replaced by I .


24


(1) M Bs N , if M Bw N ; (2) [x]. M Bs [x]. N , if M Bs N ; (3) P Bs [M1 /N1 , . . . , Mm /Nm ]P , if M1 Bs N1 , . . . , Mm Bs Nm . Strong reduction is a weaker relation, in the set theoretic sense, than weak reduction is.13 Obviously, every pair of CL-terms that is in Bw is in Bs by clause (1). But we also have SKS Bs SKK and I Bs SKK , though no Bw holds in place of Bs . Example 1.3.19. Bx =wζ S(KS)Kx , because after the addition of y and z to the terms they both reduce to x(yz) . Bxyz Bw x(yz) , so, by (1), Bxyz Bs x(yz) . Repeated applications of (2) give [z]. Bxyz Bs [z]. x(yz) , [y] [z]. Bxyz Bs [y] [z]. x(yz) and [x] [y] [z]. Bxyz Bs [x] [y] [z]. x(yz) . But [x] [y] [z]. Bxyz is just B and [x] [y] [z]. x(yz) is S(KS)K (when η is included). That is, B Bs S(KS)K , and S(KS)K Bs S(KS)K . In other words, S(KS)K is the standard form of B (modulo the stipulated bracket abstraction algorithm). Example 1.3.20. SK(KK) =wζ SKS , because SK(KK)x Bw x and also SKSx Bw x . However, SK(KK) 6Bw SKS , and SKS 6Bw SK(KK) . Since [x]. x is neither SK(KK) nor SKS ; neither of these two combinators strongly reduces to the other. (Strictly speaking, we would need to scrutinize (3) too, but neither S nor K strongly reduces to anything but itself, so there is not much wiggle room for replacement.) The relationship between the reduction-like relations is B1 ( Bw ( Bs . Strong reduction is reflexive, because Bw is reflexive (already). Therefore, for any term M , there is at least one term to which M strongly reduces. Weak normal forms are defined in 1.3.5, and there we used the absence of redexes in a term. However, a Bs step does not always involve a redex; thus, neither does the next definition. D EFINITION 1.3.21. (S TRONG NORMAL FORM ) A CL-term M is in strong normal form, or in snf for short, iff M Bs N only if N is the same CL-term as M . Example 1.3.22. The term SKK is in snf (and also in wnf). On the other hand, SKS is not in snf (though in wnf). All the variables are in snf, and S and K are in snf due to the inclusion of η . Exercise 1.3.14. SK and K(K(SK)) are in wnf. However, they are not in snf. Prove

this claim by finding the snf’s for these terms. It is tempting now to quickly conclude that both normal forms (the wnf and the snf) can be characterized by saying that the respective reduction relations have a 13 The

names of these relations are, probably, motivated by the use of “strength” to connote multiplicity or a large amount.


Chapter 1.

Elements of CL

25

“dead end loop” on the term that is in nf. However, M Bw N iff N is M does not imply that M is in wnf (at least if no restriction is placed on the combinatory basis). We have seen that Bw and =w depend on the set of combinators chosen. However, the set of all CL-terms is also dependent on the combinatory basis in the same way. Strong reduction differs from each of B1 , Bw , =w and =wζ in that it also depends on an algorithm that can be defined in various ways even if a combinatory basis has already been selected. Bs is really a family of relations united by resemblance. A remarkable feature of =wζ is that definition 1.3.15 (or definition 1.3.16) can be replaced by a (small) finite set of additional equalities. This means that instead of doing one-step reductions on terms with sufficiently many new variables put into argument places, one can take =w and replace certain subterms comprising combinators by other subterms (comprising combinators). Depending on the combinatory basis, different sets of axioms suffice. It is not difficult (though somewhat laborious) to verify that the equalities hold; we forecast this by using =wζ in them. However, to show that, if two terms are =wζ , then that equality may be obtained using replacements according to the given equations (and given =w ), requires a suitable bracket abstraction algorithm. This explains why the axiom sets are usually presented in connection with an algorithm, which at the same time “explains” the shape of the sometimes lengthy terms in the equalities. Let us assume that the combinatory basis is { S, K } . Axioms (A1)–(A6) added to =w yield =wζ .14 (A1) K =wζ S(S(KS)(S(KK)K))(K(S(KK))) (A2) S =wζ S(S(KS)(S(K(S(KS)))(S(K(S(KK)))S)))(K(K(SKK))) (A3) S(KK) =wζ S(S(KS)(S(KK)(S(KS)K)))(KK) (A4) S(KS)(S(KK)) =wζ S(KK)(S(S(KS)(S(KK)(SKK)))(K(SKK))) (A5) S(K(S(KS)))(S(KS)(S(KS))) =wζ S(S(KS)(S(KK)(S(KS)(S(K(S(KS)))S))))(KS) (A6) SKK =wζ S(S(KS)K)(K(SKK)) Exercise∗∗ 1.3.15. Verify that the combinators in the equations weakly reduce to the

same term once sufficiently many (distinct) variables have been added in argument places. If the combinatory basis also includes I , that is, if it is { I, S, K } , then axioms (A1)–(A5) added to =w give =wζ . (A1) S(S(KS)(S(KK)(S(KS)K)))(KK) =wζ S(KK) 14 (A1)

and (A2) are redundant if we allow shortcuts, that is, if η is included in the definition of the bracket abstraction algorithm.


26


(A2) S(S(KS)K)(KI) =wζ I (A3) S(KI) =wζ I (A4) S(KS)(S(KK)) =wζ K (A5) S(K(S(KS)))(S(KS)(S(KS))) =wζ S(S(KS)(S(KK)(S(KS)(S(K(S(KS)))S))))(KS) Exercise∗ 1.3.16. Show that (A1)–(A5) hold according to definition 1.3.16. (Hint:

This exercise is similar to 1.3.15 with a different axiom system.) Before we introduce one of the earliest axiom sets, we need to present some new combinators. S is called the strong composition combinator, because it is informally interpreted as taking the value of two functions for the same argument and applying the first to the second: S f gx B f x(gx) . There are other ways to compose functions and the next definition adds infinitely many combinators that are similarly motivated. D EFINITION 1.3.23. (C OMPOSITION COMBINATORS ) . . . , Φn (for n > 1 ) are defined by (1)–(4).

The combinators Ψ , Φ ,

(1) Ψxyzv B x(yz)(yv) (2) Φxyzv B x(yv)(zv) (3) Φ2 is Φ (4) Φn xy1 . . . yn z B x(y1 z) . . . (yn z)

(where n ≥ 2 )

Example 1.3.24. If we use f , g , etc., to emphasize that we are dealing with functions, then we see that Ψfgxy Bw f (gx)(gy) , whereas Φfghx Bw f (gx)(hx) . Exercise∗ 1.3.17. Suppose a combinatory basis that contains at least B , K and Φ .

Find a definition for Ψ . Exercise 1.3.18. The Φn ’s are definable from the basis { B, S } . Define Φ3 , which has as its axiom Φ3 xy1 y2 y3 z B x(y1 z)(y2 z)(y3 z) . Exercise 1.3.19. Find snf’s for Φ and Ψ . (Hint: Use the algorithm in the proof of

lemma 1.3.9 together with η .) Let us assume that the combinatory basis is { I, S, K, B, Z3 , Ψ, Φ2 , Φ3 } . In order to obtain =wζ , (A1)–(A6) are added to =w .15 (A1) Φ2 K =wζ BK(SB(KI)) (A2) Φ3 S =wζ Ψ(Φ2 S)S 15 Z

2 3 is the combinator from exercise 1.2.2; another notation for this combinator is B . (A6) is in fact redundant.


Chapter 1.

Elements of CL

27

(A3) ΨSK =wζ BK (A4) B(SB(KI))K =wζ K (A5) Z3 (SB(KI))S =wζ S (A6) SB(KI) =wζ I Exercise∗ 1.3.20. Show that axioms (A1)–(A6) hold according to definition 1.3.16.

(Hint: This exercise is similar to exercises 1.3.15 and 1.3.16 save the set of axioms.) If we only consider Bw on the set of CL-terms, then it is easy to see that there are terms that do not reduce to one another. None of the variables reduces to any other term, nor do K and S weakly reduce to each other. It is also nearly obvious that there is no term that can reduce to all terms. In the presence of a cancellator, some subterms (beyond heads of reduced redexes) may disappear. What we have so far does not make obvious that, for instance, there is no term that reduces to both x and y (where we suppose that those are distinct variables). Even so, it follows from the finitude of terms that no term contains infinitely many variables. Therefore, as long as the combinatory basis we start with comprises proper combinators only, there cannot exist a universal term in the set of the CL-terms. In the early 20th century, many new paradoxes were discovered. They discredited various systems (or at least made their reliability highly questionable). It is, therefore, interesting and important to ensure that CL with =w and =wζ is consistent. We have already claimed consistency, and the next chapter gives a proof of that claim together with other theorems.


This page intentionally left blank

Chapter 2 Main theorems

We take for granted in everyday practice that the number systems we use — like the real numbers with + , − , · and / — are reliable and stable. Of course, we sometimes make mistakes adding or dividing numbers, but we know that if 5 + 7 = 12 today, the same is true tomorrow, and this is why we can correct the person who claims that the sum is 11 . + , − , · and / are functions, and so for any pair of numbers they give a unique value. That is, an application of these operations cannot result in both n and m — what would lead to n = m — if n and m are distinct numbers. Moreover, it is widely believed that no such equations will emerge from calculating with numerical functions; that is, the theory of such functions is consistent. In the case of a formalized theory, such as Peano arithmetic (PA), this property can be formalized as “ 0 = 1 is not provable” (in PA).1 A similar question may be asked concerning CL: Is there an equation (with =w or even =wζ ) between CL-terms that does not hold? In this chapter, one of the paramount results is that CL is consistent. We give a rigorous proof of this with =w — though we do not aim at formalizing the notion of consistency or the proof in CL itself.

2.1

Church–Rosser property

Given an arithmetical expression, the order of calculating the values of subexpressions does not matter. For example, (5 + 7) · (2 + 2) can be computed in various ways. We could first calculate 2 + 2 to get (5 + 7) · 4 , or we could start with 5 + 7 to get 12 · (2 + 2) . Using the distributivity of · over + we could even start with the multiplication to obtain 5 · 2 + 7 · 2 + 5 · 2 + 7 · 2 .2 Each calculation may be continued in more than one way, as, for example, 12 · 4 or 5 · 4 + 7 · 4 in the first case. However, all the potential ways to compute the value of the term yield the same number, namely, 48 . The first relation from CL that is likely to come to mind based on the above example is weak equality ( =w ). However, weak reduction ( Bw ) is more fundamental 1A

celebrated result of 20th-century logic is that PA cannot prove its own consistency, provided PA is consistent, which is Gödel’s so-called second incompleteness theorem for PA. 2 Allowing distributivity to be used may be thought to be similar to making a replacement according to =wζ .


30


and is easier to deal with. Also, Bw is more similar to computing the value of an arithmetical expression that =w is. D EFINITION 2.1.1. (C HURCH –ROSSER PROPERTY ) A binary relation R (on the set X ) has the Church–Rosser property or is confluent iff Rxy1 and Rxy2 imply that Ry1 z and Ry2 z for some z . The property is named after Alonzo Church and Barkley Rosser, who gave proofs that this property holds for certain relations in λ -calculus and CL. Yet another name for confluence is the diamond property.3 The definition is general: X may be a set of arbitrary objects. For instance, X could be the set of algebraic expressions (perhaps, containing some functions), and R could be the relation on the set of expressions obtained via calculating the value of functions. The numerical expressions above were intended to illustrate that this R is confluent. In term rewriting systems, X is a set of abstract objects called terms and R is a relation called rewriting. We restrict our attention here to binary relations on CL-terms, but we note a general fact about the Church–Rosser property. L EMMA 2.1.2. If R is a symmetric relation on X , then, R has the Church–Rosser property. Proof: If Rxy and Rxz , then by the symmetry of R , Ryx and Rzx .

qed

The proof shows that confluence is trivial for symmetric relations, because x and z in definition 2.1.1 need not be distinct. The moral of the lemma is that we need to wonder about the confluence of the reduction-like relations only. P ROPOSITION 2.1.3. (O NE - STEP REDUCTION )

The B1 relation on the set of

CL-terms does not have the Church–Rosser property.

Proof: It is easy to prove this claim: we only need a counterexample. Here is a (relatively) simple term that suffices: Sxy(Sxyz) . The term contains two redexes and the two possible one-step reductions give x(Sxyz)(y(Sxyz)) and Sxy(xz(yz)) , respectively. From the latter term, all we can get by one-step reduction is a term with no combinator in it. We cannot get such a term from the former term in one step. In sum, we have the following possible sequences of one-step reductions. 1. Sxy(Sxyz) B1 Sxy(xz(yz)) B1 x(xz(yz))(y(xz(yz))) 2. Sxy(Sxyz) B1 x(Sxyz)(y(Sxyz)) B1 x(xz(yz))(y(Sxyz)) B1 x(xz(yz))(y(xz(yz))) 3. Sxy(Sxyz) B1 x(Sxyz)(y(Sxyz)) B1 x(Sxyz)(y(xz(yz))) B1 x(xz(yz))(y(xz(yz))) qed

3 The

three expressions “Church–Rosser property,” “confluence” and “diamond property” are not always used synonymously, especially, in the literature on abstract term rewriting systems, but we use them interchangeably. A compendium on TRSs is Terese [].


Chapter 2.

Main theorems

31

Notice that definition 2.1.1 does not require y1 and y2 to be distinct (either). Moreover, it does not require that Rxy holds for any y at all.4 If a CL-term does not contain a redex, then the antecedent of the conditional (i.e., Rxy1 ∧ Rxy2 ) is false; hence, the term surely cannot be used to prove the lack of confluence. If a term contains just one redex, then, depending on the structure of the term, it may or may not be suitable for showing the lack of confluence for B1 . Exercise 2.1.1. Choose a CL-term containing one redex, and give another proof of

proposition 2.1.3 with that term. There are many CL-terms with redexes in them, such that all one-step reductions lead to terms that further reduce to a common term in one step. For example, S(Sxyz)(Sxyz)z contains three redexes, and after any pair of B1 steps there is a common term reachable via just one one-step reduction. Exercise 2.1.2. Write out all the possible one-step reduction sequences starting with the term S(Sxyz)(Sxyz)z . Exercise 2.1.3. Consider the complex-looking term K(S(KSK)(KKS)S)K . Is this term suitable for showing that B1 is not confluent? How many distinct terms can be obtained from K(S(KSK)(KKS)S)K by successive applications of B1 ? Do the onestep reduction sequences terminate?

A prototypical failure of the diamond property for B1 may be described as follows (illustrated by the term used in the proof of proposition 2.1.3). If Z is a duplicator for its j th argument place, then we can form a term comprising a redex with Z where the j th argument contains a redex. A one-step reduction may be applied to the redex in the j th argument place or to Z . No further one-step reduction leads to a common term. An interesting exception to this general pattern may be constructed using the combinator M , which is a duplicator for its only argument. M(MM) contains two redexes, and can be one-step reduced to both MM(MM) and to itself. However, MM(MM) B1 MM(MM) and M(MM) B1 MM(MM) , which shows confluence. Of course, if we do not require the term to be a combinator, or we allow another combinator beyond M to be included, then we can construct terms (e.g., M(Mx) or M(MI) ) showing the lack of confluence. P ROPOSITION 2.1.4. If the combinatory basis B does not include a duplicator or a cancellator, then B1 is confluent on the set of CL-terms with at least two redexes over B (with or without a denumerable set of variables). Exercise∗ 2.1.4. Prove this proposition. (Hint: It may be useful to consider separately

the case where the reduced redexes overlap and the case where they do not.) 4 The

Church–Rosser property, as defined in 2.1.1, could be formalized by the first-order sentence: ∀x ∀y1 ∀y2 ((Rxy1 ∧ Rxy2 ) ⇒ ∃z (Ry1 z ∧ Ry2 z)) . The ∀ ’s are universal quantifiers, whereas ∃ is an existential quantifier. In the natural language formulation of the definition, the universal quantifiers are implicit.


32


Exercise 2.1.5. Suppose that we can introduce a constant for any combinator definable from the basis { S, K } . For example, S(KS)Kxyz Bw x(yz) , as we saw in chapter 1. Then we may introduce the constant B (as we did earlier) with axiom Bxyz B x(yz) . Demonstrate that for any n ( n ∈ N ) there is a CL-term M such that M B1 N1 and

M B1 N2 and then more than n one-step reductions are needed to arrive at a common term from N1 (or N2 ). The following theorem motivates our interest in the confluence of one-step reduction. T HEOREM 2.1.5. Let R be a binary relation on the set X . If R has the diamond property then R+ , the transitive closure of R , has the diamond property. Proof: The transitive closure of a relation may be described informally by saying that R+ xy means that there is a finite (nonempty) path along R edges leading from x to y . (See also the discussion after definition 1.3.4 and section A.2.) Let us assume that R+ xy1 and R+ xy2 . Then there are positive integers m and n (i.e., m, n ∈ Z+ ) such that Rm xy1 and Rn xy2 , that is, y1 and y2 are, respectively, m and n steps away from x .5 If both m and n are 1 , then, by the assumption of the theorem, there is a z such that both Ry1 z and Ry2 z . If m or n is not 1 , then the path may be visualized — by writing the first arguments of the R ’s first and conflating the expressions — as xRw1 Rw2 . . . wm−1 Ry1 and xRv1 Rv2 . . . vn−1 Ry2 . Since R is confluent, there is some u1 such that Rv1 u1 and Rw1 u1 . Depending on whether m > 1 or n > 1 , successive applications — m × n many times — of the confluence of the relation R yield um·n with the property that Rn y1 um·n and Rm y2 um·n . qed •x

....... .... ....... .... .... .... .... . . . ..... ....... ......... ....... . .. ... . .. .. . .. . . .. . .. .. .. ..... ....... .......... .. . . . . . . ... ... .. . . .. 1 .. .. .. 1 .. .. ..... .. ....... .. .. .. .. .. . . .. . .. .. .. .. .. .. . .. . ..... ....... ....... ...... ...

•

y•

•

• u

• y2

um·n •

Exercise 2.1.6. Suppose that m, n > 1 in the preceding proof. Devise a systematic

way of applying the assumption of the theorem to generate all the u ’s up to um·n . (Hint: The above graph is an illustration that might be helpful.) One-step reduction is not Church–Rosser because it is a much too strong a relation. First, exercise 2.1.5 shows that it is hopeless to place an upper bound on the 5 By

Rm xy we indicate that Rxv1 , Rv1 v2 , . . . , Rvm−1 y all obtain for some v ’s — but without naming or quantifying over these v ’s. This notation is used often.


Chapter 2.

33

Main theorems

length of one-step reduction sequences that might be needed to regain the diamond property. Second, B1 is not reflexive. There are very few terms that one-step reduce to themselves. The absence of reflexivity can lead to the failure of confluence for B1 in a trivial fashion. For example, Ix B1 x , but there is no term M such that x B1 M . Therefore, Ix shows that the diamond property is false for B1 . The proof of proposition 2.1.3 contains a redex with a duplicator as its head as well a redex in the argument of the duplicator that gets replicated when the duplicator is reduced. However, the copies of the duplicated redex cannot be all reduced in one step. But it is interesting to note that they do not overlap, that is, they do not have any occurrences of any subterms in common. The distinction between terms and occurrences of terms is relevant here. All the occurrences of a duplicated redex look the same. That is, they are the same (sub)term, but there are (at least) two distinct occurrences of that term; therefore, they are disjoint. This observation led to the introduction of yet another binary relation on terms. We assume that two redex occurrences are overlapping or nonoverlapping just in case they look so. (Cf. section A.2 for a more rigorous, but also more tedious, definition.) D EFINITION 2.1.6. (S IMULTANEOUS ONE - STEP REDUCTION ) Let M be a term and { P1 , . . . , Pn } a (possibly empty) set of redex occurrences in M , such that for any i 6= j , Pi and Pj are nonoverlapping. Then M B p1 M 0 , that is, M 0 results by a simultaneous one-step reduction from M , when M 0 is [P1 /N1 , . . . , Pn /Nn ]M with each Pi B1 Ni .6 The definition is applicable both when the set of redexes is empty and when it is not. If the set of redexes is empty, then M 0 is the same term as M . If M is in nf, then the set of redexes is necessarily empty. However, even if M is not in nf the set of redexes still may be chosen to be empty. The upshot is that for any term M , M B p1 M . In other words, B p1 is a reflexive relation. Exercise 2.1.1 showed that B1 lacks the Church–Rosser property, because terms in nf do not one-step reduce to any term whatsoever. We might entertain the idea that it is sufficient to include in B1 a small amount of reflexivity (i.e., a restricted version of the identity relation), for B p1 to become confluent. Perhaps, it is sufficient to have M B p1 M for terms in nf. The inclusion of parallel reductions in B p1 , however, creates a new possibility for nonconfluence. Exercise 2.1.7. Show that, if the definition of B p1 (i.e., definition 2.1.6) is modified

so that the set of redexes is required to be nonempty, and if M is in nf, then M B p1 M is stipulated, then this modified relation is not confluent. A source of the failure of confluence in the case of B1 is that one-step reduction is not transitive. However, if a relation is transitive, for instance, if B p1 were transitive, then a direct proof of confluence would be just as difficult as in the case of Bw . If 6 We

The

used Bs as the notation for strong reduction. Now we use the subscript can be thought to stand for parallel.

p


p

on B together with

1.

34


B p1 included successive one-step reductions up to a fixed number (rather than the transitive closure of one-step reduction), then confluence would still fail. It is helpful to rethink exercise 2.1.5, from the point of view of proving confluence for such a relation. Let us assume that we allow successive one-step reductions, for example, up to three steps, to determine a relation B≤3 on CL-terms. Let us also assume that S and K are the only primitive combinators. Then the effect of B≤3 is similar to the effect of allowing a new combinator to be introduced, which adds seven new instances of an argument — while retaining B1 . Example 2.1.7. S duplicates its last argument. The term Sxy(Sxy(Sxy(Kzv))) B1 Sxy(Sxy(x(Kzv)(y(Kzv)))) . Two further B1 reductions yield the term: x(x(x(Kzv)(y(Kzv)))(y(x(Kzv)(y(Kzv)))))(y(x(x(Kzv)(y(Kzv)))(y(x(Kzv)(y(Kzv)))))). The latter term may be obtained via one B≤3 reduction. The redex Kzv occurred once in the starting term, and occurs eight times in the resulting term. Let Z3 be a new combinatory constant with axiom Zxyz B x(x(xz(yz))(y(xz(yz))))(y(x(xz(yz))(y(xz(yz))))).

Then Zxy(Kzv) one-step reduces to the term displayed above. It is a remarkable idea that the failure of the diamond property for B1 can be circumvented via allowing simultaneous one-step reductions, rather than successive one-step reductions. The analysis of the counterexamples to confluence for B1 completely supports this insight: sequentiality may be supplanted by the requirement that the affected redexes do not overlap. One-step reductions may be visualized as a directed graph in which the points are terms and the edges point toward a term as B1 does. The reflexive closure of B1 adds a loop (an edge leading from a point to itself) to every point in the graph. B p1 also adds certain edges — some shortcuts — to the graph. However, not all consecutive arrows are composed into one arrow. In contrast, the transitive closure of B1 composes every finite sequence of arrows into one. (Sometimes, if the edge relation is known to be reflexive and transitive, then the reflexive loops and the transitive arrows are omitted from the graph to minimize clutter.) ....................xz(yz)z(Sxyzz) S(xz(yz))( Sxyz)z .. .. .. .. . .. ....

...... .... ........ .. .. ..... .... .. .... ..... ...... . .... . .. .... ..... . . . .... .... ..... .... . .. . . . .. . . .... ..... ............ .... ..... . . . . . . ..... .. .... ....... . . . . . . . ..... . . . . . . . . . . .. .... ... ... ...... . . . . . . . . . . . ...... . ....... .. . . . ... ... . . . . . . . . . ..... . ..... . . . . . . . . . . ........ . ....... .... ....... ....... ............. .......... .. .. ... . .... . .... ........ ............. ..... . ..... . . ............. .... . . . . . . .......... .... . . . . . ....... . .. .... . . . . . . . ...... . . . . . . . . . . . . . . . . . . . . .................... . . .... . . . . . . . . . . . . . . . . . . . . . ........... .... . . . . . . .. ..... .... .... ... .... .... .... . . . .. ..... . .... .... . .. ..... . ..... .... ..... ........ .. .... ........ .. ..... ..... ..... ....... ..... ....................

∗ ∗ S(Sxyz)(Sxyz)z Sxyzz(Sxyzz) . . . .. . . .... . ......

S(xz(yz))(xz(yz))z

S(Sxyz)(xz(yz))z ∗ Sxyzz(xz(yz)z)

xz(yz)z(xz(yz)z)

∗

The dotted arrows indicate new edges in the B p1 relation. The starred arrows show some places where transitivity fails.


Chapter 2.

35

Main theorems

Example 2.1.8. KMN B p1 M and SMNP B p1 MP(NP) . Ky(SKKx) B1 Ky(Kx(Kx)) and Ky(SKKx) B1 y . Further, Ky(Kx(Kx)) B1 Kyx and Ky(Kx(Kx)) B1 y . All the B1 ’s can be replaced by B p1 ’s — including Ky(SKKx) B p1 y . However, no two one-step reductions compose, because there are no two disjoint redexes in any of the terms. Also, y B p1 y . It is useful to record certain formal properties of B p1 as well as its relationship to other relations on the set of CL-terms. P ROPOSITION 2.1.9. The relation B p1 on CL-terms is neither transitive, nor symmetric. That is, there are terms M , N and P such that M B p1 N B p1 P but not M B p1 P ; and there are terms M and N for which M B p1 N holds but N B p1 M does not. The relation B p1 is reflexive. That is, for any term M , M B p1 M . Exercise 2.1.8. We already discussed reflexivity. Prove the rest of the proposition. Exercise∗ 2.1.9. Consider the basis { S, K } . Prove that the relation B p1 on the set of CL-terms over this basis is neither asymmetric nor antisymmetric. (Hint: The lack

of both of these properties may be shown by finding two (distinct) terms M and N such that M B p1 N and N B p1 M .) L EMMA 2.1.10. The relationship between the reduction-like relations on the set of CL-terms is

B1 ⊆ B p1 ⊆ Bw ⊆ Bs . Proof: To prove the first inclusion, B1 ⊆ B p1 , let us assume that M B1 N . Then there is a redex P in M such that N is [P/P0 ]M (where P B1 P0 is by substitution in an axiom). Certainly, M B p1 N when the set of redexes is { P } . To prove the second inclusion, B1p ⊆ Bw , let us assume that M B p1 N , and that there is a nonempty set of nonoverlapping redexes { P1 , . . . , Pn } in M such that P1 B1 Q1 , . . . , Pn B1 Qn , and N is [P1 /Q1 , . . . , Pn /Qn ]M . Then the following chain of one-step reductions links M and N : M B1 [P1 /Q1 ]M B1 [P1 /Q1 , P2 /Q2 ]M B1 . . . B1 [P1 /Q1 , . . . , Pn /Qn ]M . Weak reduction is defined to include the transitive closure of B1 ; therefore, M Bw N is immediate. Now let us consider M B p1 N but with the set of redexes empty. Then M is identical to N . Weak reduction includes the reflexive closure of B1 , that is, Bw is reflexive; therefore, M Bw M holds. The third inclusion, Bw ⊆ Bs , has been established in chapter 1 — it is in this lemma for the sake of completeness. qed To obtain a proof that the Church–Rosser property holds for Bw , we will put together well-known facts about the reflexive transitive closure of a relation and what we have established about B p1 and its connection to B1 and Bw . Recall from chapter 1 that the reflexive transitive closure of a binary relation R is denoted by R∗ . C LAIM 2.1.11. (1) R ⊆ R∗ .


(2) If R1 ⊆ R2 then R∗1 ⊆ R∗2 .

(3) R∗ = R∗∗ .

36


Exercise∗ 2.1.10. Prove (1)–(3) from the previous claim for an arbitrary binary rela-

tion R . Assuming the truth of the claim, we can state the following lemma. L EMMA 2.1.12. The transitive reflexive closure of the simultaneous one-step reduction is weak reduction, that is, B∗p1 = Bw . Proof: By definition, the transitive reflexive closure of one-step reduction is weak reduction, that is, B∗1 = Bw . We have shown that B1 ⊆ B p1 . It follows by (2), that B∗1 ⊆ B∗p1 . This is half of the identity we want to prove: Bw ⊆ B p1 . Further, ∗ B p1 ⊆ Bw ; thus, again by (2), B∗p1 ⊆ B∗w . However, Bw is B∗1 , and B∗∗ 1 = B1 by ∗ (3), that is, B p1 ⊆ Bw as desired. qed The careful reader has surely noticed that an important piece is still missing from the proof of confluence for Bw that we are assembling: we have not yet established that B p1 is confluent. L EMMA 2.1.13. The relation B p1 has the Church–Rosser property. Proof: The proof of this lemma is by structural induction on M , which is the initial term that plays the role of x in definition 2.1.1. The starting assumption is that M B p1 N1 and M B p1 N2 . We divide the proof into two main cases. 1. If M is an atomic term, such as a variable or a combinator, then a B p1 step is only possible due to the reflexivity of the relation. However, M B p1 M is sufficient to show that both N1 and N2 , which are M , reduce to a common term. 2. Let us now assume that M is a complex term, that is, M is of the form (M1 M2 ) . From M being complex, it does not follow that there is a redex in M . Even if M contains one or more redexes, the B p1 step does not compel us to suppose that N1 or N2 is obtained by one or more B1 steps. 2.1 If N1 and N2 are M , then the reasoning is exactly as in case 1. 2.2 If one of N1 and N2 is M , then that term, let us say for the sake of concreteness N1 , reduces to the other term, N2 , by B p1 . The starting assumption is of the form M B p1 M and M B p1 N2 . But M B p1 N2 and N2 B p1 N2 . The critical case in this proof is when both N1 and N2 are obtained by one-step reductions of a nonempty set of nonoverlapping redexes. 2.3 If the same set of redexes is reduced in both cases, then N1 and N2 are identical. Then, there is nothing special about the starting term having been complex, and the reasoning in this case may be completed as in case 1. Definition 2.1.6, the definition of simultaneous one-step reduction, implies that if M is a redex, then no other redex can be reduced within the same step as the whole M . This leads to two further subcases. 2.4 Let N1 be the term obtained by reducing the whole of M , and let N2 be the result of B p1 in which all the reduced redexes are in one of M1 and M2 . If M is a redex, then it is of the form Zn P1 . . . Pn , where Pn is the previous M2 . The axiom for Zn is Zx1 . . . xn B Q ; then, N1 is [x1 /P1 , . . . , xn /Pn ]Q . The term M is left-associated with respect to Z, P1 , . . . , Pn . Therefore, the redexes that are reduced to obtain N2 have to


Chapter 2.

Main theorems

37

be contained in P1 , . . . , Pn . Let P10 , . . . , Pn0 be the resulting terms, when those redexes are reduced in the P ’s standing separately. (Some of the Pi0 ’s may be identical to their counterpart Pi ’s, but there is no need to be able to pinpoint those terms for the purposes of the proof.) N2 is ZP10 . . . Pn0 . The result of performing a B1 step on N2 with the redex headed by Z reduced is [x1 /P10 , . . . , xn /Pn0 ]Q , by substitution in the axiom of Z . The result of reducing the same redex occurrences in the P ’s as were reduced to obtain N2 is the result of the replacement [P1 /P10 , . . . , Pn /Pn0 ]N1 , where we assume that the particular occurrences of the P ’s that originated from the substitution in Q are the occurrences being replaced. Given this proviso together with the fact that N1 looks like [x1 /P1 , . . . , xn /Pn ]Q , we have [P1 /P10 , . . . , Pn /Pn0 ][x1 /P1 , . . . , xn /Pn ]Q . That is, we have [x1 /[P1 /P10 ]P1 , . . . , xn /[Pn /Pn0 ]Pn ]Q . The latter term is [x1 /P10 , . . . , xn /Pn0 ]Q showing confluence. 2.5 Lastly, it may be the case that N1 and N2 both result by reductions of some redexes within M1 and M2 . Then M1 B p1 N11 and M1 B p1 N12 , and M2 B p1 N21 and M2 B p1 N22 . At this point we use the hypothesis of the induction, namely, that B p1 is confluent for terms that are structurally less complex than M itself. Then there are terms R1 and R2 such that, on one hand, N11 B p1 R1 and N12 B p1 R1 , on the other hand, N21 B p1 R2 and N22 B p1 R2 . However, (R1 R2 ) is a term for which it is true that N1 B p1 R1 R2 and N2 B p1 R1 R2 , establishing the diamond property in this case. This concludes the proof. qed Now we can state and prove that Bw has the diamond property. T HEOREM 2.1.14. (C HURCH –ROSSER ) the Church–Rosser property.

The weak reduction relation, Bw , has

Proof: The theorem is proved by simply piecing together what we have already established. B p1 is confluent, and the reflexive, transitive closure of B p1 is Bw . Therefore, by theorem 2.1.5, Bw is confluent too. qed The Church–Rosser theorem may be stated equivalently using =w . The assumption is weakened: the two terms N1 and N2 ( y1 and y2 in definition 2.1.1) are weakly equal. If M Bw N1 and M Bw N2 , then N1 =w N2 . But the converse implication does not hold. T HEOREM 2.1.15. (C HURCH –ROSSER , 2) If the terms N1 and N2 are weakly equal, that is, N1 =w N2 , then there is a term P such that N1 Bw P and N2 Bw P . Proof: First, we note that =w is a reflexive transitive and symmetric closure of B1 . Thus, there are certain obvious cases that we may quickly go through. By reflexivity, N1 and N2 may be the same term. Then this term itself is sufficient for the truth of the claim. N1 and N2 may be related by a finite sequence of B1 ’s, in which case either N1 Bw N2 or N2 Bw N1 . The existence of a suitable P is then obvious, because N2 (or N1 ) is a term on which Bw converges. If both N1 and N2 are obtained by Bw from a term M , then the claim is exactly as in theorem 2.1.14 (which we have already proved).


38


The less obvious case is when none of the previous situations occurs, and then there are n terms M1 , . . . , Mn ( n > 1 ) such that M1 Bw N1 , M1 Bw Q1 , . . . , Mi Bw Qi−1 , Mi Bw Qi , . . . , Mn Bw Qn−1 , Mn Bw N2 . This chain of Bw steps is a justification for N1 =w N2 , and looks as follows. ...

M1 ..... ... ..... ... ... .... ... . . ..... ..... ....... .......

N1

...

Mi .... .... .. .... ..... ... .... .... ... . . . ........ ............ .....

Q1 . . . Qi−1

Mn ....... ... ....... .... ... .... ... . .... . . ..... .......... ........

Qi . . . Qn−1

N2

We can apply theorem 2.1.14 n times to get P1,1 , . . . , P1,n , which complete the little diamonds in the picture. Notice that each Qi ( 1 ≤ i ≤ n − 1 ) is related to a pair of P ’s: Qi Bw P1,i and Qi Bw P1,i+1 . Therefore, by n − 1 applications of theorem 2.1.14, there are terms P2,1 , . . . , P2,n−1 such that P1,i Bw P2,i and P1,i+1 Bw P2,i . Bw is transitive, so N1 Bw P2,1 and N2 Bw P2,n−1 . At each level (indicated by the first index on the P ’s), the number of P ’s decreases by one; on the n th level there is exactly one (possibly) new term: Pn,n−(n−1) (i.e., Pn,1 ). For each Pi,1 , Pi,1 Bw Pi+1,1 , and for each Pi,n−(i−1) , Pi,n−(i−1) Bw Pi+1,n−i . Hence, also N1 Bw Pi+1,1 and N2 Bw Pi+1,n−i . However, then N1 Bw Pn,1 and N2 Bw Pn,1 , which establishes the truth of the claim. In sum, if there are M1 , . . . , Mn to start applications of theorem 2.1.14 lead to Pn,1 . This concludes the with, then (n+1)·n 2 proof. qed The above proof shows that once we have proved theorem 2.1.14, we can prove theorem 2.1.15. However, we claimed that the two theorems are equivalent, by which we mean that the theorems imply each other. It is quite easy to see that theorem 2.1.15 implies theorem 2.1.14 as a special instance. The assumption of theorem 2.1.14 is that M Bw N1 and M Bw N2 . By the definition of =w , it is immediate that N1 =w N2 . Therefore, by an application of theorem 2.1.15, there is a suitable P .

2.2

Normal forms and consistency

The Church–Rosser theorem provides freedom in computing with terms. For example, we may be sure that if we devise different strategies for reducing terms, then this cannot lead to a “dead-end term” from which the results of other reduction sequences are not reachable. Example 2.2.1. The term K(CMxI)(W(MC)(WI(WIx))) has several B1 reduction sequences, however, all of them are finite. It is not difficult to verify that they all lead to x , although some of the sequences seem to make a lengthy detour via reductions


Chapter 2.

Main theorems

39

in subterms that are eventually omitted as an effect of the reduction of the redex with the head K . Or let us consider SKK(CIIx) . This term can be reduced in various ways; however, one-step reductions terminate in xI , which is a term in nf. The above examples are simple in the sense that although the terms have infinite Bw reduction sequences (as any term does), their Bw reduction sequences end in an infinite subsequence comprising one and the same term infinitely many times. There are terms that have infinite B1 reduction sequences comprising infinitely many different terms. Example 2.2.2. The fixed point combinator Y was introduced in chapter 1 (see p. 12). The term YY has infinite B1 reduction sequences only. Some of the terms in those sequences — for example, YY(Y(YY)) and Y(Y(Y(Y(Y(YY))))) — appear diverging, but the Church–Rosser theorem guarantees that they can be reduced to a common term. One of the infinitely many terms to which both of these terms reduce is Y(Y(Y(Y(YY))))(Y(Y(Y(Y(Y(YY)))))). The term YK has exactly one B1 reduction sequence and it is infinite. Each B1 reduction yields a term with exactly one redex. (Incidentally, any other non-unary combinator would do in place of K .) But YK has a captivating property: after n B1 reductions we get a term that can be applied to n arguments, and n further B1 reductions lead back to YK . Metaphorically speaking, YK is like a black hole. For instance, K(K(YK))M1 M2 Bw YK . Definition 1.3.5 delineated a proper subclass of CL-terms: those that have a weak normal form. Clearly, not all terms are in nf. Moreover, some CL-terms do not reduce to a term in nf, that is, some CL-terms do not have an nf. Example 2.2.3. Some of the terms mentioned above have a wnf. The normal form of SKK(CIIx) is xI . The term KM(YK) has an nf too, which is M . On the other hand, some of the already-mentioned terms do not have a wnf, for example, YK . Neither does MM have an nf. The following lemma is an application of the Church–Rosser theorem. L EMMA 2.2.4. (U NIQUENESS OF NF ’ S ) If a term M has an nf, that is, if there is a term N such that M Bw N and N contains no redexes, then N is unique. Proof: Let us assume that there are two (distinct) nf’s for M , let us say N1 and N2 . M Bw N1 and M Bw N2 ; therefore, by theorem 2.1.14, N1 Bw P and N2 Bw P , for some P . Since N1 and N2 are nf’s, they do not contain a redex, which means that N1 is P , and so is N2 . Then N1 and N2 are not distinct, contrary to the starting assumption. qed We can make the following general statement. C OROLLARY 2.2.4.1. Every CL-term has at most one weak normal form.


40


The term KM(YK) has a normal form, but at the same time, it also has an infinite B1 reduction sequence. This shows that the Church–Rosser theorem guarantees that reductions always converge, not that all possible reduction sequences lead to the nf of the term (if there is one). The following diagram illustrates this situation using the term KM(YK) . The arrows indicate B1 reductions, whereas the . . . ’s show that as long as only the redexes of the form YK are reduced, the B1 reduction sequence does not terminate. ···

···

.......... ............................... ................ .......... KM(K(YK)) ................ KM(K(K(YK))) .......................... ..... ................ .......................... .................... ............ .. ............... ......................... ..... ........... ................. ......................... ......................................... .. ..... . . .. .......... ......................... .. ..................... ..... .......... .......................... ..................... ............................... ..... ........... .................... .................... . . .. .. . . .. ... ..................... ... .................... ................... ............. ...................... .. ........... .......... .. .. ........ .. ..................................................... ............... ....... ..... .......................... ........... .. .... .... ..... ........ ....................... ...... .... ..... ...... .. ........

KM(YK)

M

The convergence of reduction sequences ensures that we may choose a strategy for the reductions. We might miss the nf of a term, but we surely cannot get another nf. In the above example, the nf is reached only when the redex with head K is reduced. So far, we have only functions that take arguments from the right-hand side. (We will introduce other kinds of functions in chapter 7.) The redex occurrence of the combinator K is in the leftmost redex in the term. The concept of the leftmost redex can be made precise, using the indexing introduced in section A.1. However, the following definition reflects the label well. D EFINITION 2.2.5. If M is a CL-term and N is a redex in M , then N is the leftmost redex iff all redex occurrences P in M that are distinct from N are proper subterms of N , or they do not overlap with N and are to the right from N . A CL-term, obviously, either is in weak normal form, or contains exactly one leftmost redex. Then the next definition describes a deterministic procedure, because at each step either there is exactly one redex to be reduced or there is none. D EFINITION 2.2.6. Let M be a term. If N is the leftmost redex in M and reduces to N 0 , then [N/N 0 ]M is produced from M by the one-step reduction of the leftmost 0 redex. This is denoted as M Blm 1 [N/N ]M . The leftmost reduction strategy, which is abbreviated as lmrs, consists of performing Blm 1 steps as long as there is a redex in the term. Example 2.2.7. The lmrs applied to the term S(Sxy)(Szv)(Swww) yields the following sequence of one-step reductions. S(Sxy)(Szv)(Swww) Blm 1 Sxy(Swww)(Szv(Swww)) Blm 1

x(Swww)(y(Swww))(Szv(Swww)) Blm 1 x(ww(ww))(y(Swww))(Szv(Swww)) Blm 1 ...


Blm 1

Chapter 2.

Main theorems

41

x(ww(ww))(y(ww(ww)))(z(ww(ww))(v(ww(ww)))). Focusing on the leftmost redexes is motivated by the fact illustrated above, that the lmrs yields an nf if there is one. Sometimes, other reduction strategies lead to the nf too, in fact, they might comprise fewer B1 reductions. Exercise 2.2.1. Consider the starting term S(Sxy)(Szv)(Swww) from example 2.2.7.

Does this term have an infinite B1 reduction sequence? What is the length of the shortest B1 reduction sequence ending in the nf of the term? L EMMA 2.2.8. If a CL-term M has an nf, then the lmrs applied to M yields the nf. Proof: If a CL-term has an nf, then there is a B1 reduction sequence of finite length. If the leftmost reduction sequence is a finite B1 reduction sequence, then by theorem 2.1.14, the last term is the nf of the starting term. The other possibility is that the lmrs gives us an infinite B1 reduction sequence. Therefore, if some redex other than the leftmost one is reduced in another B1 reduction sequence, then the leftmost redex remains in the term as long as the lmrs is not followed, i.e., the term will not reduce to its nf. qed A normal form does not contain any redexes. Thus, if M has an nf, then either all the B1 reduction sequences (starting with any of the redexes) of M are finite, or some redexes lead to infinite B1 reduction sequences but they are in an omitted argument of a cancellator. Notice that in the latter case the redex, which leads to an infinite B1 reduction sequence, is inside another redex. If we allowed infinitely many one-step reductions to precede the reduction of the outside redex, then we would not get to N . As an analogy, consider enumerating N ∪ { −1 } starting with an enumeration of N versus starting with −1 and continuing with an enumeration of N . The former procedure will not succeed in enumerating the whole set, because we never get to −1 .7 The set of CL-terms that have an nf is called the set of weakly normalizable terms. The above lemma gives an algorithm that eventually yields the nf of a CL-term — if the term has an nf. However, we do not know how long the reductions, in accordance with the lmrs, should continue. In other words, the algorithm is not a decision procedure. Definition 1.3.5 gives an effective description of the shape the CL-terms that are in nf, because it is obviously decidable if a CL-term contains a redex. We do not have though a characterization of the shape of CL-terms that have an nf. Of course, the above lemma does not provide anything of this sort. The best we will have is that, in chapter 9, weakly and strongly normalizable terms turn out to be CL-terms typable by certain types in a type assignment system. Some terms do have nf’s, and this fact has a remarkable consequence for CL. As long as only proper combinators are allowed in combinatory bases (possibly together with improper combinators that are definable from S and K ), the consistency of Bw and =w is quite obvious — if we have theorem 2.1.14. 7 The

analogy would be more faithful if the enumeration of −1 would somehow relieve us from enumerating N at all.


42


The consistency of CL with Bw though may be proved without much difficulty and without any appeal to the Church–Rosser theorem. It is easy to see that no CLterm M can weakly reduce to a variable x unless x occurs in M , if we continue to assume that the combinatory basis is { S, K } . All CL-terms are finite; therefore, there is no term M that reduces to all CL-terms. The consistency of CL with =w is not so obvious. Weak reduction is symmetric, thus it could happen that somehow a chain of weak reductions and weak expansions could be construed to link two variables, for instance, x and y . Even if we restrict our consideration to the combinatory basis { S, K } , which is combinatorially complete, there are infinitely many potential chains (each of finite length) to consider. However, we can show that CL is consistent with respect to =w , that is, =w is not the total relation on CL-terms using the Church–Rosser theorem. T HEOREM 2.2.9. There are CL-terms M and N such that M =w N does not hold, that is, CL is consistent. Proof: Let us consider two terms M and N that do not contain a redex. These can be two variables or two constants, for example, but they can be more complex terms too. Let us suppose — to the contrary — that M =w N . Then by theorem 2.1.15, there is a term P such that M Bw P and N Bw P . However, M Bw M only, and, similarly, N Bw N only; therefore, M and N are the same term. This is a contradiction, so M =w N is false. qed The consistency of CL with respect to =w shows that weak equality is a reasonable relation in the sense that it partitions the set of CL-terms into more than one set. In other words, =w can distinguish between certain terms. Consistency is important from several points of view. It is well known that both Cantor’s informal set theory and one of Frege’s formal systems were inconsistent (in the sense of negation inconsistency). Hilbert’s program, which intended to place mathematics on firm foundations, included the aim to prove all mathematical theories to be consistent. Theorem 2.2.9 provides consistency for CL, though the proof itself is not formalized within CL.8 As we will see in chapter 3, CL with the basis { S, K } and =w is a sufficiently powerful system to formalize computable functions. Therefore, analogues of Gödel’s incompleteness theorems apply to CL. On the other hand, it is well known that Peano arithmetic can be (and has been — see, e.g., []) proved consistent. Thus there is no inconsistency or incoherence between this chapter and the next one. The consistency result concerns pure combinatory logic and does not guarantee that all extensions of CL by arbitrary constants or other expressions such as formulas retain consistency. Indeed, Curry’s paradox shows that a simple combination of classical sentential logic with combinatory logic is inconsistent.9 However, CL by itself is provably consistent. 8 The

notions involved in the definitions of terms, redexes, reductions and weak equality, as well as in the proof, could be formalized in ZFC, the Zermelo–Fraenkel set theory with the axiom of choice. 9 Two versions of Curry’s paradox are detailed in section 8.1.


Chapter 2.

Main theorems

43

We mentioned that the consistency of CL with Bw can be proved without appeal to powerful theorems like the Church–Rosser theorem. We state this consistency as a lemma and give an elementary proof of it. L EMMA 2.2.10. There are CL-terms M and N such that neither M Bw N nor N Bw M . There is no term P such that P Bw Q for all Q . Proof: We consider terms over the combinatory basis { S, K } together with an infinite set of variables. S Bw K and K Bw S are both false, which proves the first part of the claim. For the second part, we note that Bw is defined from B1 as its reflexive transitive closure. Let SM1 M2 M3 be a redex occurrence in N and let this particular redex occurrence be replaced by M1 M3 (M2 M3 ) to get N 0 . Then a variable x is free in N 0 only if it is free in N , because x may occur in N 0 outside the new subterm M1 M3 (M2 M3 ) , or in the latter subterm. If the former, then x occurs in N outside SM1 M2 M3 ; indeed, x has the same occurrences in N and N 0 . If the latter, then x occurs in M1 , M2 or M3 ; hence, x also occurs in N . Considering a redex occurrence of the form KM1 M2 is similar. Let us assume that a term P exists with the property that it reduces to any CLterm. If P Bw Q , then there is an n ∈ Z+ such that n successive one-step reductions starting with P lead to Q , or P is Q itself. In the second case, it is clear that all variables that occur in P occur in Q and vice versa, because P is Q . If n = 1 , then — because of the first claim in the lemma — all the variables of Q are variables of P . Let a similar claim be true of a sequence of one-step reductions of length n from P to Q0 . Adding yet another B1 step from Q0 to Q maintains the relationship between the variables of the resulting term Q and the starting term Q0 , and therefore, also between the variables of Q and P . That is, if x is a variable of Q , then it is a variable of P . There are infinitely many variables; however, no term can contain infinitely many of them. This completes the proof of the claim. qed It is straightforward to ask whether considering which variables occur in some CL-terms could be used to prove the consistency of the weak equality relation. Exercise 2.2.2. Consider =w instead of Bw . Why cannot the proof appealing to occurrences of variables be used to show the consistency of CL with =w ? Exercise 2.2.3. Define a restricted set of CL-terms so that the proof of the above

lemma can be modified to obtain a proof of consistency. We introduced the relation Bs in definition 1.3.18, and then pointed out that Bs is a weaker relation than Bw . Therefore, the consistency of Bw and =w does not imply the consistency of Bs . However, it can be verified that S Bs S and K Bs K , but neither is strongly reducible to the other. That is, there are CL-terms M and N such that neither M Bs N nor N Bs M . L EMMA 2.2.11. The set of CL-terms with Bs is consistent. There is no CL-term M such that for all N , M Bs N .


44


Exercise∗ 2.2.4. Prove the lemma. (Hint: Bw and Bs are defined differently; still,

the proof of lemma 2.2.10 may be adapted to Bs .) Recall that Bs depends on how we define bracket abstraction, which is a pseudoλ -abstraction in CL. We state (but do not prove) the next two theorems. T HEOREM 2.2.12. (C HURCH –ROSSER FOR Bs ) If M Bs N1 and M Bs N2 , then there is a term P such that N1 Bs P and N2 Bs P . T HEOREM 2.2.13. There are CL-terms M and N such that M =wζ N does not hold. That is, CL is consistent with respect to extensional weak equality.

2.3

Fixed points

Once the consistency of weak equality is guaranteed, it becomes interesting to look for analogues of other properties of functions. Some functions have fixed points, whereas some others do not.10 For example, the “plus one” function on N (i.e., f (x) = x + 1 ) has no fixed points, because n + 1 6= n for all n . Another function, the “plus zero” on N (i.e., f (x) = x + 0 ) has infinitely many fixed points, because n + 0 = n , for all n . Zero is the identity element for addition, which explains why this function is rarely considered. There are functions that have some fixed points, and it is crucial that they have a fixed point. For example, the classical consequence operator, which is often denoted by Cn , is a closure operator (possibly with additional properties postulated too).11 This means that the set of consequences of the consequences of a set of formulas ∆ is the set of consequences of ∆ . To put it differently, the Cn operator has a fixed point given a set of formulas ∆ , namely, Cn(∆) . Closure operators, in general, have fixed points: for any x , c(x) is a fixed point of the closure operator c . Weak reduction, Bw , is defined in 1.3.4 as the reflexive transitive closure of B1 . The reflexive closure of Bw is Bw itself. Similarly, the transitive closure of Bw is Bw too. A well-known fixed point theorem concerns monotone operations on complete lattices.12 In chapter 6, we will encounter a fixed point theorem for complete partial orders (CPOs), which implies the fixed point theorem for complete lattices. The fixed point theorem for CPOs is important in the construction of a certain kind of a model for CL. 10 Sometimes,

“fixpoint” is used instead of “fixed point.” I use the latter expression as a technical term. definition A.2.7 in the appendix. 12 This theorem is sometimes called the Knaster–Tarski or simply Tarski’s fixed point theorem. Lattices are briefly introduced in section A.2; for more detailed expositions, see Birkhoff [], Davey and Priestley [] and Grätzer []. 11 See


Chapter 2.

Main theorems

45

T HEOREM 2.3.1. Let A = hA, ∧, ∨, ~i be a complete lattice with ~ a monotone unary operation on A . ~ has a fixed point; in particular, ~ has a least fixed point. Proof: A complete lattice has a top and a bottom element, which we denote by > and ⊥ , respectively. The top element is the greatest element, that is, for all a ∈ A , a ≤ > . ≤ is the usual partial order on a lattice, which is defined by stipulating a ≤ b iff a = a ∧ b . Then it is obvious that ~> ≤ > , because ~ is a total function of type A −→ A . We associate to each element a of the lattice a set f (a) , which is { b : a ≤ b and ~ b ≤ b } . For each element a ∈ A , f (a) 6= 0/ , because > ∈ f (a) .13 We only consider the set f (⊥) , which may be defined equivalently as f (⊥) = { b : ~ b ≤ b } . The inequation ~b ≤ b is “half” of the fixed point equation for ~ . V f (⊥) contains all elements from A that satisfy this inequation. We take f (⊥) , the greatest lower bound of f (⊥) . The setVf (⊥) may contain infinitely many elements. However, the lattice is complete, so f (⊥) exists. We let c denote the element V f (⊥) . Let us assume that b ∈ f (⊥) . c ≤ b , because c is a lower bound. ~ is monotone; thus, ~c ≤ ~b . From b ∈ f (⊥) , we know that ~b ≤ b , and, by the transitivity of ≤ , ~c ≤ b . To sum up, if b ∈ f (⊥) , then ~c ≤ b . But c is the greatest lower bound of f (⊥) , which implies that ~c ≤ c . This inequality means that c ∈ f (⊥) , by the definition of the latter. The operation ~ is monotone. Then from ~c ≤ c we get ~~c ≤ ~c . The latter means that ~c ∈ f (⊥) , because ~c satisfies the defining inequality. Then c ≤ ~c , because c is a lower bound of f (⊥) . We have ~c ≤ c and c ≤ ~c , which shows that c is a fixed point of ~ . The proof of the second part of the claim is the next exercise. qed Exercise 2.3.1. Prove that c is the least fixed point of ~ . (Hint: You should show that for all d ∈ A , ~d = d implies c ≤ ~d .)

In logic, mathematics and computer science many concepts are defined inductively or recursively.14 The objects that are so defined exist because they are the least fixed points of the defining clauses. Example 2.3.2. An infinite sequence of natural numbers is named after Fibonacci. A function F that gives the n th element of the Fibonacci sequence can be defined inductively as follows. (1) F(0) = 1 and F(1) = 1 ; (2) F(n + 2) = F(n) + F(n + 1) , where n ∈ N . 13 A

series of related theorems are proved in []. For instance, it is shown that the set of fixed points of ~ is a complete lattice itself, and that the existence of a fixed point for a monotone operation is equipotent to the underlying lattice being complete. 14 In section A.1, we have two sample inductive definitions and associated inductive proofs, which are representative of the kind of inductions we need here. Of course, in general, induction on all ordinals is used in mathematics, which implies the use of set theory of various strengths.


46


The function that is defined is the least fixed point of the defining conditions understood as a function of F .15 A proof of Gödel’s incompleteness theorem for formalized arithmetic uses a fixed point of a function. The idea is that it is first shown that certain expressions, including formulas, can be represented by numbers, which nowadays are usually called Gödel numbers. Then a one-place predicate (i.e., a unary function) is constructed to express that the formula the Gödel number of which is the argument of the predicate is not a theorem of formalized arithmetic. From the fact that there is a fixed point for this predicate combined with the Gödel number function, it can be deduced that formalized arithmetic is incomplete if consistent. We return to the analogue of Gödel’s theorem for CL in chapter 3. These examples are to illustrate that fixed points occur in many places in logic, computer science and mathematics. In particular, we intend to show the computational power of combinatory logic, by showing that in CL all functions have fixed points. T HEOREM 2.3.3. (F IXED POINT ) such that MN =w N .

Let M be a CL-term. There is a CL-term N

Proof: We may assume that we have a primitive or a defined combinator Y . (Exercise 1.2.7 justifies this assumption.) The term YM can be taken in place of N , because YM =w M(YM) . qed If the fixed point combinator Y is primitive, then it is sufficient to have just one combinator with the axiom Yx B x(Yx) . But we may have different combinatory bases and there might be many, even infinitely many, fixed point combinators. Indeed, the latter is the case as long as we do not consider =wζ . In chapter 1, we introduced a handful of combinators, including Y . Combinators that are like Y to some extent can be defined from the combinatory basis { S, K } , but we can also take Y as a primitive constant: { S, K, Y } . Example 2.3.4. BM(CBM) is a term with the property that BM(CBM)x =w x(BM(CBM)x).

The following B1 reductions show that this is so. BM(CBM)x B1 M(CBMx) B1 CBMx(CBMx) B1 BxM(CBMx) B1 x(M(CBMx)) . It is also true that x(BM(CBM)x) B1 x(M(CBMx)) , but BxM(CBMx) does not reduce to x(BM(CBM)x) . To sum up, BM(CBM)x Bw x(BM(CBM)x) does not hold, unlike for Y , though the weak equality obtains. Taking Y as an undefined combinator ensures that it behaves as desired with respect to Bw . However, it is possible to define a combinator like Y from the basis { S, K } . 15 In

chapter 3, it will become clear how to turn the defining conditions into a function of F , when we will define combinators such as ZB , Z0p and Z pr . (See sections 3.2 and 3.3.)


Chapter 2.

Main theorems

47

Fixed point combinators have been defined in different ways by at least two wellknown logicians: Curry and Turing. We already saw that B is definable from S and K , and W is definable too. Curry’s fixed point combinator is S(BWB)(BWB) . This term has the fixed point property with respect to =w , but not with respect to Bw . On the other hand, the term is in weak nf. The connection between proper combinators and the fixed point combinator becomes transparent if we think along the lines Turing did. Yx Bw x(Yx) could be thought of as having a term MM in place of Y , that is, as MMx Bw x(MMx) . This would not make M a proper combinator, but similarly to an introduction of the existential quantifier (i.e., ∃ ) in first-order logic, we could replace not all, but only the last three occurrences of M , by a variable. We get the term x(yyx) from Myx Bw x(yyx) , because we want to keep the newly introduced variable distinct from x . Now M is obviously a binary proper combinator, which is definable from S and K due to combinatorial completeness. Once M is defined, it only remains to apply that term to itself. The construction itself guarantees that the resulting term will have the fixed point property with respect to Bw . Given this idea, it remains to define a combinator that has the above reduction pattern. The combinator may be defined even in standard form. Exercise 2.3.2. Apply the algorithm from the proof of lemma 1.3.9 (but with η included) to obtain a combinator like M containing only S and K in standard form.

If we assume some of the combinators that we introduced in chapter 1, then we can define M . For example, M can be taken to be BW(BB0 M) , or replacing B0 by its definition from B and C , M can be defined as BW(B(CB)M) . It is also possible to replace B0 by B(CI) or BT , resulting in BW(B(B(CI))M) .16 B0 and B(CI) are not the same function (even in the sense of =wζ ). It simply so happens that in the context of the whole term they can be exchanged. Exercise 2.3.3. Explain why the replacement of B0 by B(CI) in the above CL-term is possible, though B0 =wζ B(CI) does not hold.

Once we have a CL-term for M , Turing’s fixed point combinator is obtained by applying that term to itself: BW(BB0 M)(BW(BB0 M)).

The term is not in nf. However, we can easily turn it into a term in weak normal from: W(B0 (M(BW(BB0 M)))) . If we take BW(BB0 M) as a primitive, e.g., X with the axiom Xxy B y(xxy) , then the combinator XX applied to x weakly reduces to x(XXx) . Exercise 2.3.4. Verify that both BW(BB0 M)(BW(BB0 M)) and W(B0 (M(BW(BB0 M))))

have the fixed point property with respect to Bw . (Hint: You can construct a single sequence of B1 reductions involving both CL-terms.) 16 T

is Church’s notation for CI and is often used by others too; T ’s axiom is Txy B yx .


48


Let us return to Curry’s fixed point combinator and analyze the idea behind it. First of all, let us look at the one-step reductions BWBxy B1 W(Bx)y B1 Bxyy B1 x(yy) . The role of the initial S in Curry’s fixed point combinator is to get BWBx(BWBx) from S(BWB)(BWB)x . The former term reduces in three steps to x(BWBx(BWBx)) . Of course, the variable x may be replaced by any term without affecting the reduction steps; thus, we can reconstruct the process of finding a fixed point combinator as follows. We want to find a combinator like the function f in f x Bw x( f x) , and so we first will find a term M such that Myx Bw x(yx) . Again, this M is a proper combinator, and it is surely definable by S and K . Now we take BWBM(BWBM) for y , that is, we consider M(BWBM(BWBM))x . By M ’s axiom, M(BWBM(BWBM))x Bw x(BWBM(BWBM)x) . By our previous observation, the latter term further reduces to x(M(BWBM(BWBM))x) . This gives M(BWBM(BWBM)) as a combinator that has the fixed point property with respect to weak reduction, that is, M(BWBM(BWBM))x Bw x(M(BWBM(BWBM))x) . Exercise 2.3.5. Apply the algorithm from the proof of lemma 1.3.9 (with η added) to obtain a combinator like the latter M containing only S and K in standard form.

Clearly, there are a lot of CL-terms that have the fixed point property at least with respect to =w . Exercise 2.3.6. Define a combinator that has the fixed point property for =w using only B, C and M . Exercise 2.3.7. Define a combinator that has the fixed point property for =w using only B, I and W .

Let us assume that the basis is { S, K } . We have the following lemma. L EMMA 2.3.5. There are infinitely many distinct terms that have the fixed point property with respect to =w . Proof: The reduct xz(yz) of the redex Sxyz closely resembles x(Yx) . Indeed, if we put I (i.e., SKK ) into the first argument of S , then we have that S(SKK)yz B1 SKKz(yz) , which in turn reduces to z(yz) . Lastly, if we take additionally any fixed point combinator as the second argument of S (with SKK in place of the first argument), then we have a fixed point combinator. Thus if we have a Y defined in terms of S and K , then S(SKK)Y , S(SKK)(S(SKK)Y) , S(SKK)(S(SKK)(S(SKK)Y)) , . . . , S(SKK)(. . . (S(SKK)(S(SKK)Y))...) , . . . are all combinators that have the fixed point property with respect to =w . qed We can think about the multiplicity of CL-terms with the fixed point property along different lines. L EMMA 2.3.6. There are infinitely many CL-terms, each of which has the fixed point property with respect to Bw .


Chapter 2.

Main theorems

49

Exercise 2.3.8. Prove that there are infinitely many distinct terms Y such that Yx Bw x(Yx) . (Hint: It is straightforward to generalize Turing’s idea to arbitrary n .) Exercise∗∗ 2.3.9. Prove that there are infinitely many distinct terms Y with the fixed

point property for Bw via a suitable generalization of Curry’s idea. (Hint: Generalize Curry’s idea to arbitrary n .) We mentioned that fixed points for unary functions are quite common in many areas, and so the idea of having a fixed point for any function might not seem very surprising by now. To return to some of the remarks we made in chapter 1 about combinatorial completeness, we state the general fixed point principle. T HEOREM 2.3.7. (G ENERAL FIXED POINT PRINCIPLE ) Let B be a combinatorially complete basis in the sense of definition 1.3.8. If f is an n -ary function such that f x1 . . . xn Bw M , where M is a term that is built from (some of) the variables x1 , . . . , xn , proper combinators and f itself, then there is a combinator Z definable from B such that Zx1 . . . xn Bw M , where the occurrences of f in M (if there are any) are replaced by Z . Proof: We divide the proof into three steps, depending on the kind of atomic subterms in M . 1. If the set of atomic subterms of M is a subset of { x1 , . . . , xn } , then the claim coincides with lemma 1.3.9; hence, the proof of that lemma can be used now with a minor addition. If B is combinatorially complete, then, by definition 1.3.8, S and K are definable from B or they are in B . The defining CL-terms can be used instead of S and K in the proof. In chapter 4, we will see that, if there are more combinators in a basis, then sometimes shorter CL-terms result from a bracket abstraction. However, using the CL-terms in place of S and K always works — independently of the concrete combinatory basis. 2. If the set of atomic subterms of M contains proper combinators in addition to some (or none) of the variables x1 , . . . , xn , then we can apply lemma 1.3.9, and obtain definitions of the proper combinators that occur in M . Then we re-apply the bracket abstraction algorithm, which is guaranteed to produce a CL-term for Z . Notice that the presence of combinators in M is unproblematic, because they do not contain variables. In fact, combinators might occur in the meta-terms that contain pseudoλ -operators. The only difference now is that we start with a term that contains some combinators and possibly variables. 3. If the set of atomic subterms of M contains f itself, then we can follow Turing’s idea to reduce the problem to that in 1 or 2. First, we replace all the occurrences of f in M by yy , where y is a new variable with respect to x1 , . . . , xn . We also replace f on the left of the Bw by gy , where g is a new function symbol. g is definable and gg is a CL-term suitable as a definition of f . qed Exercise∗ 2.3.10. Generalize Curry’s idea to give a proof of theorem 2.3.7.

So far we have focused on fixed points of single functions. Recursive definitions of numerical functions can be turned into single equations when we think of the


50


two equations in the definition as filling in parts of an “if n = 0 , then . . . , else . . . ” statement. (We will see in chapter 3 how this can be done with CL-terms representing natural numbers and functions.) However, sometimes simultaneous induction is used to define several functions or sets at once. Thus it is an interesting question whether fixed points for two functions can be found. D EFINITION 2.3.8. Let f1 and f2 be binary functions. f1 and f2 have mutual fixed points when there are x and y such that both f1 xy Bw x and f2 xy Bw y . The analogous definition in CL is as follows. D EFINITION 2.3.9. Let M1 and M2 be CL-terms. M1 and M2 have mutual fixed points just in case there are terms N1 and N2 such that both M1 N1 N2 =w N1 and M2 N1 N2 =w N2 . It is useful to compare the above definitions to f x = x , that is the single fixedpoint equation, and to MN =w N , that is the single fixed-point weak equality. The fixed point combinator Y ensures that for any function M , YM can be taken for the term N ; that is, YM is the fixed point of M . In the case of two functions, we are looking for a combinator (call it Y2 ) that, for any f1 and f2 , can serve as the head both of an N1 (such that N1 Bw f1 N1 N2 ) and of an N2 (such that N2 Bw f2 N1 N2 ). Since N1 and N2 must contain f1 and f2 , and since both f1 N1 N2 and f2 N1 N2 contain N1 and N2 , one of Y2 ’s argument places must contain f1 in both N1 and N2 , and another must contain f2 in both N1 and N2 . A third argument place must contain f1 in N1 and f2 in N2 , because f1 N1 N2 starts with f1 and f2 N1 N2 starts with f2 . In sum, Y2 must be at least ternary. If the arguments x , f1 and f2 are in that order, then we get Y2 f1 f1 f2 and Y2 f2 f1 f2 , respectively, when we substitute f1 or f2 for x . The two terms, Y2 f1 f1 f2 and Y2 f2 f1 f2 are the mutual fixed points of the functions f1 and f2 . Therefore, Y2 should have the axiom Y2 x1 x2 x3 B x1 (Y2 x2 x2 x3 )(Y2 x3 x2 x3 ).

We can use Turing’s idea and find a combinator Z such that Zvxyz B x(vvyyz)(vvzyz) . By combinatorial completeness, this function can be expressed as a combinator built from S and K only. Then Y2 is ZZ , which justifies the next claim. L EMMA 2.3.10. Any pair of CL-terms M1 and M2 has mutual fixed points. Exercise 2.3.11. Define the combinator Z using the combinators introduced so far. Exercise∗ 2.3.12. Define Z using only the combinators S and K . (Hint: You may

apply the abstraction algorithm from the proof of lemma 1.3.9, perhaps together with η , to obtain such a combinator.) Exercise∗ 2.3.13. Adapt Curry’s idea for defining Y , and find another Y2 . Exercise∗ 2.3.14. Express Y2 from the previous exercise using S and K only.


Chapter 2.

Main theorems

51

Finding mutual fixed points for several functions may be generalized easily for any n ∈ N . D EFINITION 2.3.11. Let M1 , . . . , Mn be CL-terms. The mutual fixed points of these functions are CL-terms N1 , . . . , Nn such that M1 N1 . . . Nn =w N1 .. . Mn N1 . . . Nn =w Nn . L EMMA 2.3.12. If M1 , . . . , Mn are CL-terms, then they have mutual fixed points. Proof: The search for a suitable combinator Yn can proceed as before. Let us assume that there is such a combinator. Then Yn may be an n + 1 -ary function that yields the fixed point of the function in its first argument place — when that function is identical to one of the functions in the remaining n argument places. More explicitly, we want to have the following weak equality hold. Yn xy1 . . . yn =w x(Yn y1 y1 . . . yn ) . . . (Yn yn y1 . . . yn ).

By theorem 2.3.7, Yn is definable from any combinatorially complete basis. The mutual fixed points are Yn Mi M1 . . . Mn , where 1 ≤ i ≤ n . qed Exercise∗ 2.3.15. Find a combinator that gives the mutual fixed point for three CL-

terms M1 , M2 and M3 . (Hint: You may find it helpful to use some of the combinators ( Ψ , Φ, . . . , Φn ) that were introduced in section 1.3 or to define a combinator Zxyzv B xy(xz)(xv)yzv separately.) Exercise∗ 2.3.16. Describe a general procedure for finding a suitable Yn for an arbitrary n — based on Curry’s method of finding Y . (Hint: See example 2.3.4 and the subsequent description of discovering Y according to Curry’s approach.)

The fixed point theorems may be used to show the existence of CL-terms that satisfy weak equalities of some prescribed shape. We list some exercises that are solvable by applying the ideas used in the proofs of the fixed point theorems in this section. Exercise 2.3.17. Prove that there is a CL-term M such that for any CL-term N , MN =w M . (Hint: This weak equality closely resembles MN =w N from the first fixed point theorem. However, the equations are not exactly the same, and the task now is to find one particular M for all N .) Exercise 2.3.18. Prove that there is a CL-term M such that M Bw MM . In other words, there is a CL-term that weakly reduces to its fixed point. (Hint: MM Bw M can be easily seen to hold with I in place of M , but I Bw II is certainly false.) Exercise∗ 2.3.19. Prove that, for any n ∈ N , there is a CL-term M such that M Bw

M . . M} . (Hint: Generalize the solution of the previous exercise from 2 to n .) | .{z n


52


Exercise 2.3.20. For any combinator Zn , where n > 1 , there are CL-terms M and N such that ZM =w N , where N is distinct from ZM . Show that this is true in two

different ways: using some fixed point ideas and not using them. (Hint: Recall that a combinator is a function such that when supplied with fewer arguments than its arity, in general, does not weakly reduce to any CL-term.) Exercise 2.3.21. Prove that there are CL-terms M1 and M2 such that M1 =w M1 M2

and M1 =w M1 M2 M2 . (Hint: There is a certain similarity between this exercise and exercise 2.3.18.) Exercise 2.3.22. Prove that there are distinct CL-terms M1 and M2 such that M1 Bw

M2 M1 and M2 Bw M1 (M2 M1 ) . (Hint: Recall that Bw is transitive.)

2.4

Second fixed point theorem and undecidability

As a brief concluding section, we mention two theorems here, because of their importance for CL. The proofs of these theorems will follow in chapter 3. CL is sufficiently powerful to allow encodings of recursive functions; therefore, the language of CL can be arithmetized. In particular, it is possible to encode by CL-terms the “Gödel number” function, which is denoted by G . Thus G(M) gives the CL-term that encodes the Gödel number of the CL-term M . T HEOREM 2.4.1. (S ECOND FIXED POINT THEOREM ) is a CL-term N such that M(GN) =w N .

For any CL-term M , there

The motivation for calling this theorem a fixed point theorem is obviously the shape of the weak equality. The proof that we will give does not involve an application of Y . However, the theorem is equivalent to the existence of a certain fixed point combinator, the existence of which follows from theorem 2.3.7 (by step 3 in the proof). Once G is defined, we are looking for a CL-term for a unary function f that is characterized by f x = x(G( f x)) . (Actually, G will occur in f itself in the concrete CL-term that we construct in chapter 3.) The next theorem is due to Scott, and it shows once again that CL is a highly nontrivial theory. T HEOREM 2.4.2. (S COTT ’ S THEOREM ) Let X and Y be nonempty sets of CLterms closed under =w .17 Then X and Y are not recursively separable. This claim means that it is not possible to find a set X 0 that is a superset of X, that is decidable (i.e., recursive), yet that does not overlap with Y . C OROLLARY 2.4.2.1. The set of CL-terms that have a weak normal form (wnf) is not decidable. 17 “Closure”

is applied here in the usual sense, that is, if M =w N , then if either is an element of a set, so

is the other.


Chapter 3 Recursive functions and arithmetic

Combinatory logic is a powerful formalism. This is demonstrated by its ability to formalize the notion of a computable function. Some other formal systems that can model the same class of functions are Turing machines, Post calculi, recursive functions, λ -calculi, Markov algorithms and register machines. (There are further formalisms that are just as expressive as those mentioned.) Some of these formal systems have several versions. For instance, variants of Turing machines can have a one-way or a two-way infinite tape, which does not alter the class of functions computable by Turing machines; bounding the size of the available tape by a linear function restricts, whereas adding an oracle expands, the class of computable functions.1 Some of the formalisms, let us say Markov algorithms, might appear to be more powerful than others (e.g., register machines), because, for instance, the input and output of a Markov algorithm may be a word that can contain letters from an alphabet, that is, the inputs and the output are not limited to natural numbers. This impression is misleading. However, a concrete notion of computable functions might be easier to represent in another model because of accidental features of the functions such as the permitted kinds of inputs and outputs. Computable functions — informally speaking — are functions that can be computed effectively, perhaps, as in Turing’s conception of computability: using paper and pencil. Effectiveness incorporates certain idealizations such as an unbounded supply of time (and, possibly, of other resources that are part of the concrete notion of computation). Thus the lack of sufficient time for a computation to be carried out — for instance, due to the limited life span of the solar system — does not show that a function is not computable. It shows only that there is no hope of actually computing that particular value given the function and the input. With the advancement of computer science and the ubiquity of computers, questions of practical computability, which go beyond theoretical computability, became paramount. But here we are concerned only with the theoretical aspects of computability, that is, with “computability in principle.” In order to demonstrate the expressive power of CL, we have to choose a notion of computability. Recursive functions (which subsequently we will call partial recursive functions) are functions on the set of natural numbers. They can be represented

1 For

introductions to computability, see Harel [], Boolos and Jeffrey [] and Sipser []. Other classic treatments and papers include Rogers [], Davis [] and Davis [].


54


in both CL and λ -calculus. Representing recursive functions in CL means that we have to select a suitable set of CL-terms to stand for the natural numbers, and we have to show that, for any recursive function, there is a CL-term that behaves with respect to the terms that stand for the natural numbers like that recursive function behaves with respect to the natural numbers. In this chapter, we make precise the claim about the power of CL, and afterward we look at some consequences along the lines of Gödel’s incompleteness theorem for arithmetic.

3.1

Primitive and partial recursive functions

There are different but equivalent ways to define the classes of primitive and partial recursive functions.2 Primitive recursive functions are generated from a class of functions by two operations. The functions in the base set are thought to be simple or easily calculable, in some sense. First of all, constant functions are not difficult to calculate, since they take the same value for all inputs. There is a constant zero function, which takes the value 0 whenever the argument is a natural number. Let us denote this unary function by z . Then we have that z(0) = 0 , z(1) = 0 , z(2) = 0 , etc. The natural numbers may be defined inductively from 0 by “ +1 ,” that is, by the operation of counting, which is also conceived as calculable. We denote this operation, the successor function, by s . This function is unary too, and its values are s(0) = 1 , s(1) = 2 , s(2) = 3 , etc. We may consider functions that return as their value one of their inputs. These functions are called projection functions — because of an analogy with geometry — and denoted by π ’s. The superscript on π indicates the arity of the function, whereas the subscript shows which argument becomes the value of the function. Of course, for any πnm , the subscript m must fall within the range from 1 to n . These functions are evidently similar to certain combinators. For instance, π11 is a unary function such that π11 (x) = x , that is, π11 is like the unary identity combinator I . The function π21 is binary, and always returns its first argument: π21 (x, y) = x , that is, this function behaves like K . Similarly, π22 is like KI . All the projection functions of arity greater than or equal to 2 resemble cancellators in CL, more precisely, those cancellators that drop all but one of their arguments. D EFINITION 3.1.1. The base set of primitive recursive functions comprises z , s and πnm , where m and n are positive integers (i.e., n, m ∈ Z+ ) and m ≤ n . The base set has infinitely many functions in it. Nevertheless, there are a lot of functions not in this set that are informally thought to be calculable. A frequently 2 We

give here an often-used definition — see, e.g., Boolos and Jeffrey [] and Mendelson [].


Chapter 3.

Recursive functions and arithmetic

55

exploited idea in building up a set of objects is to find operations yielding new objects that preserve some desirable property of the starting objects. Composition and primitive recursion are the operations that generate more functions, and they are thought to preserve computability. Given the unary functions f and g , their composition is f ◦ g , meaning that f ◦ g is a unary function such that the value of f ◦ g for x is f (g(x)) .3 The case of unary functions straightforwardly generalizes as follows. Let us assume that f1n , . . . , fmn are all n -ary functions, and gm is an m -ary function. Then we can put all these functions together to obtain a compound function that takes n arguments. The λ notation makes precise the way the composition operation creates an n -ary function. (fc)

λx1 . . . λxn . g( f1 (x1 , . . . , xn ), . . . , fm (x1 , . . . , xn )).

The domain ( dom ) of g is N × . . . × N , and cod( fi ) = N , for all i , 1 ≤ i ≤ n . | {z } n

The composition of two unary functions is often denoted by ◦ (as above), and we adopt this symbol (in a prefix position) for the general composition operation. Thus the above function can be written (omitting the λ ’s) as ◦(g, f1n , . . . , fmn ). The subscript on the last f indicates the arity of g , whereas the superscripts on the f ’s, which are all the same, show the arity of the function that results via composition. Example 3.1.2. Let us consider + , the addition function, as well as two unary functions, taking the square and the cube of a number x : x2 and x3 . We can compose the three functions into a unary function: λx. x2 + x3 . (In more customary notation, the new function is written as f (x) = x2 + x3 .) If we denote + by f1 , λx. x2 by f2 and λx. x3 by f3 , then f is ◦( f1 , f2 , f3 ) . Having defined f , we can calculate the values of f and we can write f (0) = 0 , f (1) = 2 , f (2) = 12 , etc. There are combinators that function as composition operations. For example, B can be seen to compose two unary functions, let us say f and g . B f gx B1 f (gx) , which, according to the convention concerning parentheses in CL-terms, means that g is applied to x and then f is applied to g(x) . B0 is also a composition combinator like B except that the order of the two functions is reversed — just as in some notational variants of function composition. (Occasionally, ( f ◦ g)(x) is spelled out as g( f (x)) .) The combinator S is called the strong composition combinator. If we consider the first two arguments in S f gx as functions (as the notation, f and g , intends to suggest) then by one-step reduction we get the term f x(gx) . The latter term can be thought of as f and g each being applied to x separately, and then the former 3 For

function composition, in general, it is often assumed — either as part of the notation, or explicitly — that the value of g(x) is in the domain of f . The codomain ( cod ) of arithmetic functions is always N , thus unary arithmetic functions always can be composed.


56


result being applied to the latter one. S0 is related to S as B0 is to B : the axiom for S0 is S0 f gx B1 gx( f x) . Function composition may appear to be one operation in virtue of the functional expression in (fc) above. The combinators that we considered, however, make clear that for any pair hm, ni , there is a function composition operation. (If we permit permutations of functions like those reflected by B0 and S0 , then for any hm, ni , where m = n or m ≥ 2 , there is more than one function composition operation.) The perspective taken in CL makes clear some of the assumptions hidden in the informal notation used in ◦(g, f1n , . . . , fmn ) . An assumption that CL does not reveal, but rather drops completely, is that the domains and codomains of the functions composed are appropriately related. The second operation generating further primitive recursive functions is primitive recursion. The structure of the set of the natural numbers suggests that calculations could proceed according to that structure. To calculate the value of a function for a given n , one could start at 0 ; once f (0) is obtained, then f (1) could be calculated according to some function applied to the value f (0) and, perhaps, to 1 . This is the idea behind recursion. The term “recursion” is derived from the calculations recursing (or “running back”) to calculations of values for smaller arguments. A binary function f (x, y) is defined by primitive recursion when, first, f (x, 0) is defined as the value of a unary function, let us say of g , at x . Then f (x, y) , for y > 0 , is the value of a ternary function h with x , y − 1 and f (x, y − 1) as its arguments. Recursive definitions are often written in the form of two equations, and the general schema of primitive recursion, defining an n -ary function can also be formulated in this way. We will first consider the case where the function defined is binary. Let g and h be a unary and a ternary function, respectively. Then the binary function f is defined by (1) and (2). (1) f (x, 0) = g(x) , (2) f (x, s(y)) = h(x, y, f (x, y)) . In order to avoid the need to postulate a side condition, we used s , the successor function in (2). Since 0 is not a successor of a natural number, s(y) is a natural number strictly greater than 0 . Example 3.1.3. Probably the simplest example of a primitive recursive function that is defined via primitive recursion is addition. A more descriptive name for this function would perhaps be “addition with recursion on the right.” We use + in a prefix position for this function. (1) +(x, 0) = x , (2) +(x, s(y)) = s(+(x, y)) . These equations do not conform exactly to the pattern prescribed by the general schema. First of all, x on the right-hand side of the equation in (1) has to be replaced by a unary function of x that gives the value x for each x . It is easy to replace the first equation by +(x, 0) = π11 (x) .


Chapter 3.


57

The second equation also has to be modified in order to have the required shape. On the right-hand side of the equation sign, we have to have a ternary function, and π33 seems to be an obvious candidate. However, +(x, s(y)) = π33 (x, y, +(x, y)) does not work, because the two equations together define the constant x function. Composition can also be understood as a sort of substitution. The equation +(x, s(y)) = s(+(x, y)) and the equation that did not work (i.e., +(x, s(y)) = π33 (x, y, +(x, y)) ) together suggest that π33 (x, y, +(x, y)) needs to be substituted into s , yielding s(π33 (x, y, +(x, y))) . Using the ◦ notation, ◦(s, π33 ) is the desired ternary function h . Thus the second equation becomes +(x, s(y)) = ◦(s, π33 )(x, y, +(x, y)) . We can look at definitions by primitive recursion as “If . . . , then . . . , else . . . ” statements. The first equation for + fills in the first two empty spots: “If y = 0 , then +(x, y) = π11 (x) , . . . ” The second equation could be written as “If y 6= 0 , then +(x, y) = s(+(x, y − 1)) . However, in this rendering the “ −1 ” or predecessor function appears. Noting that y 6= 0 is true just when y = s(n) for some n , we can get another formulation of the second equation as “If y = s(n) , then +(x, s(n)) = s(+(x, n)) .” It is always true that y = 0 or y = s(n) , but not both. Therefore, the two clauses can be straightforwardly merged into “If y 6= s(n) , then +(x, y) = π11 (x) , else +(x, y) = s(+(x, n)) .” There is a similarity — but there is also a difference — between equations involving CL-terms and definitions by primitive recursion. CL-terms are viewed as functions. Thus if a combinator occurs as the head of some redexes on both sides of an equation, then the equation resembles the second equation in the definition of a function by primitive recursion. Yx =w x(Yx) is a prototypical example of an equation (with =w as the equality relation) in which a combinator is the head of redexes on both sides of =w . A difference between this equation and an equation like +(x, s(y)) = s(+(x, y)) is that the equation containing Y has no restrictions or accompanying equations for the “base case.” To put it differently, although + occurs on both sides of the equation sign, the arguments of + are (more precisely, the second argument of the + function is) different, whereas Y ’s argument on each side is x . A definition by primitive recursion can be thought of as a pair of conditions the least fixed point of which is the function that is defined. This allows the use of the fixed point combinator in modeling primitive recursion in CL, because the fixed point combinator yields a fixed point for any function — primitive recursive or not. D EFINITION 3.1.4. The set of primitive recursive functions is defined inductively by (1)–(3).4 (1) The functions z , s and πnm (where n, m ∈ Z+ , m ≤ n ) are primitive recursive. m (2) If f n and gm 1 , . . . , gn are primitive recursive functions, then ◦( f , g1 , . . . , gn ) is an m -ary primitive recursive function.

4 As

usual, we leave the closure clause tacit in the definition. The notation ~x indicates a finite sequence of arguments.


58


(3) If f n and gn+2 are primitive recursive functions, then so is hn+1 defined by the following equations.5 1. h(~x, 0) = f (~x) , 2. h(~x, s(y)) = g(~x, y, h(~x, y)) . Exercise 3.1.1. Once we have addition, multiplication is definable as a primitive re-

cursive function. Show that ×(x, y) is a primitive recursive function. (Hint: First, give an “informal” definition as in example 3.1.3, and then adjust the form of the definition to conform to clause (3) in the above definition.) Exercise 3.1.2. The factorial of a positive natural number n (denoted by n! ) is the

product of all positive integers that are less than or equal to n . The factorial of 0 is defined to be equal to 1 . Show that f (x) = x! is a primitive recursive function. (Hint: Start by putting the given definition into a form where n! is calculated from the factorial of a number less than n .) There are many other functions commonly used in arithmetic that are primitive recursive. Our goal here has been only to look at some functions as examples and to recognize them as primitive recursive functions.6 We have two generating operations so far: composition and primitive recursion. It is thought, however, that there is another operation, minimization, that can be used to define a function that is computable in an informal sense. The range of the functions under consideration is N , the set of natural numbers, which has a least element, 0 . We can ask if a function takes 0 as its value on any argument, and, if it does, what is the least argument for which this happens. D EFINITION 3.1.5. Let f be a function of n + 1 arguments. We use y ~fx as an abbreviation for inf { y : f (x1 , . . . , xn , y) = 0 } . The n -ary function g is defined by minimization as follows. ( y ~fx if y ~fx exists (i.e., y ~fx ∈ N), g(x1 , . . . , xn ) = ? otherwise, where ? means that g(x1 , . . . , xn ) is undefined. The minimization operation that yields g is denoted by µ , that is, µ f is g . Sometimes, the notation µxn+1 f is used instead together with the convention that minimization affects the last argument of f . Having a variable after µ may seem like a good idea, because xn+1 is not an argument of µ f . However, one of the insights CL provides for us is that µ can be considered to be an operation on a function and need not be viewed as a variable binding operator like ∀ or λ . 5 If

n = 0 , then f (~x) is a constant. have included a few more examples in section A.3.

6 We


Chapter 3.


59

The abbreviation inf stands for infimum (greatest lower bound), and we assume that x1 , . . . , xn , xn+1 and y are natural numbers, which come with the usual ≤ ordering on N . If g(x1 , . . . , xn ) = y , that is, the value of g is obtained from the first case in the definition of g , then this implies that f (x1 , . . . , xn , xn+1 ) = 0 for at least one xn+1 . If there is no such xn+1 , then { xn+1 : f (x1 , . . . , xn , xn+1 ) = 0 } = 0/ . However, inf 0/ does not exist in N , because there is no largest natural number. Minimization allows us to define an n -ary function from another function that has arity n + 1 . The minimization happens with respect to the last argument of f .7 The first line in the definition gives the value of g for hx1 , . . . , xn i (i.e., y ) if the function f takes the value 0 for hx1 , . . . , xn , yi and y is the least such number in the n + 1 st argument place of f with hx1 , . . . , xn i fixed. The second line in the definition indicates that the function g is undefined for hx1 , . . . , xn i if f never takes the value 0 with hx1 , . . . , xn i as its first n arguments. The definition may seem to be “wildly non-computable.” But inf can be read here as “the least natural number such that . . . .” Then it is clear that it is not necessary to find all the members of { xn+1 : f (x1 , . . . , xn , xn+1 ) = 0 } before returning the least element of the set as the value of g(x1 , . . . , xn ) . There is another question concerning computability to which we will return a bit later. Example 3.1.6. Let us consider s for a moment. µs is constantly undefined, because s(x) 6= 0 for any x . Thus µ ◦ (s, +) is a unary function that is totally undefined. To see what is going on, let us write ◦(s, +) (informally) as s(+(x, y)) , where x and y are the arguments, in that order. The composition with s results in the successor of the sum of x and y . Since s itself never takes the value 0 , it does not matter what is the sum of x and y ; s(+(x, y)) is never 0 for any x . µs(+(x, y)) is a function of one variable, namely, of x , and µ ◦ (s, +)(x) = ? , for all x . The example shows that minimization may result in a function that is not everywhere defined (i.e., not total), even if the function to which µ has been applied is itself total. In terms of computation — both in the informal sense and in the sense of a computing device — if the value of a function is undefined for some input, then the computation does not terminate; it is divergent. One of the popular models of computation is the Turing machines. If a Turing machine does not stop in a standard configuration (for instance, because it enters a loop), then the value of the function being computed cannot be determined; hence, it is undefined. This computational viewpoint hints at a potential difficulty with respect to the minimization operation, if it is applied repeatedly to a primitive recursive function. If ? appears as a value of f for hx1 , . . . , xn , y1 i before a y2 with f (x1 , . . . , xn , y2 ) = 0 is found, then it is not clear how to compute (µ f )(x1 , . . . , xn ) . In other words, the difficulty is that ? is not a genuine value for a function; it is merely a symbol that we use to indicate the lack of a value. · , a sort of subtraction, which is primitive Let us consider a concrete function: − recursive and it is undefined for any pair hx, yi , when y > x but otherwise equals x 7 There

is nothing special about the last argument of f ; it is simply notationally convenient to select this argument “to disappear.”


60


· , we can define minus y (i.e., the result of subtraction in the usual sense). Given − s s a function, which we denote by − , such that − is undefined for h0, yi when y > 0 · , which gives 0 ). For all x > 0 , there is a y such that but also for h0, 0i (unlike − hx, yi yields a genuine value (i.e., a value other that ? ). To round out the description s s of − , we make − a binary function that takes values as follows.8   x − s(y) s x− y= ?   ?

if x > y, if x = y, if x < y.

s We will use the successor function in the definition of − (this is what “justifies” s · the notation). Let us compose − in its second argument with s , that is, let x − y= · x − s(y) . The smallest number that can be put in the place of both x and y is 0 . s s s s s However, 0 − 0, 0 − 1, 0 − 2, 0 − 3 , etc., are all undefined, that is, 0 − 0 = ?, s s 0−1 = ?, 0−2 = ?, . . . . s s If we apply minimization to the function − , then we get a function, µ− , which is undefined for 0 only. Of course, we could think of this unary function in set-theoretic terms as a set of ordered pairs over N∪{ ? } , namely, {h0, ?i, h1, 0i, h2, 1i, h3, 2i, . . .} , but ? ∈ / N . Thinking computationally about minimization, we could assume that the s least y is found by going through all the possible values starting with 0 . But 0 − 0 s is undefined, 0 − 1 is undefined, and so on. It is important to note that we are not given the “bird’s-eye” view of this function that we provided in the above definition s by cases. We do not know at the point when 0 − y is considered that, if the function is undefined for this y , then so it is for any inputs greater than this particular y . Thus s infinitely many possible inputs have to be considered to determine that µ − (0) = ? . The undefined value is inherited through function composition, and if an undefined value is like a diverging computation, then that is not a problem with respect to calculating the value of the composed function. However, if the 0 of a function follows undefined values, then the computation does not reach the 0 . A diverging computation or a loop in a computation is itself similar to stepping through an inifinity of steps. The problem of stepping through infinitely many numbers before getting to another stage is similar to a problem that can emerge if a naive approach is taken toward showing that there are ℵ0 many rational numbers.9 Rational numbers may be defined to be fractions of positive integers signed with + or − and with 0 thrown into the set. (Alternatively, Q = { mn : m, n ∈ Z ∧ n 6= 0 } , where Z is the set of all integers.) The positive rational numbers may be listed as shown in the following table.

8 The

previous sentence did not give a full description of the function. Our intention is to get an easily definable function that can still serve as an illustration. s 9 The analogy with a naive attempt at an enumeration is quite appropriate here. − will not be excluded from the set of functions to which minimization can be applied, because no initial segment of N that s s yields ? everywhere is followed by a natural number n such that x − n = 0 . For all n ∈ N , 0 − n = ?.


Chapter 3.

Q+

61


1

2

3

4

5

6

7

···

1

1/1 2/1 3/1 4/1 5/1 6/1 7/1

···

2 3 4 5 6 7 .. .

1/2 2/2 3/2 4/2 5/2 6/2 7/2

···

1/3 2/3 3/3 4/3 5/3 6/3 7/3

···

1/4 2/4 3/4 4/4 5/4 6/4 7/4

···

1/5 2/5 3/5 4/5 5/5 6/5 7/5

···

1/6 2/6 3/6 4/6 5/6 6/6 7/6

···

1/7 2/7 3/7 4/7 5/7 6/7 7/7 ···

···

···

···

···

···

···

···

..

.

This arrangement is obviously redundant. For example, all n/n ’s are notational variants of 1/1 , that is, 1 . However, if the listing with repetitions can be shown to have cardinality ≤ ℵ0 , then card(Q+ ) = ℵ0 , because Z+ ⊆ Q+ . If Q+ is enumerated line by line, then we get an infinite sequence of length ℵ0 from the first line alone. Of course, the point of arranging Q+ into the infinite matrix above is to reveal the short diagonals, which can be used to enumerate Q+ as one denumerable sequence. Such an enumeration will have each positive rational repeated infinitely many times — just as in the matrix. The operation of minimization could not be seen to yield a computable function if for some x infinitely many steps would precede reaching a y yielding the value 0 in the calculation. From this computational angle, an undefined value may be thought of as a loop in a Turing machine. This means that if we incorporate minimization into the definition of recursive functions, we have to restrict the class of functions to which minimization may be applied. D EFINITION 3.1.7. (M INIMIZATION ) Let f n+1 be a function that has the property in (1). (All x1 , . . . , xn , y, z and v range over elements of N . As previously, we abbreviate inf { y : f (x1 , . . . , xn , y) = 0 } by y~xf .) (1) ∀y. (∃v. v = y~xf ∧ y < v) ⇒ ∃z. f (x1 , . . . , xn , y) = z The minimization on f gives the n -ary function g that is defined as ( y~xf if y~xf exists, g(x1 , . . . , xn ) = ? otherwise. Condition (1) on f says that starting with 0 for y , and counting upward, as long as f (x1 , . . . , xn , y) 6= 0 , f (x1 , . . . , xn , y) gives a genuine value z (i.e., a z such that z ∈ N ). Definitions 3.1.5 and 3.1.7 are really the same except that the latter definition restricts the type of functions to which the operation can be applied. If a function f is total, that is, it returns a natural number as a value for every n + 1 -tuple of natural numbers, then obviously µ f is the same function no matter which definition


62


is used. Example 3.1.6 showed that the minimization operation can lead to a function s g that is not everywhere defined even though f is a total function. − satisfies condition (1) for f in definition 3.1.7, and, therefore, the two definitions give the same result. In general, if both definitions are applicable, then they yield the same function. However, with functions that are not everywhere defined, care has to be taken to make sure that the resulting function is computable, which is ensured when the function is defined “below its least zero.” Thus we take the definition 3.1.7 as the definition of minimization. D EFINITION 3.1.8. A function is partial recursive iff it is 1. one of the basic primitive recursive functions z , s and πnm ( m, n ∈ N and m ≤ n ), or 2. obtained from partial recursive functions by composition and primitive recursion, or 3. obtained from a partial recursive function by minimization. The name “partial recursive” is sometimes replaced by its permuted variant “recursive partial.” The latter expression, perhaps, is less likely to imply that the functions in question are not everywhere defined. The intended meaning of “partial recursive functions” is that the set of these functions contains not only total functions but also functions that are partial. Each function is (definitely) either partial or total. Thus another way to explicate the meaning of “partial” in “partial recursive” is to say that it is not assumed that a function belonging to this set is total. Totality contrasts primitive recursive functions with partial recursive functions, which are not all total. Sometimes, “partial recursive” is used only for those functions from definition 3.1.8 that are indeed partial or that are not primitive recursive, and then “recursive” refers to all or to the rest of the functions.10 The set of partial recursive functions is identical to the set of general recursive functions; however, the latter class of functions is defined by sets of equations over primitive recursive functions rather than via a minimization operation.11 L EMMA 3.1.9. All primitive recursive functions are total, that is, everywhere defined. Proof: The set of primitive recursive functions is defined inductively, and so the proof that we sketch is by induction. The basic functions can be seen to be total at once. The inductive step is split into two, since there are two operations in the definition of primitive recursive functions that generate primitive recursive functions. Let us assume, as the hypothesis of induction, that gn1 , . . . , gnm are total functions, and so is 10 As

we mentioned already, we use “recursive” as a short name for partial recursive functions, and we include “primitive” when it is important that a function belongs to that smaller class of functions. 11 We do not introduce general recursive functions in detail here. However, see [], [] and [].


Chapter 3.


63

hm . Then, given x1 , . . . , xn , gi (x1 , . . . , xn ) ∈ N for each i (where 1 ≤ i ≤ m ), which then implies that ◦(h, g1 , . . . , gm ) has a value — a natural number — for hx1 , . . . , xn i . The proof is completed by the step in exercise 3.1.3. qed Exercise 3.1.3. The definition of a primitive recursive function may involve primitive

recursion (see definition 3.1.4). Finish the proof of the preceding lemma by proving that a function defined by primitive recursion is total, if the functions used in the definition are total. Obviously, not all recursive functions are total — as we have already demonstrated by examples. The term “partial recursive” indicates only that totality is not assumed, but one might inquire “How partial are the partial recursive functions?” If we look at functions as ordered tuples, then there are only a few distinctions that can be made. A function may have no (genuine) value: for no inputs, for one or more but finitely many inputs, for infinitely many inputs or for all inputs. However, in terms of generating a function we may correlate (potential) partiality with minimization. T HEOREM 3.1.10. (K LEENE NORMAL FORM ) If f is a partial recursive function, then f may be defined (from the basic functions using composition and primitive recursion) with at most one application of minimization.12 We included this theorem here merely to emphasize the difference between the roles that the three generating operations play in the definition of partial recursive functions. Of course, minimization cannot be completely eliminated, because then we would be left with primitive recursive functions only. The informal notion of computable functions is wider than the set of primitive recursive functions. A well-known example is the Ackermann function. The Ackermann function is defined by a set of equations, which, however, do not adhere to the primitive recursion schema. Ackermann’s original function and its definition have been simplified and modified by others without the characteristic property of the function being lost. The modified functions are often labeled as Ackermann functions too. D EFINITION 3.1.11. Let the binary function g be defined by (i)–(iii). (i) g(x, 0) = 0 , (ii) g(x, 1) = 1 , (iii) g(x, s(s(y))) = x . The Ackermann function a is ternary and is defined by (1)–(3). (1) a(x, y, 0) = x + y , (2) a(x, 0, s(z)) = g(x, z) , 12 The

claim is more formally stated (and also proved) in Rogers [, §1.10]. A strengthening is given by Smullyan [, §14, theorem 9].


64


(3) a(x, s(y), s(z)) = a(x, a(x, y, s(z)), z) . The function g is merely an auxiliary function in the definition, and it is not difficult to see that g is primitive recursive. It may be overlooked that (1)–(3) are not of the form of the primitive recursive schema.13 The discrepancy is in (3), where on the left hand side of the equation both y and z are taken with the successor function, that is, a recursion happens on two variables.14 Exercise∗ 3.1.4. Show that the function g in the above definition is indeed primitive

recursive. Ackermann proved that a is not primitive recursive. Ackermann’s function and similar functions have been garnering more attention lately. The characteristic property of these functions is that they dominate all primitive recursive functions. A function f dominates g iff there is an n ∈ N such that for all n0 > n , f (n0 ) > g(n0 ) . We have seen that addition and multiplication are primitive recursive, but so is exponentiation. Domination of all primitive recursive functions implies that the function a after a certain point grows faster than exponentiation, which is considered to be growing unfeasibly fast from the point of view of complexity theory and actual computations on computers. We only wish to reiterate that a is computable; therefore, the primitive recursive functions cannot be taken to capture the informal notion of computable functions. Exercise 3.1.5. Ackermann’s function is sometimes called “generalized exponentia-

tion.” Which value for which argument of a does give the “real” exponentiation function? Exercise∗ 3.1.6. Calculate the value of a(2, 2, 4) . (Hint: Write out the steps of the cal-

culation of values of a with smaller arguments that are used in calculating a(2, 2, 4) , which is an “enormous” number.)

3.2

First modeling of partial recursive functions in CL

A modeling of partial recursive functions requires us to show that for any such function there is a CL-term that computes as expected on the set of CL-terms, which are taken to represent the natural numbers. Natural numbers and functions on them may be represented in various ways using CL-terms. These numbers are extremely familiar to all of us, and we might think at first that we really know very well what natural numbers are. However, when natural 13 The

function + is used in the usual infix notation, but + is the same addition function as above, and hence primitive recursive. 14 See also G¨ odel [, §9].


Chapter 3.


65

numbers are taken to be mathematical objects, then — unsurprisingly — it turns out that there are different approaches to defining or characterizing them. For instance, natural numbers can be represented by various sets. 3 may be the set of all sets that have three elements, or 3 may be the set with elements 0 , 1 and 2 , where the latter are also certain sets. Having more than one way to describe natural numbers and partial recursive functions within the set of CL-terms is completely unproblematic and does not diminish the significance of a representation.15 Church in [] gave a representation of natural numbers by λ -terms, and defined the notion of λ -computable functions on them. λ -calculi and CL are closely related — as we will see in more detail in chapter 4 — and so are Church’s representation and the following one. D EFINITION 3.2.1. (NATURAL NUMBERS , 1) numbers are as follows.

The CL-terms that stand for natural

(1) 0 is KI ; (2) if M is x , then s(x) is SB(M) . In other words, zero is KI and the successor function is SB . Partial recursive functions are defined inductively, and this means that it is sufficient to find terms that represent the basic functions and the generating operations to have an inductively defined set of CL-terms that represent partial recursive functions. The successor function, s is already given; and the constant zero function z can be taken to be K(KI) . We need to have that z(x) = 0 for any argument x , and K(KI)x Bw KI , which is 0 . We can use z to highlight a feature of our enterprise that may seem slightly unusual at first. When we defined recursive functions, we tacitly assumed that numbers and functions are different sorts of objects. We would not even consider s(z) , for instance, to be a well-formed expression. This is in sharp contrast with what happens when CL-terms stand in for numbers and functions. SB(K(KI)) is a CL-term, and this term is in weak nf just as SB(KI) is. The dissimilarity is even greater in the case of K(KI)(SB) . z(s) is not a well-formed expression in the context of recursive functions, because s ∈ / dom(z) (i.e., s ∈ / N ), and so z(s) = 0 is senseless. On the other hand, K(KI)(SB) is not in nf, and K(KI)(SB) Bw KI just as K(KI)M Bw KI for terms M that are natural numbers. On second thought, we can see that there is nothing strange about natural numbers and recursive functions both being CL-terms. The lack of apparent distinctions between terms representing functions and terms representing numbers is not unusual. 15 In

a certain sense, it is not clear how to characterize the natural numbers, because the first-order axiomatization of arithmetic (Peano arithmetic or PA) is not categorical — as demonstrated by the existence of nonstandard models. We do not go into a detailed discussion of these questions no matter how interesting or important they are. We only need here a more or less common-sense understanding of the natural numbers and of the fact that there are alternative set theoretical modelings of them.


66


Some terms can be interpreted as a “legitimate” application of a function to a number, whereas other terms cannot. This is completely in parallel with representations of numbers and functions in set theory. One might think that functions obviously differ from numbers, because they are ordered pairs (or tuples). However, ordered pairs are just sets, which have a particular structure, perhaps like { { a }, { a, b } } , which is ha, bi . Unless we know which encoding of ordered pairs into sets is used, we will see only { { { a }, 0 }, { { b } } } or { { a, 0 }, { b, 1 } } without knowing which (if either) is ha, bi .16 All the projection functions except π11 omit at least one of their arguments. The corresponding combinators are cancellators. The projection functions return one of their arguments. This implies that the corresponding combinators are proper. One of these combinators is K , which is often taken to be an element of the combinatory basis. By lemma 1.3.9, for any function f with the rule of computation f n (x1 , . . . , xn ) = xi (where 1 ≤ i ≤ n ), there is a combinator Z that is definable from { S, K } , or any other combinatorially complete basis, such that Zx1 . . . xn Bw xi . Exercise 3.2.1. Define combinators that can represent the projection functions π31 , π43 and π44 . (Hint: In order to get shorter CL-terms, you might wish to use some further combinators beyond S and K .)

Next we have to show that composition is expressible by combinators. We assume — as our inductive hypothesis — that there are combinators that represent the functions that are being composed. Let Mg and M f 1 , . . . , M f m be the combinators for g and f1 , . . . , fm , respectively. This means that if N1 , . . . , Nn are CL-terms for some natural numbers l1 , . . . , ln , then M f i N1 . . . Nn Bw N j just in case fi (l1 , . . . , ln ) = l j , where 1 ≤ i ≤ m . Then the representation of composition simplifies to the issue of finding a CL-term Zm+n+1 such that Zc Mg M f 1 . . . M f m N1 . . . Nn weakly reduces c to Mg (M f 1 N1 . . . Nn ) . . . (M f m N1 . . . Nn ) . Slightly more abstractly, we have to have a combinator Z with arity m + n + 1 such that Zc x1 . . . xn+m+1 B x1 (x2 xm+2 . . . xm+n+1 ) . . . (xm+1 xm+2 . . . xm+n+1 ).

Without the preceding context, it could seem puzzling why we are interested in this particular combinator. The indices, of course, capture the intended structure of the resulting term, but that might seem arbitrary or at least unmotivated without the idea of composition. The desired axiom for Zc makes it clear that Zc is an easily definable combinator. There are no variables on the right-hand side of B that do not occur on the left-hand side, and there are no constants either. Moreover, Zc itself does not occur on the right-hand side. In other words, composition is represented by proper combinators, for all m and n . The reduction pattern displayed above also reminds us that we need a combinator for each pair hm, ni (where 1 ≤ m, n and m, n ∈ N ), because the operation that is called composition of functions in the theory of recursive functions is more complicated than we first might have thought. From 16 In

fact, some models of CL rely on the possibility of encoding functions as natural numbers. See section 6.3.


Chapter 3.


67

the axiom for Zc , we can see that if m = 1 , then Zc only needs to be an associator, whereas if m > 1 , then Zc must be also a duplicator for each of its arguments from xm+2 to xm+n+1 . Example 3.2.2. The case of h1, 1i is quite simple, indeed, this is what is most often denoted by ◦ . f ◦ g is the function that takes one argument and ( f ◦ g)(x) = f (g(x)) , for any x . If the CL-terms for f and g are M f and Mg , and N is the term representing the argument, then B does the job. Indeed, BM f Mg N B1 M f (Mg N) , which is the desired CL-term. Example 3.2.3. Let us assume that we would like to find a combinator for h2, 1i composition. That is, g11 and g12 are to be composed with h2 . The superscript on the g ’s tells us that the resulting function is unary, thus we want to have a combinator, let us say Z42,1 , such that Z42,1 x1 x2 x3 x4 B x1 (x2 x4 )(x3 x4 ) . We might notice the similarity between the term on the right and the term x2 x4 (x3 x4 ) that results from the reduction of Sx2 x3 x4 . In fact, Z41,2 is one of the Φ ’s, which we introduced in definition 1.3.23 — the Φ without subscripts. Using this insight, we can take instead of x1 (x2 x4 )(x3 x4 ) the term Bx1 x2 x4 (x3 x4 ) . Then S(Bx1 x2 )x3 x4 would work, except that x1 and x2 are grouped together with B . Of course, we can add another B (or two) to “ungroup” Bx1 x2 , first to get BS(Bx1 )x2 x3 x4 , and then to arrive at B(BS)Bx1 x2 x3 x4 . B is definable in terms of S and K , and so we can replace all the occurrences of B with S(KS)K , if we want to. This example shows that with some ingenuity and “backward thinking,” that is, utilizing expansions rather than reductions, we can find a suitable proper combinator for h2, 1i composition. But we certainly cannot give an infinite list of combinators if there is no formally describable systematic pattern in their structure. In order to guarantee that there is a proper combinator for each composition hm, ni , we again appeal to the lemma 1.3.9 stating combinatorial completeness. Exercise 3.2.2. Find a composition combinator for h2, 2i and h3, 4i . You may use

either heuristics together with the various combinators introduced in chapter 1, or the bracket abstraction algorithm from the proof of lemma 1.3.9. The next operation that we have to show to be representable by CL-terms is primitive recursion. An application of the two equations in clause 3 of definition 3.1.4, may be thought of as checking whether y is 0 , and then performing different calculations in accordance with the answer. This is how we would calculate the value of a function defined by primitive recursion — at least until we have some other algorithmic descriptions of the function. For instance, the addition algorithm taught in school is obviously different from the algorithm obtainable from example 3.1.3. The former relies on a small addition table (which is memorized) together with some features of the decimal notation. If y = 0 is true, then the value of h(~x, 0) is calculated as f (~x) (where ~x are all the other arguments of h ). If y 6= 0 — therefore, y > 0 , that is, y = s(z) for some z — then g(~x, y, h(~x, y)) is calculated. Then clearly, it would be useful to have a predicate that is only true of 0 , an “if . . . , then . . . , else . . . ” construction and a function that is the inverse of s (for x > 0 )


68


— together with a couple of other components. We do not yet have combinators for these concepts, thus we consider them one by one. D EFINITION 3.2.4. (T RUTH AND FALSITY ) The combinators K and KI represent the two truth values, truth and falsity, respectively. Two-valued logic ( TV ) has an interpretation based on these truth values. In algebraic presentations of classical sentential logic, the truth values are often replaced by 0 and 1 . Then the connectives are interpreted as numerical functions, such as × and + (mod 2) . Falsity is the same combinator as the combinator for 0 , but truth is not the same combinator as 1 . The choice of K and KI for the truth values is motivated by their behavior when they are applied to a pair of terms. KIxy Bw Iy Bw y , whereas Kxy Bw x — one of the combinators retains the second argument, the other one keeps the first. This leads to a straightforward definition of branching conditioned on a true or false expression. Having a predicate that is true of 0 (i.e., of KI ), and false of all numbers greater than 0 (i.e., of all terms of the form SB(. . . (SB(KI))...) ) means finding a Z[0] such that given an argument it reduces to K or KI . This task may seem not doable in CL, because a remarkable feature of combinators is that there is no restriction on what their arguments are. The arguments of a combinator may be — but cannot be required to be — the same or to be variables. The arguments cannot even be required to be different from the combinator that is applied to them. The trick is to position K or KI in the reduct of the combinator Z[0] , and to take into account the reduction patterns of the CL-terms representing natural numbers. Example 3.2.5. Let us assume that x and y are CL-terms to which a CL-term standing for a natural number is applied. Natural number terms are listed on the top line, and the result of weak reductions are on the bottom line. KI

SB(KI)

SB(SB(KI))

SB(SB(SB(KI)))

y

xy

x(xy)

x(x(xy))

··· ···

The pattern may be discovered quite easily: as many x ’s are in front of a y as there are SB ’s in the combinator. That is, if the CL-term stands for n , then there are n x ’s. Furthermore, the resulting term with the x ’s and y ’s (which are atomic) is right-associated. The term KIzK reduces to K (i.e., to truth) no matter what z is. On the other hand, K(KI)z reduces to KI (i.e., to falsity) no matter what z is. It remains to integrate all these observations into one term defining the zero predicate. We pick K(KI) for x and K for y from the above example. That is, the combinator Z[0] should have as its axiom Z[0] x B x(K(KI))K . Such a combinator is, certainly, definable from any combinatorially complete basis. For example, C(B(CIK))(K(KI)) is a suitable CLterm for the combinator Z[0] . Exercise 3.2.3. Verify that Z[0] applied to the combinatory terms, which stand for 0 ,

1 , 2 and 7 , gives the desired result.


Chapter 3.


69

Once we have Z[0] , we do not need the “if . . . , then . . . , else . . . ” construction in its full generality for primitive recursion. Rather we only need “if K , then M , else N ,” because we can use the zero predicate to test if a number is zero. Let us recall that truth and falsity are both binary combinators, moreover, they are both cancellators. We may think about their two arguments as an ordered pair, since the order of the arguments, in general, is not arbitrary. Thus we are looking for a ternary combinator such that if its first argument reduces to K , then the result is the second argument, and if the first argument reduces to KI , then the result is the third argument. Despite the importance of the “if . . . , then . . . , else . . . ” constructor in programming languages, usually, there is no corresponding primitive connective in formulations of two-valued logic. This may cause us to anticipate to find a complicated combinator. Then it may come as a surprise that the combinator we are looking for is the ternary identity combinator I3 . This combinator is definable from the primitives we already have, for instance, as the CL-term B(BI) , where I is the unary identity combinator that was introduced in chapter 1. If the first argument of I3 is not (or does not reduce to) truth or falsity, then the resulting term may not represent a number. Take, for example, CI (i.e., T ) in place of K as the first argument. I3 (CI)MN Bw NM , and this term may compute the application of the number represented by N to the number represented by M , if those terms are numbers. (Of course, application is not an operation on numbers, but on terms, thus we might prefer to think of NM simply as two juxtaposed numbers, though NM is not in nf when N stands for a number.) We encountered the need for “counting down” (or having an x − 1 function) when we introduced primitive recursion. Accordingly, we need a combinator for the function that is the inverse of the successor function, more precisely, the inverse of the successor function with the ordered pair h0, 0i added. This function is usually called the predecessor function; we denote this function by p . Informally, p(x) = x − 1 whenever x > 0 , and 0 otherwise (i.e., when x = 0 ). The predecessor function is crucial, because it is often involved in definitions by primitive recursion not only nominally, but also in the actual calculation of the value of a function. For instance, the predecessor function is needed if we wish to define · , a subtraction function. − · in its full generality is not definable on the set of − natural numbers, because N is not closed under this operation. However, just as p is a version of x − 1 amended with 0 − 1 = 0 , a version of subtraction enhanced with x − y = 0 (when x < y ) is a definable and useful function. D EFINITION 3.2.6. The predecessor function p is not a basic recursive functions, however, it is easily definable via primitive recursion as follows. 1. p(0) = 0 ; 2. p(s(x)) = π21 (x, p(x)) . π21 in the second clause means that we take p(s(x)) to be x , and disregard the second argument, namely, p(x) . We might note that this definition suggests that given an alternative representation of natural numbers by CL-terms as pairs, the predecessor function might become definable without emulating primitive recursion or


70


computing. (We set aside this observation for now, but we will return to it in the next section, where such an alternative representation is given.) The above definition by primitive recursion is quite simple, hence we will use this definition as an example for the definition of a combinator that represents primitive recursion. To justify the idea that it is reasonable to look for one combinator for each potential arity for h , we point out that each definition by primitive recursion is completely characterized by two functions.17 Those functions are the function that is specific to a definition’s first clause and the function that is specific to the second clause. In case of p , these are the nullary function 0 (as f ) and π21 (as g ). Given these two functions the whole definition can be reconstructed, because the format of primitive recursion does not change from function to function. The “if . . . , then . . . , else . . . ” construction provides the bare-bone skeleton for primitive recursion. However, the modeling of primitive recursion is not yet solved, because the second equation includes the function that is being defined by the equations. Following the two clauses in definition 3.1.4, we want to have a ternary combinator Z such that ZXY Z reduces to X if Z is KI (i.e., zero), and ZXY Z reduces to Y Z − (ZXY Z − ) , where we used Z − for the term the successor of which is Z .18 We already saw that conditional branching on zero can be defined by combinators — by Z[0] and I3 . Again a way to define Z is to exploit the functional properties of the numbers rather than to assume that a combinator has different reductions depending on the shape of the terms in its arguments. We already saw, in the previous chapters, that it is possible to define certain improper combinators, in particular, fixed point combinators from combinatorially complete bases. Thus it is reasonable to expect that a combinator such as Z above is definable. First we define a combinator D that is the specialized version of “if . . . , then . . . , else . . . ” that we mentioned above. Dxyz can be read as “if z = 0 , then x , else y .” The third argument is expected to be a number, and if it is zero, which is the CL-term KI , then x should be selected. If the third argument is of the form SB(. . . (SB(KI))...) , then y should result. This can be accomplished if the axiom for this combinator is Dxyz B z(Ky)x . A term that defines D using well-known proper combinators is C(BC(B(CI)K)) . Exercise 3.2.4. Take as the first two arguments for D the terms M and N . Let the third argument be a term representing a number. For instance, let KI and then let SB(SB(SB(KI))) be z . Verify by writing out the one-step reductions that D behaves as “if z = 0 , then x , else (i.e., if z > 0 then) y ,” that is, DMN(KI) Bw M and DMN(SB(SB(SB(KI)))) Bw N .

Now, using D we define a binary combinator Q that can be thought to mimic the recursive part of primitive recursion. The idea here is to calculate from 0 up to n 17 Each

of the functions that we denoted by f and g in definition 3.1.4 determines the arity of h . is convenient from the point of view of CL-terms to have the term corresponding to x as the last one. This is how the definition is usually constructed; we only note that the combinator CC would yield our desired order of arguments from the order suggested by the natural language expression “if . . . , then . . . , else . . . .” 18 It


Chapter 3.


71

via repeating the calculations in the recursive clause in the definition of the primitive recursive function. In order not to be overly specific, the function that is used in the second clause of a primitive recursive definition is abstracted out (as x ), that is, it is turned into an argument of Q . The axiom for Q is Qxy B D(SB(y(KI)))(x(y(KI))(y(SB(KI)))). Exercise∗ 3.2.5. Q is, obviously, not a proper combinator, however, there is no principal obstacle that would prevent us from defining it. Find a CL-term that defines Q . (Notice that some of the subterms are terms for 0 , 1 and the successor function,

which might suggest that some temporary abbreviations might be useful in order to find a definition for Q quickly.) If Q is applied to the terms Y and DZX (where Z stands for a number), then QY (DZX) Bw D(SBZ)(Y ZX) . Exercise 3.2.6. Go through the reduction steps leading to D(SBZ)(Y ZX) .

If Z is KI , then D(SB(KI))(Y (KI)X) — viewed informally — is the ordered pair h1, (Y 0X)i . A selection of the first or of the second element can be made by supplying a number as the third argument of D . So far we have that QY (D(KI)X) Bw D(SB(KI))(Y (KI)X).

From QY (D(KI)X) we could move on to another term, in which this term is the second argument of Q with Y being the first. Then we get the following reductions. QY (QY (D(KI)X)) Bw QY (D(SB(KI))(Y (KI)X)) Bw D(SB(SB(KI)))(Y (SB(KI))(Y (KI)X)).

The second argument of D in the resulting term can be seen to accumulate subterms that can be turned into calculations of the value of Y on 0, 1, . . . . The first argument of D functions as a counter, which is incremented by each iteration of Q . The numbers themselves are of the form f (. . . f ( f (g))...) , and so the iteration of QY is itself similar to counting. Looking at the terms (Y (KI)X) , (Y (SB(KI))(Y (KI)X)) , . . . , we may notice that the number immediately following the first occurrence of Y is characteristic for the whole term. That is, the rest of the term can be restored once this number is known (together with Y and X , of course), because the term is of the form Y (SB . . . (SB(KI))...)(. . . (Y (SB(KI))(Y (KI)X))...). | {z } n

We denote these terms by W0 , W1 , . . . . Clearly, for each number these terms can be written out in full, however, in order to be able to refer to these terms with an arbitrary number, we have to have some sort of abbreviation, which hides their internal structure.


72


The whole reduct is QY (. . . (QY (D(KI)X))...) Bw

|

{z

}

n

D(SB(. . . (SB(KI))...))(Y (SB . . . (SB(KI))...)(. . . (Y (KI)X)...)),

|

{z

}

|

n

{z

}

n−1

or more compactly and somewhat informally (with natural numbers inserted into the CL-terms): (QY )n (D(KI)X) Bw Dn(Y (n − 1)Wn−1 ). Wn can be obtained as the reduct of DNWn (SB(KI)) , where N is the CL-term for n ; this is immediate from the axiom of D . DNWn (SB(KI)) is the term we obtained from filling out the arguments of Q by Y and D(KI)X , but further applied to the CL-term representing 1 . An effect of applying QY to DNX was incrementing N by one. Thus DNWn (SB(KI)) is the reduct of QY (. . . (QY (D(KI)X))...)(SB(KI)).

|

{z

}

n

The numbers are of the form of function application and they yield a function applied to an argument, hence, by yet another expansion, we get that Wn can be obtained from N(QY )(D(KI)X)(SB(KI)) , where N is the CL-term for the number n . The last term contains three terms N , X and Y , which are, respectively, a natural number and the two functions from the primitive recursion schema. Thus the combinator that we need to emulate primitive recursion has the following axiom.19 ZB x1 x2 x3 B x3 (Qx2 )(D(KI)x1 )(SB(KI)). ZB is yet another combinator which is not proper. However, there is no difficulty to find a definition for ZB , since both Q and D , as well as I, B, S and K are either proper combinators or they are definable from proper combinators. Exercise 3.2.7. Find a definition of ZB using Q, D, I, B, S, K , and, possibly, other

proper combinators that were introduced in chapter 1. Let us now see how we can find a combinator to stand for p , the predecessor function given that we have the combinator ZB . The definition of p using primitive recursion is in definition 3.2.6. The two functions that are used with the schema of primitive recursion are 0 and π21 . The corresponding CL-terms are KI and K , that is, the combinator representing p is ZB (KI)K . First, p(0) = 0 should be true. ZB (KI)K(KI) reduces to KI(QK)(D(KI)(KI))(SB(KI)) . By two one-step reductions, we get D(KI)(KI)(SB(KI)) . The third argument of D stands for 1 , which means that the result is KI , that is, 0 . (It is incidental that the first argument of D would work as the final result in this case too.) 19 The

idea of this combinator is due to Paul Bernays; hence the subscript on the combinator.


Chapter 3.


73

The predecessor of 3 is 2 , that is, p(3) = 2 . The following term and some reduction steps illustrate the structure of the calculation. ZB (KI)K(SB(SB(SB(KI)))) Bw SB(SB(SB(KI)))(QK)(D(KI)(KI))(SB(KI)) Bw QK(QK(QK(D(KI)(KI))))(SB(KI)) Bw QK(QK(D(SB(KI))(K(KI)(KI))))(SB(KI)) Bw QK(D(SB(SB(KI)))(K(SB(KI))(KI)))(SB(KI)) Bw D(SB(SB(SB(KI))))(K(SB(SB(KI)))(SB(KI)))(SB(KI)) Bw

∗

K(SB(SB(KI)))(SB(KI)) Bw SB(SB(KI))

The last term, indeed, represents 2 , as desired. Exercise 3.2.8. The above terms do not show all the one-step reductions. Write out the missing one-step reductions (taking for granted the axioms for Q and D ).

The term on the line that we flagged with ∗ may be rewritten as h3, π21 h2, 1ii and 1 , where the latter indicates that the second element of the preceding pair will be chosen. If we would not have shortened the term by performing some reductions with the head K , then the second element of the pair would be more lengthy. The term, which more fully encodes the computation of the predecessor of 3 is h3, π21 h2, π21 h1, π21 h0, 0i i i i together with 1 , which selects the second element of the whole complex pair. Exercise 3.2.9. Translate this complex ordered pair into a CL-term.

Incidentally, notice that we gave an informal rewriting of a CL-term in which we turned into ordered pairs two sorts of terms: one preceded with K , which represents π21 , and another preceded with D , which itself is ambiguous (or, perhaps, undecided) between π21 and π22 with the selection depending on the value of its third argument. As the axiom and the definition of D , that we gave above, makes clear, D does not include KI , that is, π22 . The selective effect that D can have partly stems from the concrete representation of the natural numbers combined with some permutation. The rendering of terms with different heads (such as K , D or KI ) as ordered pairs does not cause a problem. There are no angle brackets, h i , in CL, and in all those cases the first and second argument of a combinator are viewed, respectively, as the first and second element of an ordered pair. Exercise 3.2.10. Use the combinator ZB to model addition defined in example 3.1.3.

Calculate the value of the addition function with 0 for x and 4 for y . The crucial idea behind ZB is the accumulation of CL-terms that represent the calculation of a function up to n . This general idea could be implemented in other ways. A different idea is to use the expressive power of CL, namely, the definability of fixed point combinators.


74


We could think about the predecessor function as the fixed point of the equation described in words as: p(x) = (If x = 0, then 0, else π21 (p(x), p(p(x)))) . Of course, the application of π21 simplifies to p(x) . Then we are trying to find a CL-term defining the combinator Z p from its defining equation, where Z p x = I3 (Z[0] x)(KI)(Z p x) . The two combinators I3 and Z[0] are as above, in particular, I3 is the ternary identity combinator and Z[0] is the zero test. Thus the equation further simplifies to Z p x = Z[0] x(KI)(Z p x) . We can find a term for Z p , for instance, using Turing’s method of finding a fixed point combinator. The equation Z pT yx = Z[0] x(KI)(yyx) can be viewed as the axiom of an improper combinator, when = is replaced by B : Z pT yx B Z[0] x(KI)(yyx) . We already have the combinators Z[0] and KI , thus Z pT is definable. For instance, the term W(B(B(C(CZ[0] (KI))))M) can be taken for Z pT , and then Z pT Z pT is Z p . Exercise 3.2.11. Verify that Z p applied to the CL-term for 0 yields the desired result.

Unfortunately, the above combinator does not produce a CL-term standing for a number when applied to a CL-term standing for a number — except for KI . Of course, this could have been expected in a sense, because the defining equation contains Z p x on both sides of the equation. Z p (KI) reduces to KI , only because the occurrence of Z p (KI) is dropped by the K that results from Z p (KI) . One could, perhaps, think that the problem is with our rendering of the definition of the definition of p via the primitive recursive schema into CL-terms. But, of course, Z p x B I3 (Z[0] x)(KI)(SB(Z p (Z p x))) suffers from the same problem within the third argument of I3 . First, this attempted definition of Z p using the idea behind the definition of a fixed point combinator illustrates that this construction should be used carefully, because we typically want not simply a solution to an equation, but a CL-term that calculates on a class of CL-terms as a recursive function computes on natural numbers. We could have used the fixed point combinator itself to obtain a solution. There is a CL-term corresponding to [x]. Z[0] x(KI)(Z p x) , and further this equals to ([Z p ] [x]. Z[0] x(KI)(Z p x))Z p , which is Z p . Then Z p is Y([Z p ] [x]. Z[0] x(KI)(Z p x)) . Second, the equation Z p x = I3 (Z[0] x)(KI)(Z p x) that we obtained from the definition of p by the primitive recursion schema elucidates the role of p in the transcription of instances of this schema into CL-terms. It so happens, that in the schema s is explicit, however, when a CL-term is taken to be an argument of a CL-term that stands for a function the presence or absence of SB at the left of the term cannot be used by the function explicitly. In order to calculate the predecessor function, what we would really like to do is to take a look at the term, if it is KI , then we return the term itself, but if it is of the form SB(M) , then we return M . We simply want to get rid of one occurrence of SB . Because of the structure of numbers as CL-terms using the Church notation, it does not matter which occurrence of SB is deleted. The natural numbers in the Church notation are all binary functions, and it is one of the nice properties of this representation of the natural numbers in CL. Thus we can take advantage of the structure of the numbers. Counting up to a preset


Chapter 3.


75

number can always be achieved computationally by as many symbols or states as the number is. The number we have to count off is one: the predecessor of a number SB(. . . (SB(KI))...) is SB(. . . (KI)...) . If we apply a number to x and y , then we get a term the general structure of which matches the structure of the number, with x ’s in place of SB ’s and a y in place of KI . (Cf. example 3.2.5) We can easily construct a term with a zero test to ensure that we get p(0) = 0 . Thus we have to worry only about the case when the input is greater than 0 . We need to find a term for x and y with the following properties.   if w is y, KI xw Bw SB(KI) if w is KI,   SBw otherwise. Our idea is to utilize the functional character of the numbers as CL-terms. xy (which is to be a term distinct from SB(KI) ) will reduce to KI , thereby accomplishing the elimination of exactly one occurrence of SB . All the other occurrences of x (if there are any), will revert back to SB to restore the term to one that stands for a natural number. We gave a definition for Z[0] as C(B(CIK))(K(KI)) . Of course, originally, our intention was only to be able to get K if the input was KI and to get KI if the input was another number, that begins with SB . However, there are many other CL-terms beyond those that stand for numbers. If we test BBB for zero, then we obtain a term that takes two arguments, cancels those arguments, and returns KI . BBB is the term that we want to count minus one with. If M stands for a number greater than 0 , then to ensure that Z[0] M Bw SB(M) , we can take the term Z[0] MN(SB(M)) (where N is still to be determined). However, in case BBB has already triggered the change to KI , we also want to have Z[0] (KI) to yield SB(KI) , that is, N should be SB(M) or SB(KI) . To put all these bits and pieces together, we define Z0p as follows. Z0p x B Z[0] xx(x(S(CZ[0] (SB(KI)))(SB))(BBB))

The combinator Z0p is obviously definable, because it involves combinators that we already defined or we might suppose to have in the basis. The axiom Z0p does not contain occurrences of Z0p on the right-hand side at all. The first occurrence of Z[0] caters for the case when x is KI , that is, 0 . Otherwise, the term starting with the third occurrence of x is evaluated. x stands for a number, let us say n , which is a binary function. x applies its first argument n times to its second argument, which is BBB . An application of the first argument to y may be calculated in the following steps. S(CZ[0] (SB(KI)))(SB)y Bw CZ[0] (SB(KI))y(SBy) Bw Z[0] y(SB(KI))(SBy)

The meaning of the last CL-term is what we described above; the role of S and C is merely to abstract out y .


76


Exercise 3.2.12. Use the new Z0p to calculate the predecessor of KI and SB(KI) . Exercise 3.2.13. Verify that Z0p (SB(SB(SB(SB(KI))))) is SB(SB(SB(KI))) . Exercise 3.2.14. Find a combinator for Z0p . (You may assume that Z[0] is given, that

is, it already has been defined.)

The above combinator Z0p is “hand-crafted,” but elegant. An attractive feature of this combinator is that it is much more straightforward than generating and storing terms for successive calculations. In a sense, our Z0p parallels the predecessor function that we will encounter in the next section: it utilizes the specific structure of the CL-terms that represent the natural numbers. However, we have retained the Church numerals, that are in certain ways superior to the representation given in the next section. In addition, our Z0p is motivated by insights garnered from models of computation investigated in theoretical computer science. Once we have a definition for p , the idea behind the fixed point combinator can be used, in general, to find a combinator to represent primitive recursion. The schema of primitive recursion takes two functions, let us say x and y , and a number, let us say z . We assume that we have a CL-term that represents p , and we denote that by Z p — it may be either ZB (KI)K or our Z0p . Z pr applied to x , y and z yields x when z = 0 , and otherwise gives y(Z p z)(Z pr xy(Z p z)) . Using D we can turn the “if . . . , then . . . , else . . . ” statement into a term, and place that on the right-hand side of the equation, as in Z pr xyz =w Dx(y(Z p z)(Z pr xy(Z p z)))z. By combinatorial completeness, in effect, using a bracket abstraction, x , y and z may be abstracted out from the term on the right-hand side, leaving Z pr = [x, y, z]. Dx (y(Z p z)(Z pr xy(Z p z)))z . Of course, the right-hand side of the equation is just another combinator that takes three arguments and yields the CL-term that was on the righthand side of the equation above. Recall that if we have an equation x = f x , then Y f is a solution to the equation, that is, Y f is the term that we can put into the place of x . This implies that we have to transform [x, y, z]. Dx(y(Z p z)(Z pr xy(Z p z)))z into the form where some function f is applied to Z pr . This can be achieved via yet another application of bracket abstraction: ([v] [x, y, z]. Dx(y(Z p z)(vxy(Z p z)))z)Z pr . (We gave v its own brackets to emphasize the importance of this abstraction.) Then, “as if by magic,” Z pr is defined as Y[v] [x, y, z]. Dx(y(Z p z)(vxy(Z p z)))z . Exercise∗ 3.2.15. Given Dx(y(Z p z)(Z pr xy(Z p z)))z , find a CL-term for the bracket abstract [x, y, z]. Dx(y(Z p z)(Z pr xy(Z p z)))z . (Hint: Using various combinators from chapter 1 you may find a shorter term than utilizing the abstraction algorithm with S and K only.) Exercise∗ 3.2.16. Abstract out Z pr from the term [x, y, z]. Dx(y(Z p z)(Z pr xy(Z p z)))z . (Hint: You need the CL-term that is the result of the previous exercise.) Exercise 3.2.17. Calculate the value of Z pr (KI)K(KI) and Z pr (KI)K(SB(SB(KI))) . (Hint: You may assume that Z pr behaves like in the displayed weak equality above.)


Chapter 3.


77

Now we have not just one, but two combinators that can represent primitive recursion, which amply ensures — together with the representation of the basic functions and composition — the truth of the following claim. T HEOREM 3.2.7. (R EPRESENTATION OF PRIMITIVE RECURSIVE FUNCTIONS ) All primitive recursive functions are representable by CL-terms. The definability of a fixed point combinator is a remarkable aspect of CL. However, a fixed point combinator or a similar combinator that is not proper may not have an nf. This is an obvious consequence of the axiom of the fixed point combinator Y , which contains that combinator itself in a redex position within its reduct. And we have seen an example in the case of the predecessor function, where a fixed point type construction did not lead to a term that represented the function. Z pr certainly has an infinite reduction sequence. Exercise∗ 3.2.18. Explain how the combinator Z pr (with an occurrence of Z pr in its reduct) can be used to define the exponential function in CL, so that the resulting function takes CL-terms standing for natural numbers into CL-terms standing for natural numbers. (Hint: Each number is represented by a CL-term, which is in nf.)

The term ZB , and the definitions of p as ZB (KI)K or Z0p , on the other hand, do not rely on the definability of a fixed point combinator. Rather these terms produce or perform — via reductions — a series of well-founded computational steps. ZB (KI)K accumulates a series of predecessors, whereas our predecessor function Z0p exploits the specific functional character of the Church numerals together with our capability of counting up to one by selecting a CL-term that does not stand for a natural number. As a result, each of these terms have an nf. Exercise 3.2.19. Define + using ZB and Z pr . Compare the resulting CL-terms. Exercise 3.2.20. Find CL-terms for the factorial function ! using ZB and Z pr . (Hint:

Take a look at exercise 3.1.2 first.) Partial recursive functions may be generated by an application of µ (in addition to composition and primitive recursion). Let us now turn to minimization. Here again, we may choose between constructions. A simpler construction involves an application of the fixed point combinator, and the resulting CL-term does not have an nf. Alternatively, we may opt for a more complicated construction, which, however, yields a CL-term with an nf. We start with the latter. The computation of y for which the function f takes the value 0 can be viewed as finding a combinator Zi such that ( Y if XY =w KI, Zi XY Bw Zi X(SBY ) otherwise. Here Y is the CL-term for y , X is the CL-term for f and XY =w KI stands for f (y) = 0 . It is straightforward to define a combinator that satisfies the first case.


78


We could consider Z[0] (XY )Y for the “if . . . , then . . . ” part of the statement, which returns Y if XY is zero, and false (i.e., KI ) otherwise. For instance, BW(BZ[0] ) could be the CL-term standing for the first case. However, the second case repeats an application of Zi , thus we will define Zi using another combinator Zo . Recall that D is a combinator that selects the first or the second element of a pair that comprises the first two arguments of D . On the other hand, KI (i.e., 0 ) selects the second one from its two arguments. Thus, we would like to find a unary combinator Zo such that its argument ends up inside a term that is in the second argument of D . The first argument of D will be KI , and we place XY into the third argument of D . In sum, Zo x B D(KI)M , where the shape of M is still to be determined, but we already know that x occurs in M . To determine the shape of M , we should consider what happens when XY is 0 . Zo X(XY ) yields D(KI)M(XY ) which reduces to KI when XY =w KI . In order to get Y as the output, we need to have a term like Zo X(XY )NY , where the shape of N is to be determined. If XY is not 0 , then we get D(KI)M(SB . . . (KI)...)NY and then MNY . The latter term should reduce to Zo X(X(SBY ))N(SBY ) . If we take N to be Zo X , then we can determine what shape M should have. M(Zo X)Y Bw Zo X(X(SBY ))(Zo X)(SBY ) . Thus, M is [v, y]. v(X(SBy))v(SBy) . Then Zo x Bw D(KI)[v, y]. v(x(SBy))v(SBy) , hence Zo is [x]. D(KI)[v, y]. v(x(SBy))v(SBy) . Exercise 3.2.21. Find a CL-term for Zo using D and any of the well-known combina-

tors, which we introduced in chapter 1. We still have to find Zi . We have seen that Zo X(XY )(Zo X)Y Bw Y if XY =w KI , but Zo X(XY )(Zo X)Y Bw Zo X(X(SBY ))(Zo X)(SBY ) if XY =w SB(. . . (KI)...) . Then Zi is [x, y]. Zo x(xy)(Zo x)y . Exercise 3.2.22. Suppose that Zo has been defined (e.g., as in the previous exercise). Find a CL-term for Zi .

In definition 3.1.7, we did not assume that the function f is unary. Thus the last step is to separate the n + 1 st argument from the others (which should be leftassociated with the CL-term for f ). Let us assume that Z f is a combinator of arity n + 1 , and it represents the function f . Then µ f is represented by a CL-term Zµ f , such that Zµ f x1 . . . xn B Zi (Z f x1 . . . xn )(KI). Here the term Z f x1 . . . xn plays the role of the previous X . The variables x1 , . . . , xn can be abstracted out of the right-hand side term in a usual way. Exercise 3.2.23. Find a CL-term for [x1 , x2 ]. Zi (Z f x1 x2 )(KI) . Exercise∗ 3.2.24. Find CL-terms (i.e., describe the shape of suitable CL-terms) for all n , that represent [x1 , . . . , xn ]. Zi (Z f x1 . . . xn )(KI) .

Now we can take a closer look at the function µ f , that is, Zµ f when it is applied to n arguments, let us say to X1 , . . . , Xn . We assume that s(0) is the least y for which f (x1 , . . . , xn , y) = 0 — so as not to make the calculation overly lengthy. 1. Zµ f X1 . . . Xn Bw


Chapter 3.


79

2. Zi (Z f X1 . . . Xn )(KI) Bw 3. Zo (Z f X1 . . . Xn )(Z f X1 . . . Xn (KI))(Zo (Z f X1 . . . Xn ))(KI) Bw 4. D(KI)([v, y]. v(Z f X1 . . . Xn (SB(KI)))v(SB(KI)))(Z f X1 . . . Xn ) (Zo (Z f X1 . . . Xn ))(KI) Bw 5. Zo (Z f X1 . . . Xn )(Z f X1 . . . Xn (SB(KI)))(Zo (Z f X1 . . . Xn ))(SB(KI)) Bw 6. KI(Zo (Z f X1 . . . Xn ))(SB(KI)) Bw 7. SB(KI) The step from 1 to 2 is justified by the definition of Zµ f . The definition of Zi gives 3, where Z f X1 . . . XnY is not KI — due to our (ad hoc) assumption about the function f . The next term is obtained using the fact that Zo includes D . But D here selects its second argument, hence we get the CL-term on line 5. Since now Z f X1 . . . Xn (SB(KI)) =w KI (by our stipulation), D selects its first argument, which is KI . Two further one-step reductions of the CL-term on line 6 yield the CL-term on line 7, which represents the successor of 0 . We used a hypothetical function f and the corresponding CL-term Z f to create the CL-term Zµ f . Once we have [x1 , . . . , xn ]. Zi (Z f x1 . . . xn )(KI) , then we can view Zµ f as Zµ Z f with an axiom for Zµ as Zµ y B [x1 , . . . , xn ] Zi (yx1 . . . xn )(KI). Zµ is obviously not a proper combinator, however, once again it is easily seen to be a definable combinator. Exercise 3.2.25. Find a CL-term for Zµ . (Hint: Exercise 3.2.24 asked you to find a CL-term for [x1 , . . . , xn ]. Zi (Z f x1 , . . . , xn )(KI) , that is, for Zµ f .)

The definitions of Zo and Zi are independent of the arity of the function f to which µ is applied. However, Zµ f is an n -ary combinator, and so Zµ is n + 1 -ary. This shows another case when the usual notation used in recursion theory masks the multiplicity of similar operations. In other words, for each n , we have to define an n + 1 -ary minimization combinator Zµ . Another way to define minimization is to describe it as “if . . . , then . . . , else . . . ” statement, then to turn that into an equation and to solve it. We reuse the notation Z f from above for the CL-term that represents the function f to which µ is applied. ZmY X1 . . . Xn is defined as “if Z f X1 . . . XnY =w KI , then Y , else Zm (SBY )X1 . . . Xn .” The branching depends on 0 , thus we can use, for example, D again to form the CLterm: DY (Zm (SBY )X1 . . . Xn )(Z f X1 . . . XnY ) . If Z f X1 . . . XnY reduces to KI , then the term reduces to Y , as needed. Otherwise, the reduct is Zm (SBY )X1 . . . Xn , which in turn reduces to DY (Zm (SB(SBY ))X1 . . . Xn )(Z f X1 . . . Xn (SBY )).

This gives the following equation. ZmY X1 . . . Xn =w DY (Zm (SBY )X1 . . . Xn )(Z f X1 . . . XnY ) Zm is not a proper combinator, but we can find a CL-term for it without difficulty.


80


Exercise 3.2.26. Carry out the bracket abstractions to get a CL-term for the pseudoλ -abstract [y, x1 , . . . , xn ]. Dy(Zm (SBy)x1 . . . xn )(Z f x1 . . . xn y) .

Now we define Zµ f , which is the CL-term that represents µ f as Zm (KI) . Next, we want to define a CL-term for Zµ itself, which can take any n -ary functions as its argument. This requires the replacement of the occurrence of Z f in the definition of Zm with a variable, and then abstracting that variable out. Exercise 3.2.27. Find a CL-term for the combinator Zµ . (Hint: You need the term

from the previous exercise.) This completes the second definition of the minimization operation. To sum up what we have shown — in more than one way — in this section, we state the following theorem. T HEOREM 3.2.8. (R EPRESENTATION OF PARTIAL RECURSIVE FUNCTIONS ) There is a set of CL-terms that represent the natural numbers and the partial recursive functions. Truth functions. Classical sentential logic ( TV ) is very well understood nowadays. Indeed, the two-valued (or true–false) interpretation of Boole’s logic was already developed in quite a detail together with the truth tables by Charles S. Peirce. All the connectives of TV are interpreted by functions of types { F, T }n −→ { F, T } , where n is the arity of the connective. The truth values may be replaced by 0 and 1 , and then the connectives are interpreted by functions of types { 0, 1 }n −→ { 0, 1 } , where n is as before. Usually, 0 is taken to stand for falsity and 1 for truth — though it is possible to take the dual view. The CL-term KI stands both for falsity and for 0 , however, the representation of truth differs from that of 1 . T is K , whereas 1 is SB(KI) . The following are truth matrices for some often used two-valued connectives. ∼

∧

T F

∨

T F

⊃

T F

†

T F

T

F

T

T F

T

T T

T

T F

T

F F

F

T

F

F F

F

T F

F

T T

F

F T

The meaning of the connectives may be rendered in English as follows. ∼ is “it is not the case that . . . ,” ∧ is “. . . and . . . ,” ∨ is “. . . or . . . ,” ⊃ is “if . . . then . . . ,” and † is “neither . . . , nor . . . .” Sometimes other symbols are used for these connectives, and other names are given to them than what we list here: ∼ is negation, ∧ is conjunction, ∨ is disjunction, ⊃ is conditional, and † is nor. Exercise 3.2.28. Find CL-terms for the listed truth-functional connectives assuming that the functions operate with truth values. (Hint: For instance, Z∧ KK should reduce to K , but if either K is replaced by KI , then the reduct must be KI .)

Taking 0 and 1 instead of F and T , the truth functions can be viewed as numerical functions in addition to their meaning as the interpretation of connectives.


Chapter 3.

81


Then the connectives may be viewed as the following functions. ∼(x) = 1 − x , ∧(x, y) = min(x, y) , ∨(x, y) = max(x, y) , ⊃ (x, y) = max(1 − x, y) , and †(x, y) = min(1 − x, 1 − y) . Exercise 3.2.29. Find CL-terms for the functions listed. Suppose that x and y range over { 0, 1 } . (Hint: For instance, Zmax (KI)(KI) should reduce to KI . However, if either occurrence of KI is replaced by SB(KI) , then the reduct must be SB(KI) .)

3.3

Second modeling of partial recursive functions in CL

Another representation of natural numbers within CL selects a different set of CL-terms to stand for them, and then proceeds to the construction of terms for recursive functions accordingly. We saw above that in the CL representation of primitive recursive functions, in particular, in modeling the primitive recursion schema, the predecessor function becomes crucial — just as in an actual calculation of the value of a function defined by primitive recursion. The previous representation of the natural numbers is similar to the successor function’s application to a number, or as a generalization of the unary notation for natural numbers (in which 7 is | | | | | | | ). The new representation is similar to viewing natural numbers as sets of lesser numbers, and it allows a simple definition of the predecessor function. First of all, the starting point is I , that is, the unary identity combinator represents 0 . The successor function is different than before. Recall that a combinator V with axiom Vxyz B zxy was introduced in exercise 1.2.4 and V is definable from { B, C, I } , for instance. The successor function s is V(KI) . The CL-terms representing the first four natural numbers are listed below together with their weak reduct when they are applied to x . I

x

V(KI)I x(KI)I

V(KI)(V(KI)I) x(KI)(V(KI)I)

V(KI)(V(KI)(V(KI)I)) x(KI)(V(KI)(V(KI)I))

··· ···

The shape of these reducts obviously differs from the reducts we obtained in the previous representation (after applying the CL-terms representing natural numbers to x and y ). Now each reduct — save that of Ix — is of the form x followed by falsity (which is unchangeably KI ), and then followed by the predecessor of the number that was applied to x to start with. The structure of this CL-term has a certain similarity to the shape of the second clause in definition 3.2.6, which defines the predecessor function by primitive recursion. Ordered pairs can be represented in various ways by sets, and we already saw that certain CL-terms can be viewed as ordered pairs. If we think of the term [x]. xMN as the ordered pair hM, Ni , then 1 is hF, 0i . The function [x]. xMN is VMN , which helps us to decipher the other numbers. 2 is hF, hF, 0i i , 3 is hF, hF, hF, 0i i i or hF, 2i , etc. Thus each number contains its predecessor as the second element of the ordered pair.


82


If x is I , then all numbers weakly reduce to I , that is, 0 . This gives an easy definition of z , the constant zero function as CII , because CIIx Bw IxI , hence further to xI . Of course, we can disregard the shape of the CL-terms that stand for the natural numbers and we can simply take the CL-term KI to be z . KI applied to any CL-term M reduces to I — including those CL-terms that represent numbers. We take CII for z . We continue to assume that K stands for truth, just as we already assumed above that KI stands for falsity. If we apply a number to K , then we get K for 0 , and KI for all the other numbers. Then a CL-term, which has a similar structure to CII (i.e., to the constant zero function z ) can play the role of the zero predicate. CIKx Bw IxK Bw xK . That is, the combinator Z[0] is now defined by the CL-term CIK . Exercise 3.3.1. Verify by going through the one-step reductions that for 0 , 3 and 11 the zero predicate Z[0] returns the term that is expected.

The projection functions can be defined as previously — they are not dependent on the concrete representation of the numbers. This completes the representation of the basic primitive recursive functions. We may view ordered n -tuples as hx1 , hx2 , . . . , hxn−1 , xn i...i i . Given that we took V to form an ordered pair, the CL-term standing for the natural numbers shows this pattern: each positive natural number n is an ordered n + 1 -tuple. Instead of the iterative construction of n -tuples as embedded ordered pairs, we may think of n tuples as “flat” constructions, for instance, as hx1 , x2 , x3 i , hx1 , x2 , x3 , x4 i , etc. Exercise 3.3.2. Define a combinator Zh3i such that it takes 3 arguments x1 , x2 and

x3 , and returns hx1 , hx2 , x3 i i . Exercise∗ 3.3.3. Define combinators like Zh3i for each n (where n ≥ 3 ).

Once we have the notion of n -tuples derived from pairs, we might want to have selection functions that are like the projection functions to some extent, however, they return the i th element from an n -tuple. Exercise∗ 3.3.4. Let M be an n -tuple, and let 1 ≤ i ≤ n . Describe CL-terms for each

i that behave as selection functions. Returning to the observation about the reducts resulting from a number being applied to x , we may notice that if x is KI , then for every number greater that 0 , we get the predecessor of that number. That is, CI(KI) is the inverse of the successor function. This is not quite the predecessor function, because CI(KI)I Bw I(KI) , which is not one of the CL-terms that represent a number. We denote this partial predecessor function by p0 . Exercise 3.3.5. Define the total predecessor function p for this representation of natural numbers. p0 is undefined for 0 , but p(0) = 0 , that is, Z p I should reduce to I . (Hint: Notice that all numbers save 0 , contain the permutator V , which causes an asymmetry in the reducts of numbers applied to x .)


Chapter 3.


83

It is good to have the usual predecessor function p . However, in the primitive recursion schema we can get by p0 . We do not need a CL-term for p to model primitive recursion, because if the input to the function is 0 , then the value is calculated according to the first equation in which the predecessor function typically does not occur. To be more precise, the predecessor of 0 could occur in the first equation if f is given as a complex function. However, all such occurrences of p(0) can be replaced by the constant zero function z or simply by 0 , since p(0) = z(0) = 0 . Let us suppose that the primitive recursive functions g and h are represented by Zg and Zh , respectively. Then the primitive recursive schema defining the function f takes the form “if CIKx , then Zg , else Zh x(Z f (Z p x)) ,” where Z f is the term that represents the function that is being defined. If we suppose that the only variable of f is x , that is, f is unary, then we can abstract that out, which gives us the equation Z f =w [x]. CIKxZg (Zh x(Z f (Z p x))).

Next Z f can be abstracted out similarly, giving Z f =w [y] [x]. CIKxZg (Zh x(y(Z p x)))Z f .

Then using the fixed point combinator Y , Z f =w Y([y] [x]. CIKxZg (Zh x(y(Z p x)))). Exercise 3.3.6. Find CL-terms that could be used in place of the two CL-terms with bracket abstraction, [x]. CIKxZg (Zh x(Z f (Z p x))) and [y] [x]. CIKxZg (Zh x(y(Z p x)))Z f .

(Hint: You may use the bracket abstraction algorithm, possibly with η , or you may rely on heuristics and any primitive combinators introduced so far.) Exercise∗∗ 3.3.7. Find a CL-term without any use of Y that can stand for primitive

recursion given the current representation of the natural numbers. (Hint: Recall that ZB was defined based on the idea of iterated calculations.) To conclude showing that primitive recursive functions may be represented with the numbers and functions chosen as in this section, we note that function composition can be carried out as before. Composition is an operation that is independent of the concrete representation of the natural numbers, because the application of a function to its arguments remains the application operation on CL-terms. The last operation we have to show to be representable is minimization. We can take a look at minimization again in the form of an “if . . . , then . . . , else . . . ” statement. If we are to minimize on f , then we calculate f (0) and check if the result is 0 ; if it is, then we return 0 and stop. Otherwise, we calculate the value of f for the successor of the previous input as long as the value is not 0 . Let Zm be defined as the function that is characterized by the equation derived from the “if . . . , then . . . , else . . . ” statement describing minimization. Zm =w [y, x1 , . . . , xn ]. CIK(Z f x1 . . . xn y)y(Zm (V(KI)y)x1 . . . xn )


84


Then Zm is the fixed point of the function [v] [y, x1 , . . . , xn ]. CIK(Z f x1 . . . xn y)y(v(V(KI)y)x1 . . . xn ). To obtain a CL-term for the function µ f , we apply Zm to 0 (i.e., to I ): Zµ f =w Zm I . Lastly, we define the minimization combinator for n -ary functions. This means that we abstract out a variable that is put in place of Z f . In other words, Zµ =w [w]. Y[v] [y, x1 , . . . , xn ]. CIK(wx1 . . . xn y)(v(V(KI)y)x1 . . . xn ). Exercise 3.3.8. Find CL-terms for the combinators Zm and Zµ . Exercise 3.3.9. Are there any similarities or differences between the combinators that

represent minimization here and in the previous section? General number systems. We have looked, in some detail, at two representations of the natural numbers and the recursive functions on them. We have seen that some of the definitions in the two representations do not differ at all. The requirements for a set of CL-terms to serve as a modeling of partial recursive functions can be generalized. D EFINITION 3.3.1. A set of CL-terms R is a representation of the natural numbers and partial recursive functions iff (1)–(5) obtain. (1) There is a term Ms ∈ R that is called the successor function. (2) There is a set of CL-terms N , which represents the natural numbers, N ⊆ R such that the terms are pairwise not weakly equal. Further, there is an M0 ∈ N (which stands for 0 ), and for all n > 0 , there is an Mn ∈ N that is obtained from M0 by n applications of s .20 (3) There is a term Z p ∈ R with the property that for any n > 0 , Z p Mn Bw Mn−1 and Z p M0 Bw M0 . Z p stands for the predecessor function. (4) There is a term Z[0] ∈ R such that Z[0] M0 Bw K , whereas for all other elements Mn of N , Z[0] Mn Bw KI . Z[0] is the zero predicate. (5) R contains the constant zero, the projection functions, and is closed under composition, primitive recursion and minimization. There are CL-terms that represent the latter three operations. The point of the definition is to underscore that a numerical system is specific in some aspects such as the terms that represent the numbers, and some of the related functions. However, some components may be used in all representations. Of course, all the recursive functions are related to the numbers, however, the successor, the constant zero, the predecessor functions and the zero test predicate appeal 20 We

may require that each element of N is one of the Mn ’s, that is, N is the least set generated by s from M0 — in order to avoid bogus terms to be included into the representation.


Chapter 3.


85

to the concrete shape and structure of the numbers.21 On the other hand, the projection functions and function composition are invariant. Primitive recursion and minimization may be defined in a representation independent way, if Z p , Z[0] , etc., are assumed to have been defined concretely. Exercise∗∗∗ 3.3.10. Take into consideration what a representation of natural numbers and partial recursive functions requires. Find a set of CL-terms that is a representation

(and is not identical to either of the representations in this chapter). (Hint: This is an open-ended exercise; you may find a completely new representation that is elegant and useful.)

3.4

Undecidability of weak equality

We stated theorem 2.4.2 (in chapter 2) without providing a proof. Now we have accumulated results that allow us to sketch the proof of undecidability. The undecidability of first-order classical logic is based on Gödel’s incompleteness theorem. The undecidability of CL will be based on a “Gödel-type” theorem.22 We have seen that CL-terms can stand for natural numbers and functions on natural numbers. At the same time, CL-terms are finite objects, which can be regarded as (finite) strings. The arithmetization of the syntax means that CL-terms are encoded as natural numbers. The encoding does not need to be thought of as a complicated process or as encryption. Rather, the simpler is the encoding, the better is it. But simplicity may not hinder certain features of the encoding, which ensure that the numbers faithfully represent the CL-terms. The number that is assigned to a CL-term M is called the Gödel number of that expression and denoted by g(M) . We require that no two strings have the same Gödel number, that is, g must be injective. The function g itself should be computable. Furthermore, g must be “reversible” in the sense that given a natural number n , there should be an effectively computable function that allows us to reconstitute the term M if and only if n = g(M) . As a matter of fact, all strings get a number assigned to them, however, we are interested in the Gödel numbers of CL-terms, in particular, that of combinators. Strings are formed by the operation of concatenation. We rarely think about the decimal notation in terms of concatenation, because the places where the digits appear carry significance. For instance, 13 (in decimal notation) is not 1 and 3 concatenated per se; rather 13 is the superposition of 10 and 3 . That is, 13 = 1 · 101 + 3 · 100 . However, just because we usually do not think about numbers in terms of concatenation, that does not mean that we cannot think about them that way. Gödel originally placed the numbers that stand for symbols into powers of 21 z 22 In

depends on what 0 is, but KM0 is always suitable as z . section A.3, we list some related theorems for Peano arithmetic.


86


prime numbers to indicate the place of each symbol within a string. His numbers even for relatively short expressions are enormous.23 We start with assigning numbers to the individual symbols. We know that the combinators S and K constitute a combinatorially complete basis. This means that we can encode all the combinators (over this basis) using only four numbers. For instance, 1 , 2 , 3 and 4 can be taken for S , K , ( and ) , respectively. The operation of function application was denoted by juxtaposition, hence we do not need to allocate a number to that operation. We intend to consider the decidability of =w , hence we assign 5 to the weak equality symbol. This will allow us to assign a number to certain statements about pairs of CL-terms.24 Of course, CL-terms are structured strings, as it is apparent from definition 1.1.1. However, we can consider the parentheses simply to be symbols, and then CL-terms are strings. Each symbol has been given a Gödel number, therefore, the string of symbols can be represented by a string of numbers.25 L EMMA 3.4.1. The concatenation of strings of digits as natural numbers in decimal notation is a partial recursive function, that is, concatenation is computable. Proof: We give only a sketch of the proof here. Let us consider the string a1 . . . an and b1 . . . bm , where each a and b is from the set { 1, 2, 3, 4, 5 } . We consider the string in which the a ’s are followed by the b ’s: a1 . . . an b1 . . . bm . The numerical interpretation of the strings we start with are a1 · 10n−1 + . . . + an · 100 and b1 · 10m−1 + . . . + bm · 100 . The numerical interpretation of the resulting string is a1 · 10n+m−1 + . . . + an · 10m + b1 · 10m−1 + . . . + bm · 100 . The same resulting string may be thought of as the sum (or superposition) of a1 . . . an · 10m and b1 . . . bm . In either case, we need to be able to calculate m from b1 . . . bm . The problem may seem to be a trifle until we recall that we will want to compute with a combinator on the CL-terms that represent the numbers a1 . . . an and b1 . . . bm . CL-terms do not come in decimal notation, which perhaps, would allow us to compute the length of the string. But for now, we assume that there is a function ` , which is like the function in definition A.1.5, that gives the length of a string of digits. The actual definition of this function in CL has to take into account that we are apparently not given a natural number in decimal notation, when a CL-term representing a natural number is given. Exercises 3.1.1 and 3.1.2 asked you to define multiplication and factorial as primitive recursive functions. Exponentiation is primitive recursive too — see exercise 23 G¨ odel

numberings based on concatenation have been defined for various languages — including CL. See Boolos and Jeffrey [], as well as Smullyan [], the presentation that we more or less follow here, and Smullyan []. 24 Notice that we have completely omitted the variables, because we do not need them at this point. They could be included though. For example, we could define the Gödel numbering so that 6 stands for x , which is followed by as many 7 ’s as the number in the subscript of x . 25 The Roman numerals hint at what a numerical system based on concatenation rather than decimal places could look like. (E.g., 74 is LXXIV , that is, 50 + 10 + 10 + (−1 + 5) , where the minus is concatenation on the left.)


Chapter 3.


87

3.4.1 below. If so, then there is a combinator, let us say, Zexp that represents the exponentiation function. We wish to calculate a1 . . . an · 10`(b1 ...bm ) + b1 . . . bm . We already have addition and multiplication, and now, together with exponentiation and the length function the number resulting from concatenation is partial recursive. Then, again, there is a combinator Zcon , that takes two CL-terms that stand for natural numbers, such that Zcon MN reduces to P , where P is the CL-term standing for the natural number that results by concatenating in decimal notation the numbers represented by the CL-terms M and N . qed Exercise 3.4.1. Define exponentiation as a primitive recursive function. (Hint: Simi-

larly to exercises 3.1.1 and 3.1.2, you may find it easier first to define exponentiation by two equations, and then adjust their form to match precisely the primitive recursion schema.) Exercise∗ 3.4.2. Based on the solution to the previous exercise, find a CL-term that

represents the exponentiation function. (Hint: There is more that one way to represent natural numbers by CL-terms, and there is more that one way to turn an instance of the primitive recursive schema into a CL-term.) In the proof we emphasized at each step the existence of suitable combinators. For our purpose, what we need is that Zcon exists. Example 3.4.2. Let us assume that the term is (SK) . The string of numbers that stands for this term is 3124 . To obtain this number, we can apply the concatenation function to g( ( ) and g(S) . Similarly, we can take the CL-terms that stand for g(K) and g( ) ) , and apply Zcon to them. Zcon (SB(SB(KI)))(SB(SB(SB(SB(KI)))))

yields {SB}24 (KI) . We introduce the ad hoc notation { } with a superscript to abbreviate the CL-term that is a natural number, because the Gödel numbers of CLterms quickly lead to lengthy CL-terms even in the approach based on concatenation. Finally, the concatenation of the two strings of numbers (i.e., 31 and 24 ) yields 3124 represented by {SB}3124 (KI) . The example illustrates that the length of a string (in the decimal notation of the number) is not immediate from the CL-term that represents that number. A little thought should convince you that the other representation of the natural numbers (i.e., the one in section 3.3) does not produce CL-terms that more closely resemble lengthwise the decimal notation either. The length of a number in decimal notation (or in general, base- n notation) may be determined by checking if the number falls into a particular range. For instance, a number requires two digits (i.e., a string of length two) in decimal notation when it is strictly greater than 9 and strictly less than 100 . Relations may or may not be functions. The less than relation is clearly not a function on any set of natural numbers with at least two elements. However, for each


88


relation R , there is a characteristic function that returns “true” when the relation obtains between its arguments, and “false” otherwise. (This is a usual trick that turns relations into functions.) We used the “if . . . , then . . . , else . . . ” construction previously, and it also helps when we define < , “strictly less than.”  false if n = 0,     true if n 6= 0 and m = 0, m 1 , then there is a difference between the combinators in Λ and those in CL with respect to forming redexes of the appropriate kind. For example, W is a combinator of arity 2 and the corresponding Λ -term is λxy. xyy . The term WM is not a redex in CL, but (λxy. xyy)M is a β redex in Λ . Given a bracket abstraction in CL, it is possible to define a notion of reduction that would allow us to consider WM to be a redex. The issue is how to specify the result of a reduction step if WM is a redex. In the case of W , we could perhaps simply consider the term WM itself to be the result, because W is a regular combinator.9 Essentially, the same problem arises if we consider the term SMN . 8 Originally, Sch¨ onfinkel introduced letters that were intended to be mnemonic.

For instance, I was chosen for identity. However, the assignment of particular letters to certain combinators is nothing more than good notational convention. 9 We introduced regular combinators in section 1.2, though we have not placed special emphasis on them.


108


(λxyz. xz(yz))MN reduces to λz. Mz(Nz) , which is the Λ -term that we would need to emulate in CL. If we use the bracket abstraction with η , then the result is just SMN . The equivalence between unary and n -ary functions is a deep insight. Nevertheless, it seems to be worthwhile to emphasize that Λ with β -reduction reflects the view that functions are unary, whereas CL with weak reduction reflects the view that functions have a fixed arity, and some of them are not unary. Lastly, we may note that the Λ -terms listed above lack “special status” in yet another sense: we could have chosen any α -equal Λ -term instead. Example 4.2.4. The above procedure does not work if the combinator is improper. Let us consider CII . This is a unary combinator and its axiom is CIIx B xI . The replacements would give λx. xI , however, I is not in the language of Λ . Of course, I itself is a proper combinator, and we could attempt to replace I with λy. y to obtain λx. x λy. y . We could arrive at the same result if we would have considered first CII as C with two arguments filled in — both with I . Above we gave the λ equivalent of C as λxyz. xzy and of I as λx. x . We can form the λ -term (λxyz. xzy)(λx. x)(λx. x) , which β -reduces, in two steps, to λz. (λx. x)z λx. x . Perhaps, the term would be more “transparent” if the two I ’s would have been λ -terms with disjoint sets of bound variables, for instance, λx. x and then λy. y . But λz. (λx. x)z λy. y is, of course, α -equal to the previous term. The latter Λ -term further β -reduces to λz. z λy. y , because the subterm (λx. x)z is a β -redex. In sum, we obtained the term λz. z λy. y as before — modulo α -equality. The method we have just illustrated does not work for the fixed point combinator Y , because its axiom is Yx B x(Yx) . However, we have shown that Y may be defined from proper combinators. Y is certainly definable from { S, K } , but it is also defin-

able from combinatory bases that are not functionally complete, for example, from { B, I, W, C } . Thus given a definition of Y , the translation of the proper combinators composed appropriately is a closed Λ -term, which can be taken to be a fixed point combinator in Λ . Finding definitions for combinators in CL that behave like Y can proceed more directly — along the lines of ideas that we associated with Curry’s and Turing’s names. The steps in those constructions can be replicated in Λ . Let us start with Turing’s idea. We want to find a Λ -term M such that Mx Bβ x(Mx) . First, we replace M by NN , which gives us NNx Bβ x(NNx) , and then we replace all but the first occurrence of N by y in the terms on the left and on the right of Bβ . That is, we have Nyx Bβ x(yyx) ; accordingly, we are looking for a closed Λ -term that β -reduces to x(yyx) when applied to y and then to x . N is just like a proper combinator, which we can emulate in Λ , by lemma 4.2.3. Indeed, we can take the closed Λ -term λyx. x(yyx) or λxy. y(xxy) . Of course, we should not forget that N is not the Λ -term we wanted to find. M is NN , hence, M is (λyx. x(yyx))(λyx. x(yyx)) . This term is not in β normal form. A one-step β -reduction gives λx. x((λyx. x(yyx))(λyx. x(yyx))x) . The initial λx has a “wide scope,” that is, the rest of the term is in its scope, hence, the whole term is not


Chapter 4.

Connections to λ -calculi

109

a β -redex. However, the B1β step created a new β -redex, which is exactly of the form NN , the term we started with. It is obvious then that (λyx. x(yyx))(λyx. x(yyx)) does not have a β normal form — unlike Y or, for instance, the CL-term BW(BB0 M) , which have weak normal forms. We have to verify that the Λ -term behaves as we claimed it does. For the sake of transparency, let us consider the α -equal term λx. x((λyz. z(yyz))(λyz. z(yyz))x). We call this Λ -term Turing’s fixed point combinator in Λ , and we denote this term (or any of its alphabetic variants) by YT . If YT is applied to a Λ -term, for instance to P , then a one-step β -reduction yields P(λyz. z(yyz)(λyz. z(yyz))P) . The latter is, certainly, P(YT P) , as we intended to show. To implement Curry’s idea, we start with Mx =β x(Mx) . We replace M — in all occurrences — with y : yx =β x(yx) . Of course, the β -equality is false after the replacement. However, Nyx =β x(yx) holds for some N . Again, N is like a proper combinator, hence by lemma 4.2.3, we can easily find a suitable Λ -term. λyx. x(yx) applied to y and x β -reduces to x(yx) . Returning to Nyx =β x(yx) , we cannot substitute either N or NN for y to arrive at a β -equality that has the form Mx =β x(Mx) . We need another Λ -term P , such that Pxy Bβ x(yy) . P can be taken to be λxy. x(yy) . Now we combine N and P with x into N(PN(PN))x . The β -equality for N gives x(PN(PN)x) , and the β -equality for P — with N in place of x and PN in place of y — gives x(N(PN(PN))x) . In two steps we got from N(PN(PN))x to x(N(PN(PN))x) , which shows that the complex term N(PN(PN)) is like a fixed point combinator. So far we were using N and P in Λ as if they were combinators in CL. Let us make the construction more precise by using the actual Λ -terms. We use α -equal terms in some places for clarity. (λxy. y(xy))((λxy. x(yy))(λxy. y(xy))((λxy. x(yy))(λxy. y(xy)))) B1β λy. y(((λxy. x(yy))(λxy. y(xy))((λxy. x(yy))(λxy. y(xy))))y) B21β λy. y(((λx. (λzv. v(zv))(xx))(λx. (λzv. v(zv))(xx)))y) B21β λy. y(((λxv. v(xxv))(λxv. v(xxv)))y) B1β λy. y((λv. v((λxz. z(xxz))(λxz. z(xxz))v))y) B1β λy. y(y((λxv. v(xxv))(λxv. v(xxv))y)) The above steps show how one-step β -reductions “simplify” the term. (Two lines show the result of two one-step β -reductions on a pair of alike β -redexes.) It is easy to see that the structure of the second term is λy. y(Qy) , which is like the right-hand side term in the axiom of the fixed point combinator Y . However, the first term is not λy. Qy , and so to make it clear that Q really behaves like a fixed point combinator in further reductions, we performed further one-step β -reductions. We chose the names for the variables in the fourth and sixth Λ -terms so that it is obvious that the


110


slightly simplified Q , let us say, Q0 takes y as its argument and produces y(Q0 y) . On the last line, we have a term of the form λy. y(y(Q0 y)) . Exercise 4.2.2. Scrutinize the steps from (λxy. x(yy))(λxy. y(xy)) to (λxv. v(xxv))

and from ((λxv. v(xxv))(λxv. v(xxv))) to (λv. v((λxz. z(xxz))(λxz. z(xxz))v)) . (Hint: Carefully write out the renaming of the variables and the one-step reductions.) Of course, the Λ -term that we denoted as Q0 above does not have a β normal form. The Λ -terms allow β -reduction steps where the corresponding CL-terms are in weak normal form, which may be thought to be an advantage of Λ . If we take a look at the last term in the displayed sequence of Λ -terms, then we can see that a fixed point combinator could be constructed from two combinators slightly differently than we did. One of the combinators would be N , however, the other, let us say O , would have to have an axiom Oxy B y(xxy) , or as a Λ -term, λxy. y(xxy) . The last displayed term then is of the form N(OO) . N(OO)x B x(OOx) , and (OOx) further reduces to x(OOx) . Of course, this O is just the N from the definition of a fixed point combinator along Turing’s ideas. Thus using Λ -terms we even discovered a similarity between the two approaches. Y in CL is in nf, and someone also might find it more easy to follow the definition of the fixed point combinator using combinators, rather than Λ -terms. The latter quickly become lengthy and perhaps, somewhat difficult to parse.10 Incidentally, the fixed point combinators in Λ also demonstrate that the renaming of the bound variables is a necessity rather than a convenience. Even if — cautiously — we start with (λxy. y(xxy))(λzv. v(zzv)) instead of (λzv. v(zzv))(λzv. v(zzv)) , after just a single one-step β -reduction, we end up having a subterm of the latter form, which then forces some renaming of bound variables.

4.3

Back and forth between CL and Λ

We drew some, more or less informal, parallels between CL and Λ already. Now we would like to establish a precise relationship between CL-terms and λ -terms. Then we can also compare the relations on the sets of terms in a rigorous fashion. We need a translation from CL-terms into Λ -terms, and a translation taking us into the opposite direction from Λ -terms to CL-terms. The first one is the easier; in fact, we have already described such a translation for proper combinators. In order to extend that translation to CL-terms, which might contain some improper combinators too, we start with delineating a subclass of improper combinators. D EFINITION 4.3.1. (FAIR COMBINATORS ) Let Z be a combinator such that its axiom is one of the following two forms. Then Z is called a fair combinator. 10 This piffling grumbling shows that I like combinatory logic more than the

about combinatory logic, not about the λ -calculi!


λ -calculi. Well, this is a book

Chapter 4.


111

(1) Zx1 . . . xn B M , where M contains some of the variables x1 , . . . , xn , but no other variables or constants; (2) Zx1 . . . xn B M , where M contains some of the variables x1 , . . . , xn and proper combinators. Clause (1) specifies proper combinators, which were introduced in section 1.2 already. The second clause would suffice by itself if the occurrence of proper combinators in M would be made optional. However, proper combinators are undoubtedly an extremely useful class of combinators, which are sufficient themselves when combinatorially complete bases are considered. Improper combinators, in general, are unruly, which is why we do not want to consider all of them. Incidentally, from the point of view of a translation, a combinator Zmad with axiom Zmad x1 , . . . , xn B y is unproblematic, though it would not result in a combinator in Λ . Zmad is just an absolutely useless combinator. On the other hand, Y , which is a useful improper combinator does not fit into the translation that we give below. We have seen that Y may be defined from proper combinators, thus we exclude Y as a primitive combinator. We gave a translation of proper combinators in the previous section. Now we add improper but fair combinators, as well as variables. D EFINITION 4.3.2. (F ROM CL TO Λ ) Let B be a combinatory basis that contains only fair combinators, and let M be a term from the set of terms generated by B and a denumerable set of variables. The translation of M into Λ , which is denoted by Mλ , is defined by (1)–(4). (1) If M is a variable x , then Mλ is x ; (2) if M is a proper combinator with axiom Mx1 . . . xn B N, then Mλ is λx1 . . . xn . Nλ ; (3) if M is a fair combinator with axiom Mx1 . . . xn B N , then Mλ is λx1 . . . xn . Nλ ; (4) if M is (NP) , then Mλ is (Nλ Pλ ) . Notice that this we listed above.

λ

translation gives the same Λ -terms for proper combinators that

Example 4.3.3. The combinator S0 has as its axiom S0 xyz B yz(xz) . By clause (2), S0λ is λxyz. (yz(xz))λ . Clause (4) allows us to distribute the λ onto the atomic subterms starting with (yz(xz))λ , then (yz)λ (xz)λ , etc., to yλ zλ (xλ zλ ) . According to clause (1), each variable is its own translation; more accurately, we use alike symbols for variables in both languages. Then it is immediate that we can simply drop λ from the very first term we got, that is, S0λ is λxyz. (yz(xz)) . Of course, S0 or any other proper combinator may occur in a CL-term as a proper subterm. λ provides a translation for all such CL-terms. A fair but not proper combinator has a reduct that is composed of variables and proper combinators, that is, looks exactly like these CL-terms.


112


Example 4.3.4. Let us consider the CL-term y(S(KS)Kx)xy . The following series of terms shows the steps that yield the translation of this CL-term. We use Ã to indicate two parallel moves (after the initial step). (y(S(KS)Kx)xy)λ Ã (y(S(KS)Kx)x)λ yλ (y(S(KS)Kx))λ xλ y Ã yλ (S(KS)Kx)λ xy y((S(KS)K)λ xλ )xy Ã y((S(KS))λ Kλ x)xy y(Sλ (KS)λ (λxy.x)x)xy Ã y((λxyz. xz(yz))(Kλ Sλ )(λxy. x)x)xy Ã y((λxyz. xz(yz))((λxy. x)(λxyz. xz(yz)))(λxy. x)x)xy

Ã Ã Ã

Now let us assume that some Z has as its axiom Zxyz B y(S(KS)Kx)xy . Then by clause (3) from definition 4.3.2, Zλ is λxyz. (y(S(KS)Kx)xy)λ . Given the above steps, Zλ is λxyz. y((λxyz. xz(yz))((λxy. x)(λxyz. xz(yz)))(λxy. x)x)xy . As a more “realistic” example, we may consider the combinator that has been denoted by 1 .11 The axiom for 1 is 1 xy B y(B0 Ix) . 1 is not a proper combinator, however, it is fair. The translation of 1 goes as follows. λxy. (y(B0 Ix))λ , and then by four applications of clause (4), we get λxy. yλ (B0λ Iλ xλ ) . We know — based on the axioms of B0 and I — that the translations of these proper combinators are λxyz. y(xz) and λx. x , respectively. We can piece together the Λ -term that is 1λ as λxy. y((λxyz. y(xz))(λx. x)x) . The latter Λ -term contains a β -redex, and in two steps reduces to λxy. y(λz. x((λx. x)z)) . Lastly, we get λxy. y(λz. xz) . The structure of this Λ -term still somewhat resembles the CL-term y(B0 Ix) , but not very closely. L EMMA 4.3.5. For any CL-term M over a combinatory basis comprising proper and fair combinators together with denumerably many variables, λ is defined and λ is a function. That is, λ is a total function. Exercise 4.3.1. Prove the lemma. (Hint: Use structural induction on CL-terms.)

We clearly do not have that, if a CL-term is in wnf, then its translation into Λ is in β nf. However, it might be expected, for instance, from the constructions of fixed point combinators in Λ in the previous section, that if a CL-term is not in weak nf, then its translation into Λ is not in β nf either. L EMMA 4.3.6. If M is not in weak nf, then Mλ is not in β nf. Proof: Let us assume that M is not in weak normal form. Then there is an occurrence of a redex in M . Let us denote the subterm, which is the redex in M by N . (If there are several redexes, we randomly pick one of them.) Let us assume that Zn is the head of the redex, and N1 , . . . , Nn are its arguments. If the axiom for this combinator is Zx1 . . . xn B P , then its translation is λx1 . . . xn . Pλ , either by (2) or by (3) from definition 4.3.2. The Ni ’s themselves are translated into some Λ -terms; hence, (ZN1 . . . Nn )λ is (λx1 . . . xn . Pλ )N1λ . . . Nnλ , which a β -redex whenever n ≥ 1 . qed 11 See

[]. The type of this combinator is the wff called restricted assertion — cf. section A.9.


Chapter 4.


113

The translation from CL into Λ is quite straightforward. We can go a bit further if we wish. Given a combinator Zn with axiom Zx1 . . . xn B M , where M ∈ ({ xi : i ∈ N } ∪ { Z })⊕ , we can find a Λ -term for Z . The ideas that we attributed to Turing and to Curry, respectively, in obtaining a suitable Λ -term for a fixed point combinator are not specific to fixed point combinators. These procedures use only that the combinator comes with a reduct in which the combinator itself occurs together with some of the variables to which the combinator is applied. Allowing some proper combinators in the reduct would be acceptable too. D EFINITION 4.3.7. If Zx1 . . . xn B M , where M ∈ ({ xi : i ∈ N } ∪ { Z })⊕ , then Z is a repeating combinator. Clearly, all the fixed point combinators are repeating. None of the repeating combinators are fair, let alone are they proper. Example 4.3.8. Let us assume that Z2 is a repeating combinator with axiom Zxy B yxZ(yx) . First, we would like to find a combinator Q such that Qxyz B zy(xx)(zy) . For example, BC(BB(BW(W(BT)))) is a CL-term that can be taken for Q . Then Z is QQ . Exercise 4.3.2. Translate the Z from the preceding example into Λ . Simplify the term by performing some β -reductions. Exercise 4.3.3. Describe a procedure based on Turing’s approach that generates a Λ -term for an arbitrary repeating combinator. Exercise∗ 4.3.4. Use Curry’s approach to find a definition (by proper combinators) for Z from the last example. Then translate the CL-term into Λ . Exercise∗ 4.3.5. Describe a general procedure along the lines of Curry’s ideas that is

applicable to any repeating combinators. We know by theorem 2.3.7 that all repeating combinators are definable from a combinatorially complete base, for instance, from { S, K } . We also know, however, that each definable combinator has ℵ0 many definitions. We have seen a tiny slice of this multiplicity in the case of the fixed point combinator in chapter 2. But, the abundance of suitable CL-terms is not an obstacle; we can simply choose a CL-term that we like. Since we can suppose that only S and K occur in the selected CL-term, we can define the term according to definition 4.3.2 — without using clause (3). We can declare (if we wish) the Λ -term that we obtained in this way to be the translation of our repeating combinator. D EFINITION 4.3.9. Let B be a combinatory basis that comprises proper, fair and repeating combinators. Further, for each repeating combinator Z , let Zλ be the Λ term that is the translation of Z . Then for any term M over B together with a denumerable set of variables, the translation of M into Λ is Mλ , which is obtained by (1)–(4) from definition 4.3.2 with (5) added.


114


(5) if M is a repeating combinator, then Mλ is the Λ -term, which has been chosen as its translation. We could consider combinators that combine features of fair and repeating combinators. Repeating combinators include the fixed point combinators, but we have not introduced so far a combinator that would be both repeating and fair. Exercise 4.3.6. Try to find combinators that are well-motivated and combine features

of fair and repeating combinators. Exercise 4.3.7. Amend the definition of the translation from CL into Λ to accommo-

date the combinators from the previous exercise. Now we turn to translations from Λ into CL. Of course, some closed Λ -terms may be just what we would get from a translation of a combinator in CL. But there is a certain asymmetry between CL and Λ here: in CL we have a set of constants with axioms, whereas in Λ we simply have an infinite set of Λ -terms, among them infinitely many closed terms. This discrepancy is retained even if we were to restrict the set of allowable Λ -terms, for instance, to the λI -terms. It is useful to think about the Λ -terms as all-purpose notation for functions. Then, we want to translate these functions into CL just like we found a combinator for an arbitrary (or at least, almost arbitrary) function. The translation from the set of Λ terms into the set of CL-terms is a bracket abstraction.12 The translation λ had the property that Mλ was uniquely determined by M . The atomic terms were dealt with in (1)–(3) and (5) from definition 4.3.2 and 4.3.9. Neither of these clauses can be applied in place of another. And (4) was applicable only to complex terms. It is customary and convenient to take a slightly different view of the defining clauses in the case of bracket abstractions. We assume that the listing of the clauses constitutes a linear ordering of the clauses, and it is always the first applicable clause that is applied. This idea is not unusual; a set of instructions or commands is often taken to be ordered. For instance, many programming languages exploit the sequentiality of the executions of the commands line by line. An abstract model of computation that incorporates the ordering of commands is Markov algorithms.13 We always assume that the ordering is from top to bottom. We have suggested in various exercises the use of further combinators beyond S and K , and we hinted at the possibility of getting shorter CL-terms. Thus, it should be unsurprising that there have been several algorithms proposed with various undefined combinators. To distinguish the bracket abstractions below, we will place a superscript on the bracket. On the other hand, to show some of the commonalities of the algorithms, we give the same label to clauses that are identical, possibly, except the superscript on [ ] . We stressed in chapter 1 that [x]. M is a meta-notation for a CL-term. We specify what the actual CL-term looks like by giving an equation. 12 We 13 See

outlined one particular bracket abstraction in the proof of lemma 1.3.9. Curry’s presentation of these algorithms in [].


Chapter 4.


115

However, the equation is not =w or any of the other relations we have defined on CL-terms; = simply means that [x]. M denotes a particular CL-term or meta-term given certain side conditions. Some of the side conditions will be given concisely by the shape of M , for instance, as NP . The first bracket abstraction algorithm is due to Schönfinkel — though the concept of an algorithm or the term “bracket abstraction” did not exist at the time. (K) [x]1 . M = KM (I) [x]1 . x = I

if x ∈ / fv(M) ;

( x is a variable);

( η ) [x]1 . Mx = M

if x ∈ / fv(M) ;

(B) [x]1 . NP = BN([x]1 . P)

if x ∈ / fv(N) ;

(C) [x]1 . NP = C([x]1 . N)P

if x ∈ / fv(P) ;

(S) [x]1 . NP = S([x]1 . N)([x]1 . P) . If B is a combinatorially complete basis, then all the combinators mentioned in the above clauses are definable. However, we will assume that for each algorithm, we have a combinatory basis that contains at least the combinators that figure into the clauses. For instance, for the above algorithm, we assume that the basis is B ⊇ { S, K, I, B, C } . Having all the combinators that are used in the clauses as primitives gives a different perspective on the combination of λ and [ ] translations than what we would get with B = { S, K } . The difference between Schönfinkel’s bracket abstraction algorithm and the one we gave in chapter 1 is that it includes (B) and (C), and the abstraction of a(n identical) variable is with I (not SKK ). The rationale behind including (B) and (C) is that, if a term is complex and we know whether the abstracted variable does or does not occur in each immediate subterm, then we can obtain a shorter CL-term by using B or C (instead of using S , and then K too). This allows us to limit further abstraction steps to the subterm that actually has an occurrence of the variable, which is abstracted out. The next algorithm is almost — but not quite — the same that we gave in chapter 1. (K) [x]2 . M = KM

if x ∈ / fv(M) ;

(I) [x]2 . x = I ; (S) [x]2 . NP = S([x]2 . N)([x]2 . P) . For the sake of comparison, we give as the third and fourth algorithms the ones from chapter 1. (K) [x]3 . M = KM (I) [x]3 . x = SKK

if x ∈ / fv(M) ; ( x is a variable);


116


(S) [x]3 . NP = S([x]3 . N)([x]3 . P) . We now buildin the “shortcut,” that is, η -reduction. (K) [x]4 . M = KM

if x ∈ / fv(M) ;

(I) [x]4 . x = SKK ; ( η ) [x]4 . Mx = M

if x ∈ / fv(M) ;

(S) [x]4 . NP = S([x]4 . N)([x]4 . P) . The next algorithm differs from the second one only in the ordering of the clauses. (S) [x]5 . NP = S([x]5 . N)([x]5 . P) ; (K) [x]5 . M = KM

if x ∈ / fv(M) ;

(I) [x]5 . x = I . Notice that (S) has no side conditions except that the term NP is complex. Thus it follows that (K) is applicable in the last algorithm only if M is not complex, that is, M is either one of S , K and I , or it is a variable distinct from x . Although the fifth algorithm may seem unmotivated or even ill-conceived, we can give a straightforward justification why such an algorithm is reasonable. Let us consider how we could implement this algorithm or what information we need at each stage to determine which clause to apply. (S) is applicable as long as the term M is complex; we only need the information that the length of M is greater than 1 . Independently of the concrete shape of the atomic terms, this information is usually easy to extract from a term. Once (S) is not applicable, M is atomic; we only need to check whether the variable that is being abstracted is identical to M . Again, this question is computationally easy to decide. Exercise 4.3.8. Consider [ ]2 and [ ]5 . Find CL-terms such that [x]2 . M yields a longer CL-term than [x]5 . M does, and vice versa. Are there terms for which the algorithms yield CL-terms of the same length? Exercise 4.3.9. Find general characterizations of classes of terms, for which [ ]2 and [ ]5 result in CL-terms with relationships mentioned in the previous exercise.

We could create two more algorithms from [ ]1 by omitting either (B) or (C), but not both. Another variation on [ ]1 is the omission of ( η ), which is absent from the second, the third and the fifth algorithms. The inclusion of ( η ) into [ ]3 gives [ ]4 ; the inclusion of ( η ) into [ ]5 , however, would go against the ease of its computation that we laid out as a motivation. The inclusion of ( η ) into [ ]2 though would yield an algorithm comparable to [ ]4 . Exercise 4.3.10. Make some of the modifications outlined in the previous paragraph,

and determine how the changes affect the algorithm.


Chapter 4.


117

Exercise∗ 4.3.11. For each algorithm, take the corresponding (minimal) combinatory

basis, and translate each combinator in the basis into Λ . Replace the λ ’s by brackets, and find the CL-term that that particular algorithm gives. Exercise 4.3.12. Consider the Λ -term λxyz. yz(xz) . What is the CL-term that corresponds to [x] [y] [z]. yz(xz) according to each of the five bracket abstractions above? Exercise 4.3.13. Consider the meta-term [x1 x2 x3 ]1 . x1 x3 ([y]1 . x2 y) . Which combina-

tor does this meta-term denote? Exercise 4.3.14. Consider the meta-term vy [x y z v]1 . xy(xvz) . Which CL-term is de-

noted by this meta-term? Some of the algorithms appealed to properties of subterms. Obviously, we could have more combinators and more refined information about the subterms — accompanied with the expectation that the resulting CL-terms would become shorter. We first introduce two new combinators as primitives. C∗ xyzv B x(yv)z

S∗ xyzv B x(yv)(zv)

These combinators have been considered not only with the aim of defining an abstraction algorithm. The notation is intended to suggest that C∗ ( S∗ ) has a certain similarity to C ( S ). They have the same effect once the first argument is removed. C∗ and S∗ are both definable from C and S , respectively, with B that provides the “distance” effect. B(BC)B can be taken for C∗ , and B(BS)B can be taken for S∗ . The last algorithm uses the two new combinators together with D from among the associators mentioned in section 1.2. (K) [x]6 . M = KM (I) [x]6 . x = I

if x ∈ / fv(M) ;

( x is a variable);

( η ) [x]6 . Mx = M

if x ∈ / fv(M) ;

(W) [x]6 . Mx = W([x]6 . M) ; (D) [x]6 . NPQ = DNP([x]6 . Q)

if x ∈ / fv(NP) ;

(C ∗ ) [x]6 . NPQ = C∗ N([x]6 . P)Q

if x ∈ / fv(NQ) ;

(S ∗ ) [x]6 . NPQ = S∗ N([x]6 . P)([x]6 . Q)

if x ∈ / fv(N) ;

(B) [x]6 . NP = BN([x]6 . P)

if x ∈ / fv(N) ;

(C) [x]6 . NP = C([x]6 . N)P

if x ∈ / fv(P) ;

(S) [x]6 . NP = S([x]6 . N)([x]6 . P) .


118


The algorithm is essentially Schönfinkel’s algorithm with four new clauses inserted in the middle. (W) pairs with ( η ): if the latter is not applicable because x ∈ fv(M) , then (W) can be applied. The next three clauses yield shorter CL-terms, when the structure of M is at least three terms associated to the left. In each clause, x is not free in N , P or Q . Exercise 4.3.15. Consider the λ translation of the combinators W , D , C∗ and S∗ . Replace the λ ’s by [ ] ’s and determine what CL-terms result according to the latest

algorithm. Exercise 4.3.16. Find the CL-terms that correspond to [x y z]. yz([v]. x) — according

to the fifth and the sixth algorithms. We have not mentioned all the algorithms that have been introduced, let alone did we present all the possible algorithms. However, we have accumulated a sufficiently diverse collection of algorithms to turn to the definition of translations from Λ into CL. D EFINITION 4.3.10. (F ROM Λ TO CL) The translation of a Λ -term M into CL, which is denoted by Mc , is defined by (1)–(3), when a bracket abstraction algorithm has been selected. (1) If M is a variable x , then Mc is x ; (2) if M is λx. N , then Mc is [x]. Nc ; (3) if M is (NP) , then Mc is (Nc Pc ) . This definition is quite simple. But the situation is unbalanced: we have one translation from CL into Λ , but at least six translations from Λ into CL. It is trivial to state that the six algorithms do not always yield the same CL-terms, that is, for each pair of algorithms there is a Λ -term such that two (i.e., distinct) CL-terms result by the application of the algorithms. We have also seen already in chapter 1 that [x] [y] [z]. xz(yz) need not be S . We might wonder whether either of the algorithms would give use back the CL-terms that we start with, that is, if (Mλ )c is M . (We will add the superscript of the bracket abstraction algorithm to a term for clarity, whenever we add the subscript c .) We assume from now on that B is as small as possible for a particular algorithm. L EMMA 4.3.11. For all CL-terms M , M is identical to (Mλ )1c , (Mλ )4c and (Mλ )6c . Proof: We have just stated that the algorithms give different results, which may seem to contradict to the claim. But recall that we assumed that the algorithms determine the minimal necessary combinatory basis, and thereby, also the set of CLterms. (That is, if we consider [ ]1 , then M cannot contain W , and for [ ]4 , M cannot even contain C or B .) The core of the proof is the verification that, for each combinator Z in the corresponding combinatory basis, (Zλ )c is Z . Exercise 4.3.11 covers [ ]1 and [ ]4 . For [ ]6 , see the next exercise. qed


Chapter 4.


119

Exercise 4.3.17. Consider the combinatory basis for [ ]6 . Verify that the five com-

binators that appeared in some of the other algorithms are their own back-and-forth translations via λ , and then 6c . (That is, show that (Kλ )6c = K , (Iλ )6c = I , (Bλ )6c = B , (Cλ )6c = C and (Sλ )6c = S .) Then finish the proof of the preceding lemma. Exercise 4.3.18. Exercise 4.3.10 asked you to look at some modifications in the algo-

rithms. Specifically, consider [ ]1 with (B) or with (C) omitted. Is the lemma above true for the resulting algorithms? (Hint: Either amend the proof of lemma 4.3.11 or find a counterexample.) We might consider the other direction too, that is, we can start with a Λ -term. In this case we are interested in the preservation of weaker relations than identity of terms. The following lemma states that bracket abstractions emulate λ -abstraction up to one-step β - or one-step βη -reductions. L EMMA 4.3.12. Let N be a variable that does not occur in M . If [ ]n includes ( η ), then ([x]n . Mcn )λ N is βη -equal to [x/N](Mcn )λ . If [ ]n does not include ( η ), then ([x]n . Mcn )λ N is β -equal to [x/N](Mcn )λ . Exercise 4.3.19. Prove the first claim in the lemma for [ ]1 . Exercise 4.3.20. Prove the second claim in the lemma for [ ]5 .

L EMMA 4.3.13. For all Λ -terms M , M =βη (Mc1 )λ , M =βη (Mc4 )λ and M =βη (Mc6 )λ . For all Λ -terms M , M =β (Mc2 )λ and M =β (Mc5 )λ . Proof: The lemma contains two claims and each claim refers to multiple algorithms. (In total, there are five “subclaims” in the lemma.) We divide the proof into several steps, the first two of which is common to each subclaim that we indicate by using n instead of a concrete number in the superscript. 1. Let us assume that M is atomic, that is, M is a variable. M is identical to Mcn , as well as to (Mcn )λ . 2. If M is of the form of (NP) , then (Mcn )λ is (Ncn Pcn )λ , and further ((Ncn )λ (Pcn )λ ) . By hypothesis, P =β(η) (Pcn )λ and N =β(η) (Ncn )λ , but then also (Mcn )λ =β(η) M . 3. Let us now assume that M is λx. N . According to definition 4.3.10, Mcn is [x]n . Ncn . Depending on the particular n (i.e., on the bracket abstraction algorithm) and on the side conditions on N , [x]n . Ncn may yield different CL-terms. We take the fifth subclaim as an example. There are three subcases: N is compound, N is x or N is some other atomic term. If N is (PQ) , then [x]5 . PQ is S([x]5 . Pc5 )([x]5 . Q5c ) . The λ translation of Mc5 is (S([x]5 . Pc5 )([x]5 . Q5c ))λ , that is, Sλ ([x]5 . Pc5 )λ ([x]5 . Q5c )λ . Sλ is λxyz. xz(yz) , thus we get λz. ([x]5 . Pc5 )λ z(([x]5 . Q5c )λ z) . We have λz. ([x/z](Pc5 )λ )([x/z](Q5c )λ ) , by lemma 4.3.12. P and Q are shorter terms than M ; hence, we have λz. ([x/z]P)[x/z]Q which α -equals to λx. PQ . If N is x , then Mc5 is I . The λ translation of the latter is λx.x , which is M .


120


If N is an atom distinct from x , then Mc5 is KNc5 . Then (Mc5 )λ is (KNc5 )λ , hence, Kλ (Nc5 )λ . By hypothesis, (Nc5 )λ is βη -equal to N . Kλ is λxy.x . Then we get (λxy. x)N , and further, λy.N . qed Exercise∗ 4.3.21. Prove the other four subclaims from the lemma.


Chapter 5 (In)equational combinatory logic

We have so far described relations on CL-terms by, first, specifying operations on terms, and then by applying a closure to that operation. For example, we started with B1 , which is defined as the replacement of a redex by its reduct in a term, and then we defined Bw as the reflexive transitive closure of the B1 relation. Such an approach is quite satisfactory, moreover, it turned out to be useful in proving various theorems, in defining combinators for special purposes or in comparing CL-terms to Λ -terms. Another approach, which is often used in logic and mathematics (and has certain advantages) is to select some “self-evident” principles and to add rules that allow one to derive further statements. This is called the axiomatic approach, and in this chapter we consider its applicability to CL. The relations of weak reducibility and weak equality are binary relations on CLterms. Bw is transitive and reflexive, whereas =w is additionally symmetric. The properties of these relations suggest right away that these relations on terms, perhaps, can be formally captured by extensions of inequational and equational logics.1

5.1

Inequational calculi

Weak reduction is a preorder on the set of CL-terms. Our inequational logic comprises axioms and rules that characterize the main predicate in the logic as a preorder. We denote this predicate by ≥ . This symbol is often used for weak total orders, or for a relation that is at least a weak partial order. Our use of this symbol does not imply that the relation is a partial order, let alone that it is a total order. The choice is simply motivated by the similarity of the shapes of B and ≥ . In order to be able to extend this logic with CL-terms, we have to determine whether the components that are specific to CL are compatible with inequational logic. In particular, we have an operation — function application — that we visually suppressed by not using a symbol for it. The definition of weak reduction implies

1 For

detailed discussions of equational and inequational logics, see, for example, Dunn and Hardegree

[]. A brief summary of equational and inequational calculi in general may be found in section A.5.


122


that function application is a monotone operation with respect to the preorder that is Bw . Example 5.1.1. Let us take the axiom for C , and let M be Syyy . We can form the CL-term MN , where N is Cxyz , that is, Syyy(Cxyz) . Cxyz Bw xzy , and Syyy Bw yy(yy) . If we think of ≥ as Bw , then we should have Syyy(Cxyz) ≥ Syyy(xzy) and Syyy(Cxyz) ≥ yy(yy)(Cxyz) to show that function application is monotone in both of its argument places. Those pairs of CL-terms are, indeed, in Bw . We have called pairs of CL-terms axioms, where the CL-terms together show the effect of a combinator, and we continue to supply combinators with axioms. We have to choose a combinatory basis, and we will take all the well-known combinators listed in section 1.2, which is more than sufficient. We suppose definition 1.1.1 of CL-terms as before. The additional symbol ≥ will be used as a binary predicate in infix notation. Formulas are of the form M ≥ N , where M and N are CL-terms. The informal understanding of a formula such as M ≥ N is that M weakly reduces to N . The axioms are formulas, whereas the rules comprise one or more formulas as premises and one formula as the conclusion. The premises and the conclusion are separated by a horizontal rule; if there is more than one premise, then they are spaced apart. The combinatory basis is B1 = { S, K, I, B, C, W, M, B0 , J } , and we will denote by IQB1 the calculus that incorporates all these combinators. The axioms and the rules are as follows. x≥x Ix ≥ x

Mx ≥ xx

M

Bxyz ≥ x(yz)

I

Kxy ≥ x

id

K

Cxyz ≥ xzy B0 xyz ≥ y(xz)

B

Sxyz ≥ xz(yz)

S

Wxy ≥ xyy

W

C

Jxyzv ≥ xy(xvz)

B0

M≥N [x1 /P1 , . . . , xn /Pn ]M ≥ [x1 /P1 , . . . , xn /Pn ]N M≥P P≥N M≥N M≥N MP ≥ NP

ml

J

sub

tr

M≥N PM ≥ PN

mr

A derivation is a tree, in which all nodes are formula occurrences, and all nodes except the leaves are justified by applications of rules. A derivation is a proof whenever all the leaves are instances of axioms. The root of a proof tree is the formula that is proved, and it is called a theorem.


Chapter 5.

(In)equational combinatory logic

123

The first axiom is identity for the variable x . Together with the rule of substitution, the effect of this axiom is that M ≥ M is provable for all CL-terms M . We call this axiom identity due to the analogy with sequent calculi. Neither ` in the sequent calculi, nor ≥ here is an equivalence relation; they are more like → . But A → A is called self-identity of → . An alternative motivation for the label is that a binary relation is reflexive when it includes the identity relation over its domain. The nine other axioms are for combinators — one for each combinator in the combinatory basis B1 . The rule of substitution is similar to the substitution that is built into the notion of one-step reduction. (See definition 1.3.2.) A difference is that no combinator need to be involved in this substitution rule. The transitivity rule is exactly what its label suggest: ≥ is transitive due to the inclusion of this rule. The monotonicity rules express the properties that we illustrated in the previous example. Example 5.1.2. B0 is just like B , but with x and y , the first two arguments permuted. C permutes its second and third arguments. Thus CB defines B0 and CB0 defines B in the sense of definition 1.3.6. In IQB1 , the CL-term CB applied to any M, N and P emulates B0 as the following proof shows. Cxyz ≥ xzy CBMN ≥ BNM

Bxyz ≥ x(yz)

CBMNP ≥ BNMP

BNMP ≥ N(MP)

CBMNP ≥ N(MP)

The example suggests that IQB1 is sufficiently powerful, but we might wonder whether it is, perhaps too powerful. Ideally, we would like the axiomatic calculus to reproduce exactly the Bw relation. For the next claim, we assume that the set of CLterms is generated by the same combinatory basis B1 together with a denumerable set of variables. T HEOREM 5.1.3. The formula M ≥ N is provable in IQB1 if and only if M Bw N . Proof: 1. We start from left to right. If M ≥ N is provable, then it has a proof. We use induction on the height of the proof, where the latter is the height of the proof tree. The shortest proofs are formulas that are instances of an axiom. If the axiom is id , then it is a special instance of M Bw M expressing the reflexivity of Bw . If the axiom is for a combinator, then we can first verify that the terms in the axioms in IQB1 contain the same pair of CL-terms as the axioms we gave for the respective combinators in section 1.2. Then by definition 1.3.2, each pair of terms in an axiom in IQB1 is in the B1 relation, hence in the Bw relation. 2. If M ≥ N is by a rule, then there are four cases to consider. (We provide some details of two cases and leave the other two, as exercise 5.1.1, to the reader.) 2.1 Let M ≥ N be the result of an application of sub . We introduced substitution for CL-terms in definition 1.2.2. However, both single and simultaneous substitution


124


are operations on single CL-terms (rather than on pairs of CL-terms). The rule sub presupposes the substitution operation, however, the latter does not define or give rise to the rule sub by itself. We built a limited amount of substitution into B1 to allow for the application of combinators to other CL-terms — beyond the variables that figure into their axioms. This way of handling substitution yielded a tightly circumscribed notion of B1 , and then of Bw , which facilitated proofs involving those relations. However, now we need that substitution is an “admissible rule,” which is the content of lemma 5.1.4, below. Given the lemma, it is immediate that sub preserves Bw . 2.2 Suppose that M ≥ N is by rule ml , that is, the formula is of the form M 0 P ≥ N 0 P . By assumption, M 0 Bw N 0 . If M 0 is N 0 , then M 0 P Bw N 0 P is obvious. If M 0 B1 N 0 , then M 0 P B1 N 0 P is by the definition of one-step reduction. If M 0 Bw N 0 , but neither of the previous two cases hold, then M 0 Bw Q and Q B1 N 0 , for some Q . Then we may assume M 0 P Bw QP , by the hypothesis of the induction. QP B1 N 0 P by the definition of one-step reduction, and since Bw is transitive, M 0 P Bw N 0 P , as we need. 3. For the other direction, let us assume that M Bw N . There are three cases to consider: when M is N , and M Bw N is by reflexive closure, when M B1 N , and when M Bw P and P Bw N . 3.1 M may or may not be a variable, in particular, it may or may not be x . We construct the following proof in IQB1 . x`x [x/M]x ` [x/M]x The first line is the id axiom, the next line is by sub . 3.2 Let us assume that M B1 N . By the definition of B1 , M contains a redex which is replaced by its reduct. There are nine combinators in B1 and each combinator is treated similarly; for the sake of concreteness, we choose S . Let us assume that the CL-terms that are the arguments of the selected redex occurrence of S are P1 , P2 and P3 . SP1 P2 P3 is a subterm of M , and in the formation tree of M , the subtree with root SP1 P2 P3 is replaced by the formation tree of P1 P3 (P2 P3 ) . M may contain other subterms, that is, the redex need not be the whole term M . We construct the following proof to obtain the effect of B1 . Sxyz ≥ xz(yz) SP1 P2 P3 ≥ P1 P3 (P2 P3 ) SP1 P2 P3 Q1 ≥ P1 P3 (P2 P3 )Q1 Q2 (SP1 P2 P3 Q1 ) ≥ Q2 (P1 P3 (P2 P3 )Q1 )

.. . Q1 and Q2 illustrate that, if the redex is a proper subterm of M , then finitely many applications of ml and mr suffice to embed the redex and its reduct to obtain M ≥ N . We leave finishing cases 2 and 3 for the next two exercises. qed


Chapter 5.

125


Exercise 5.1.1. Give a proof of the remaining subcases (2.3 and 2.4) in the above proof. (Hint: One of these subcases is nearly obvious given 2.2.) Exercise 5.1.2. Finish step 3 in the proof of the above theorem. (Hint: Only one step, namely, 3.3 remains to be proved.)

Recall that we appealed to a substitution rule for Bw in the proof of the last theorem. L EMMA 5.1.4. If M Bw N , then [x/P]M Bw [x/P]N . That is, Bw is closed under uniform substitution of CL-terms for a variable. Proof: If M Bw N , then there are three possibilities according to the definition of Bw . Namely, M and N may be the same CL-term. Then [x/P]M is also the same CL-term as [x/P]N , because [x/P] is an operation. Another case is when M Bw N by B1 . Then N is [Q1 /Q2 ]M , where Q2 is a redex occurrence, and Q1 is its reduct. We have nine combinators in B1 , but let us consider Zn for the sake of generality. Given Zx1 . . . xn B R (where R ∈ { x1 , . . . , xn }⊕ ), Q2 is ZQ01 . . . Q0n , and Q1 is [x1 /Q01 , . . . , xn /Q0n ]R . x may have occurrences in Q2 and in the rest of M . N is [[x1 /Q01 , . . . , xn /Q0n ]R/ZQ01 . . . Q0n ]M , which makes clear that if x occurs in Q2 , then x must occur in at least one of the Q0i ’s. ZQ01 . . . [x/P]Q0i . . . Q0n is a redex, and its reduct is [x1 /Q01 , . . . , xi /[x/P]Q0i , . . . , xn /Q0n ]R . If x occurs in M outside of the redex affected by the one-step reduction, then by the definition of substitution, P is substituted in those subterms of M and N in the same way. That is, ([ZQ01 . . . Q0n ]M)Px is MxP with the redex occurrence made explicit. Then we further have [Z(Q01 )Px . . . (Q0n )Px ](MxP ) . The substitution for N is [[x1 /(Q01 )Px , . . . , xn /(Q0n )Px ]R/ZQ01 . . . Q0n ](MxP ) . R ∈ { x1 , . . . , xn }⊕ , which means that NxP results by one-step reduction from MxP . Lastly, M Bw N may obtain because M Bw Q and Q Bw N ; therefore, by transitive closure, M Bw N . If the previous two cases do not hold, then we may assume that the length of one-step reductions in M Bw Q and in Q Bw N is less than in M Bw N . Then, by hypothesis, both [x/P]M Bw [x/P]Q and [x/P]Q Bw [x/P]N . [x/P] is an operation, which means that the two occurrences of [x/P]Q are the same CL-term. Then [x/P]M Bw [x/P]N is immediate by the transitivity of Bw . qed The lemma suggests that we can formulate a calculus with the same set of provable formulas without a rule of substitution. More precisely, substitution may be left implicit, because we can use meta-terms not only in the rules but also in the axioms. We denote this calculus by IQ0B1 . M≥M IM ≥ M

BMNP ≥ M(NP)

I

KMN ≥ M


id

K

CMNP ≥ MPN

B

C

SMNP ≥ MP(NP)

S

WMN ≥ MNN

W

126


MM ≥ MM

M

B0 MNP ≥ N(MP)

M≥P P≥N M≥N M≥N MP ≥ NP

ml

JMNPQ ≥ MN(MQP)

B0

J

tr

M≥N PM ≥ PN

mr

We can use the same notions of derivation and proof as before. However, we can also make “official” the practice of using meta-terms in a proof. In example 5.1.2, we proved CBMNP ≥ N(MP) , which is a meta-term itself. We could have proved the formulas CBxyz ≥ y(xz) or CBzxy ≥ x(zy) , by essentially the same proof, that is, by constructing a proof comprising the same axioms and applications of the same rules. Indeed, we can take any CL-terms for M , N and P in CBMNP ≥ N(MP) , and the resulting formula will be provable. This is yet another way to restate that the rule of substitution is admissible (in IQB1 too). L EMMA 5.1.5. The two calculi IQB1 and IQ0B1 are equivalent. Exercise 5.1.3. Prove the lemma. (Hint: Consider M ≥ N where M and N are concrete CL-terms.)

Example 5.1.2 suggests that we might consider extending either calculus by a rule that would allow an inequation to be derived when the applications of CL-terms on the left and on the right would yield a provable inequation. Regular combinators keep their first argument in place.2 A dual property — keeping the last argument in place — characterizes the class of final regular combinators. D EFINITION 5.1.6. A combinator Zn is final regular whenever its axiom is Zx1 . . . xn B Mxn . None of the well-known combinators that we included into the basis B1 is final regular and it is not difficult to see why. The combinators in B1 , perhaps except J , cause relatively simple changes in the redex CL-term that they are the head of. If we consider weak reduction, then the need for more arguments than those that are affected in some way seems to be a hindrance rather than an advantage. However, when we consider CL-terms that are combinators (but may not be in B1 ), then we soon find some that are clearly final regular. Example 5.1.7. Let us consider BB(KI) . To form redexes with both B ’s, we need four arguments. ( BB is itself a combinator and we denoted it by D in section 1.2; D is quaternary.) BB(KI)xyz Bw yz , and it appears that we could omit z . However, BB(KI)xy does not weakly reduce to y , because B(KIx)y does not contain a redex with B as its head. 2 Regular

combinators are defined in section 1.2.


Chapter 5.


127

We can disregard the fact that BIy is in nf, and expand the notion of weak reduction to include BIy B0 y . To have this effect in the inequational calculi, we add a rule to η IQB1 . The expanded calculus is denoted by IQB1 . Mx ≥ Nx

x∈ / fv(MN) M≥N

ext

The requirement that x is not a free variable of MN excludes spurious cases such as Mx ≥ xx and then M ≥ x , which obviously would be undesirable. If we would consider = , the tansitive symmetric closure of ≥ instead of ≥ itself, then M = x (together with M = y , by an alike step) would immediately lead to inconsistency. Exercise 5.1.4. Investigate what the consequences of omitting x ∈ / fv(MN) in the rule ext are. (Hint: A paramount question is if the calculus remains consistent.)

In chapter 1, we gave definitions of extensional weak equality and strong reduction. (See definitions 1.3.15, 1.3.16 and 1.3.18.) The relation between CL-terms that η is determined by provable inequalities in IQB1 is not an equivalence relation. On the other hand, we have already hinted at the possibility that there are provable inequaη tions in IQB1 that are not provable in IQB1 . The next series of exercises address the relationships between these relations on CL-terms. η

Exercise 5.1.5. Prove that IQB1 is consistent. (Hint: Recall that by consistency we mean that the relation ≥ is not the total relation on the set of CL-terms.) Exercise 5.1.6. Prove that there is no CL-term M such that for all N , M ≥ N is η

provable in IQB1 . (Hint: Although x is arbitrary in the ext rule, this does not change the relationship between fv(M) and fv(N) in a provable inequality.) Exercise 5.1.7. Prove that the binary relation on the set of CL-terms determined by

≥ is not a symmetric relation; hence, it is not an equivalence relation either. (Hint: Consider the axiom of K , for example.) Exercise 5.1.8. What is the relationship between Bs and the relation emerging from η

provable inequations in IQB1? The inequational calculi somewhat resemble sequent calculi.3 For instance, in chapter 7, we introduce structurally free logics, which constitute a family of sequent calculi. (There is a clash between the usual terminology used in connection to sequent calculi and the inequational calculi here. In the structurally free logics, combinators are formulas, whereas here they are terms. We continue to use the usual terminology for both calculi and hope that no confusion will result.) Many sequent calculi do not allow the right-hand side of a sequent to contain more that one formula. It is tempting to try to consider an inequation as a sequent, in which there is exactly one CL-term on each side of ≥ . This view creates a sense 3 See

section A.7 for a brief exposition of sequent calculi.


128


of similarity between the two types of calculi, but there are also differences that are worth noting. The structural connective (or connectives) are essential to sequent calculi. In an inequational calculus, the structural manipulations are limited, or they may be η thought to be absent altogether. There is one rule in IQB1 that allows altering the structure of a derivation, namely, the tr rule. (We do not consider the side condition in the ext rule as a node in the proof tree; hence, this rule is not alike to tr .) The tr rule is quite similar to the cut rule, which is originally not even called a structural rule in sequent calculi. Well-formulated sequent calculi do not include the cut rule, rather they have it as an admissible rule. We might ponder if the transitivity rule is admissible in IQB1 (provided tr is excluded to start with). η

Exercise 5.1.9. Determine whether tr is admissible in IQB1 (or IQB1 ), and prove

your claim. (Hint: If the rule is admissible, then a proof could use insights from proofs of the cut theorem. Otherwise, a counter example suffices.)

5.2

Equational calculi

Weak reduction is a fundamental relation, but weak equality is, of course, also important. =w is an equivalence relation, what should immediately suggest that we look for an equational calculus if we intend to capture this relation. To make comparisons between the inequational and equational calculi easy, we use the same combinatory basis B1 that we used in the previous section. An equation is a pair of CL-terms with = in between.4 The equational calculus EQB1 contains the equational calculus for a binary operation together with axioms for combinators. x=x Ix = x

Mx = xx

M

Bxyz = x(yz)

I

Kxy = x

id

K

Cxyz = xzy B0 xyz = y(xz)

B

C

B0

Sxyz = xz(yz)

S

Wxy = xyy

W

Jxyzv = xy(xvz)

M=N [x1 /P1 , . . . , xn /Pn ]M = [x1 /P1 , . . . , xn /Pn ]N 4 The

J

sub

symbols =w and = are very similar, and we intend to axiomatize weak equality. Nonetheless, as symbols, = and =w are completely distinct.


Chapter 5.

129


M=P P=N M=N M=N MP = NP

M=N N=M

tr

M=N PM = PN

ml

sym

mr

The axioms and the rules may be viewed as straightforward modifications of the axioms and rules in IQB1 : the ≥ symbol has been replaced by = . The only exception is the rule sym , which is completely new here. This rule ensures that the relation induced by provable equations on the set of CL-terms is symmetric. The notion of a derivation and of a proof is exactly as before. The two calculi differ only in the symbol that separates CL-terms and in the latter calculus having a rule sym , which motivates the next statement. L EMMA 5.2.1. For any M ≥ N that is provable in IQB1 , M = N and N = M are provable in EQB1 . The truth of this claim may be established by induction, which is quite easy due to the similarities of the calculi. Exercise 5.2.1. Prove the previous lemma.

The equational calculus also can be formulated with meta-terms. We denote this modification of the equational calculus by EQ0B1 . M=M IM = M

BMNP = M(NP)

I

KMN = M MM = MM

id

K

CMNP = MPN B0 MNP = N(MP)

M

B

M=P P=N M=N M=N MP = NP

ml

tr

C

B0

SMNP = MP(NP)

S

WMN = MNN

W

JMNPQ = MN(MQP)

M=N N=M M=N PM = PN

J

sym

mr

Having the two equational calculi plus the notion of =w leads us to the question if the relations determined by provable equations in the calculi and =w coincide on the set of CL-terms. L EMMA 5.2.2. An equation M = N is provable in EQB1 if and only if it is provable in EQ0B1 . Exercise 5.2.2. Give a proof of the lemma using induction on the height of proofs in

the two calculi.


130


The second version of the equational calculus allows for proofs of formulas that contain two meta-terms in addition to proofs of formulas that contain two CL-terms. T HEOREM 5.2.3. The equation M = N is provable in EQ0B1 if and only if M =w N . Proof: We divide the proof into two parts. First, we show that the conditional holds in the direction moving from EQ0B1 to =w . 1. Let us assume that M = N is by an axiom. If it is by id , then N is M . =w is reflexive by definition, which means that M =w M . If M = N is by a combinatory axiom, then we first of all note that the axioms in EQ0B1 match the axioms for the combinators from section 1.2. Second, the definition of B1 provides for substitution in a redex, and B1 ⊆ Bw as well as Bw ⊆ =w . Weak equality is transitive and symmetric by definition. Thus if M = N and N = P in EQ0B1 (hence, by hypothesis, M =w N and N =w P ), then it is immediate that M =w P . If M = N , that is, by hypothesis M =w N , then certainly, N =w M , as needed. Lastly, the definition of B1 implies monotonicity of function application both on the left and on the right; B1 is included in =w , which takes care of the rules ml and mr . 2. To prove the converse, we consider the definition of =w and then we show that a proof may be constructed in EQ0B1 . We can establish this direction by using lemma 5.2.1 and theorem 5.1.3. If M =w N is due to M Bw N , then M ≥ N in IQ0B1 , hence, also M = N in EQ0B1 . Otherwise, M =w N is by transitive symmetric closure of Bw . If M Bw N , then by lemma 5.2.1, M = N and N = M in EQB1, and by lemma 5.2.2, M = N and N = M are provable in EQ0B1 . Given M1 =w M2 , . . . , Mn−1 =w Mn , we have M1 = M2 , . . . , Mn−1 = Mn , and by n − 2 applications of the tr rule, M1 = Mn . qed Exercise 5.2.3. Construct step 2 in the proof using the definition of Bw and then =w

directly (i.e., without relying on lemma 5.2.1). Notice that, by using the second formulation EQ0B1 , we avoided the question about emulating steps by the rule of substitution in pairs of CL-terms that are weakly equal. However, we have the following lemma that parallels lemma 5.1.4. L EMMA 5.2.4. The weak equality relation is closed under substitution of CL-terms for variables in CL-terms. Exercise 5.2.4. Prove the lemma. (Hint: The lemma is similar to lemma 5.1.4.) Exercise 5.2.5. Given the above lemma, prove theorem 5.2.3 for EQB1 (instead of

EQ0B1 ).

We added the rule ext to IQB1 , and we add its equational variant to EQB1 ; the η resulting calculus is denoted by EQB1 . Mx = Nx


x∈ / fv(MN) M=N

ext

Chapter 5.

131


We saw that adding the extensionality rule yielded new provable inequations. Similarly, we get new provable equations with ext added to EQB1 . Example 5.2.5. SIIx Bw Ix(Ix) Bw xx . This shows that M is definable as SII in the η sense of definition 1.3.6. In EQB1 , we can prove SII = M as: Ix = x Sxyz = xz(yz)

Ix = x

Ix(Ix) = x(Ix)

x(Ix) = xx Ix(Ix) = xx

SIIx = Ix(Ix) SIIx = xx

SIIx = Mx

Mx = xx xx = Mx

.

SII = M η

The next proposition shows that, in the context of EQB1, the name “extensionality” for the ext rule is fully justified. That is, if this rule is present, then the relation on CL-terms that is induced by provable equations is extensional. η

L EMMA 5.2.6. The equivalence relation generated by equations provable in EQB1 coincides with extensional weak equality. Proof: Extensional weak equality is specified in definitions 1.3.15 and 1.3.16. It is more convenient here to rely on the second definition, because of the use of variables. From right to left, let us assume that M and N — when applied to x1 , . . . , xn — yield the term P via weak reduction. That is, Mx1 . . . xn Bw P and Nx1 . . . xn Bw η P . By lemma 5.2.1, we know that Mx1 . . . xn = P is provable in EQB1 , and so is Nx1 . . . xn = P . The rules sym and tr give Mx1 . . . xn = Nx1 . . . xn in two steps. An assumption in definition 1.3.16 is that xn ∈ / fv(MNx1 . . . xn−1 ) , which makes ext applicable to Mx1 . . . xn = Nx1 . . . xn . We get Mx1 . . . xn−1 = Nx1 . . . xn−1 , and using the similar assumptions for xn−1 , . . . , x1 successively, we obtain M = N , by n − 1 further applications of the rule ext . To prove that the inclusion between the two relations holds in the other direction, let us assume that M = N . If the proof of M = N does not involve ext , then we know that M =w N , by theorem 5.2.3. Then, by the Church–Rosser theorem, there is a CLterm P such that with no x ’s supplied M Bw P as well as N Bw P . If M = N is by an application of ext , then Mx = Nx with x not free in either M or N is provable in η EQB1 . Then, by the hypothesis of the induction, Mxy1 . . . yn Bw P for some P such that Nxy1 . . . yn Bw P too. However, the two latter weak reductions are sufficient to show that there are x1 . . . xn (for some n ) and there is a P such that Mx1 . . . xn Bw P as well as Nx1 . . . xn Bw P . qed We return to inequational and equational calculi in sections 7.1.1 and 7.2.1, where we consider calculi for dual and symmetric CL.



Chapter 6 Models

In the previous chapters, we looked at properties of CL as a formal system. The results that we mentioned can be obtained about CL without assigning a “meaning” to the CL-terms. Indeed, we have not given a precise interpretation for CL-terms, though we often alluded to the informal idea that they all stand for functions. An informal interpretation of the combinators and the application operation is useful, and hardly dispensable. However, rigorous interpretations are always desirable, and they are often preferable to informal interpretations. The precision that a rigorous interpretation provides can yield new insights about the formal system itself. Indeed, the first functional models confirmed that the notion of function application can reasonably include the self-application of functions. The first models for combinatory logic were constructed from the language of CL itself; hence, they are called term models. These models are closely related to the algebra of CL, and can be viewed as the canonical algebras in a class of algebras that are representations for CL. The algebras that can serve as models of CL are sometimes called operational models. The most commonly used functions are numerical. At first, it might seem unlikely that functions on the set of natural numbers could interpret CL-terms. However, using a suitable encoding of functions (on natural numbers) by natural numbers, a functional model may be defined. Natural numbers have a lot of structure to them, not all of which is exploited in this model. The features that are needed in the construction of a model is distilled into the concept of domains. A certain class of functions provides another model in which all CL-terms are interpreted as functions. Notably, neither sort of functional models precludes self-application. Implicational formulas can interpret CL-terms, which yields a concrete operational model. Implicational formulas, in turn, can be viewed as simple types. The connection between formulas and CL-terms is further developed in interpretations of typed CL. The type constructor → is an implication but not in the sense of classical logic. In the first instance, simple types are linked to the implicational fragment of intuitionistic logic, and to implicational fragments of various relevance logics. Nonclassical logics are often given a relational (or “possible worlds”) semantics. CL is a nonclassical logic itself, in which function application is a binary operation similar to multiplication or fusion. The paradigm of relational semantics is applicable to CL — even though CL does not contain conjunction- and disjunction-like connectives.


134


6.1

Term models

Models for a formal system may be built from entities of any sort, which does not mean that all the models are equally “pleasing,” “useful” or “informative.” Some models are also easier to come up with. The components of the language in which a system is formulated are readily available; thus it is natural to ask the question whether it is possible to build a model from the bits and pieces of the language itself. The objects in CL are terms, hence these kinds of models are called term models. Of course, it is always possible to interpret a CL-term by itself. However, such an interpretation would be quite uninteresting. The other extreme would be to interpret all the CL-terms as one particular term, or as the set of all terms. This would be a rather uninteresting model too. An idea, that is more fruitful, is to interpret the terms so that the interpretation is neither obvious nor trivial, and some information about the behavior of the terms or about the relationship between them is captured. Between the syntactic identity relation and the total relation, there are many possible relations on the set of CL-terms. Weak reduction and weak equality are relations that immediately come to mind. An advantage is that they are not some arbitrary relations in the sense that CL characterizes them; that is, we do not need to look for some independent and new description of the relation. Weak equality is an equivalence relation, whereas weak reduction is only a preorder (when the formulation of antisymmetry is thought to contain syntactic identity rather than =w ).1 Equivalence relations facilitate the creation of classes of objects that are similar from the point of view of that relation. D EFINITION 6.1.1. The equivalence class generated by the CL-term M is denoted by [M] . The set [M] is defined as follows. (1) [M] = { N : M =w N } . The binary application operation on equivalence classes, denoted by juxtaposition, is defined as (2) [M] [N] = { PQ : P ∈ [M] and Q ∈ [N] } . It is obvious that each CL-term generates an equivalence class with respect to =w , to which the term itself belongs, because of the reflexivity of =w . The consistency of CL means that there is more than one equivalence class. That is, for any CL-term M , there is an N , such that [M] 6= [N] . We also recall that N ∈ [M] is not decidable, because =w is not decidable. In CL, there are no bound variables, hence the interpretation may be defined without separating the interpretation of variables from that of constants. 1 See

section A.6 for definitions.


Chapter 6.

Models

135

D EFINITION 6.1.2. (I NTERPRETATION OF CL- TERMS ) The interpretation function I is defined inductively according to the structure of CL-terms. (1) I(x) = [x] , when x is a variable; (2) I(S) = [S] and I(K) = K , when { S, K } is the combinatory basis; (3) I(MN) = [M] [N] , when M and N are CL-terms. The interpretation takes an atomic CL-term to the equivalence class that is generated by that term, whereas the application operation on terms is interpreted by the application operation on equivalence classes. We have to show that the latter is, indeed, an operation on equivalence classes. The latter operation is not affected by the choice of a particular term from an equivalence class. L EMMA 6.1.3. If M and N are CL-terms, then [M] [N] is an equivalence class of CL-terms.

Proof: Let P ∈ [M] and Q ∈ [N] , that is, P =w M and Q =w N . Then PQ =w MN , or to state it differently, [M] [N] = [MN] . qed The construction using equivalence classes and an operation that is defined from an operation on the objects in the equivalence classes is quite usual. Sometimes it is called the algebraization of a logic, and the resulting structure is often called the Lindenbaum algebra of the logic. In the case of classical logic, the equivalence classes emerge from the relation of mutual provability between formulas. For instance, A and (A ∧ (A ∨ A)) are provably equivalent, thus they generate the same equivalence class: [A] = [(A ∧ (A ∨ A))] . Further, [A] ∧ [B] = [A ∧ B] , where ∧ on the equivalence classes is defined by type-lifting ∧ from formulas. Algebraically speaking, the set of CL-terms is an algebra with a binary operation, and =w is a congruence relation in this algebra. A congruence is an equivalence relation, which is in harmony with the operations on the elements of the equivalence classes: the result of the operation is independent of the concrete representatives chosen from the equivalence classes. To put it in yet another way, replacement holds with respect to the equivalence relation. The result of an application of I to the set of CL-terms is an algebra, and it behaves — somewhat unsurprisingly — as an interpretation is expected to behave. L EMMA 6.1.4. (A DEQUACY ) If M =w N in CL, then I(M) = I(N) . Conversely, if I(M) = I(N) , then M =w N . Proof: We will use the equational calculus with S and K from chapter 5.2 First, we prove the first claim and then the second one. 1. The subcases dealing with id , tr and sym are practically obvious. (If you do not find them so, then you should write out the details.) Weak equality is a congruence 2 Here,

too, the combinatory basis could be varied, and it only has to be ensured that clauses that concern the combinatory constants in definition 6.1.2 match the elements of the combinatory basis.


136


due to the ml and mr rules. Let us assume that M =w N and P is a CL-term. Then, by the definition of I (i.e., clause (3) in definition 6.1.2), I(MP) = [M] [P] , which is the same set of terms as [MP] . However, NP =w MP , and so NP ∈ [MP] , therefore, [NP] = [MP] . The next series of equalities shows that I(MP) = I(NP) : I(MP) = [M] [P] = [MP] = [NP] = [N] [P] = I(NP) . Showing that the claim is true for the combinatory axioms is similar, and we leave the details as an exercise. 2. Let us assume that M 6=w N . Then [M] 6= [N] , by the definition of equivalence classes. It is easy to verify that for all M , M ∈ I(M) , indeed, I(M) = [M] . However, M∈ / [N] and N ∈ / [M] , therefore, I(M) 6= I(N) as we intended to show. qed Exercise 6.1.1. Finish step 1 from the above proof.

This construction and the resulting algebra is pivotal in thinking about the meaning of CL-terms. As long as we intend to model CL with =w , we can take this algebra and interpret it. There is a difference in the type level between the elements of the algebra comprising CL-terms and the latter algebra comprising equivalence classes of CL-terms. However, composing an interpretation of the algebra of CL with the map M 7→ [M] always recovers the corresponding interpretation for the terms themselves. The other advantage gained by isolating the algebra of CL is that this algebra is prototypical for all the algebras that can be taken as interpretations of CL, which is the topic of the next section.

6.2

Operational models

The algebra of CL with =w suggests that we consider a class of algebras that are characterized by the equations that are true in the algebra of CL. We will call algebras in this variety combinatory algebras. D EFINITION 6.2.1. (C OMBINATORY ALGEBRAS ) Let A = hA; · , S, Ki be an algebra of similarity type h2, 0, 0i in which (1)–(2) hold. (We use a, b, c, . . . for arbitrary elements of the algebra, and we omit parentheses from left-associated algebraic terms.) (1) S · a · b · c = a · c · (b · c) ; (2) K · a · b = a . The simplicity of this definition (compared to the equational calculus) is due to the tacit assumptions that the notion of an algebra implies. In particular, = is supposed to be reflexive, transitive and symmetric without especially being mentioned. The replacement property is also assumed with respect to each operation (of positive arity) in the algebra. Lastly, the variables in the equations are presumed to be universally quantified; that is, the equations hold for arbitrary elements a, b and c , of the algebra.


Chapter 6.

Models

137

We used S and K in the definition; however, the class of algebras in this variety includes further algebras beyond the algebra of CL. Thus S and K are not the wellknown combinators, rather two distinguished elements of the algebra that have a certain similarity to the combinators S and K in CL (what we emphasized by using the same notation). D EFINITION 6.2.2. An interpretation of CL into a combinatory algebra A is a function I that satisfies conditions (1)–(3). (1) I(S) = S and I(K) = K ; (2) I(x) ∈ A , when x is a variable; (3) I(MN) = I(M) · I(N) . The interpretation function fixes the meaning of the combinatory constants as the distinguished elements of the algebra. Otherwise, the application operation of CL is turned into the binary operation of the combinatory algebra; the variables are interpreted as (arbitrarily chosen) elements of the algebra. The identity function satisfies the above conditions, and is an interpretation of CL into a combinatory algebra. This interpretation may seem uninteresting at first, but it is very useful. L EMMA 6.2.3. If M =w N in CL, then I(M) = I(N) in every combinatory algebra A with any interpretation I . Proof: The definition of a variety, as we already pointed out, incorporates parts of the equational calculus for CL, such as the properties of = and its interaction with the binary operation · . Then, our proof shortens to verifying that the claim holds for the combinatory axioms. However, that is obvious, when the basis is { S, K } . qed Combinatory algebras from the class in definition 6.2.1 look simple; at least their definition is quite simple. Nonetheless, they have remarkable properties beyond including the algebra of CL. Recall that an algebra A is trivial if and only if its carrier set A contains exactly one element. The triviality of the algebra of a logic corresponds to the absolute inconsistency of that logic. L EMMA 6.2.4. If a combinatory algebra A is not trivial, then it is not Abelian. That is, if the · operation of A is commutative, then A is a singleton set. Proof: We will prove the second formulation of the claim of the lemma. Let us assume that · is commutative. We start with the term K · S · a · K · (K · (K · b)) · c , which equals to S · K ·(K ·(K ·b))·c . The latter term is simply an (overly complicated) alternative of the definition of the identity combinator (when we squint and view S and K as combinators) applied to c . Indeed, S · K · (K · (K · b)) · c = c . Let us now start with the same term K · S · a · K · (K · (K · b)) · c , and use the commutativity of · for the fourth occurrence of · . This gives us the term K · (K · b) · (K · S · a ·


138


K) · c . Having applied the characteristic equation for K to this term, we get K · b · c ,

which further equals to b . In sum, c = b , though b and c are arbitrary elements of the algebra, which means that A = { c } . qed Of course, the lemma does not mean that combinators that are permutators are forbidden. S is a permutator itself — in addition to being a duplicator and an associator. Exercise 6.2.1. Suppose — for the sake of simplicity — that T is a constant in a combinatory algebra (like the combinator T ).3 That is, T · a · b = b · a . Check that the steps in the proof cannot be repeated with T · (K · S · a · K) · (K · (K · b)) · c or T · K · S · a · K · (K · (K · b)) · c when the commutativity of · is not assumed. Exercise 6.2.2. Find another term of a combinatory algebra (preferably, a shorter

and simpler term than the one in the proof) to prove the same claim that Abelian combinatory algebras are trivial. L EMMA 6.2.5. If a combinatory algebra A is not trivial, then its operation · is not associative. Exercise 6.2.3. Prove the lemma. (Hint: Recall that a binary operation is associative,

when for all elements a, b and c , (a · b) · c = a · (b · c) .) L EMMA 6.2.6. If a combinatory algebra A is not trivial, then its carrier set A is not finite. Proof: Let us assume that a combinatory algebra A has a carrier set with elements a1 , . . . , an , where n > 1 and n ∈ N . We show that if so, then there are ai and a j such that i 6= j , but ai = a j in A . First, we show that n = 2 is impossible. 1.1 Let us consider the elements a1 and a2 . We may choose a1 to be K ; then S = a1 or S = a2 . In the first case, we consider the term S · (K · K) · K · a1 · a2 · a2 . The assumption about S = a1 = K means that this term equals K ·(K · K)· K ·a1 ·a2 ·a2 . Using repeatedly the equations governing S and K , we arrive at the equalities a1 = S · (K · K) · K · a1 · a2 · a2 = K · (K · K) · K · a1 · a2 · a2 = a2 , which mean that a1 = a2 . 1.2 If S = a2 , then we choose other terms with the intention to show that K = S , that is, a1 = a2 . First, let us consider K · K , which is a term in the language of the algebra, hence it denotes an element. Let us assume that K · K = a1 . Then we start with the term S · (K · K) · (K · K) · a1 · a2 · a2 · a1 . Since K · K = K , the term equals to S · K · K · a1 · a2 · a2 · a1 . However, if K · K = K = a1 , then a1 = K · (K · (K · K)) . Applying the equations for S and K , we get that the former term equals a2 , whereas 3 There

is a term in every combinatory algebra comprising occurrences of S , K and · , which defines this constant. For example, S · (K · (S · (S · K · K))) · (S · (K · K) · (S · K · K)) is such a term.


Chapter 6.

Models

139

the latter equals a1 . The other possibility is that K · K = a2 , that is, S . We start with the term K · K · (K · K) · K · (K · K) · a2 · a2 · a2 and we replace the first two occurrences of K · K with S . Then the latter term equals a2 , that is, S , whereas the former equals K (i.e., a1 ). In both subcases, we have shown that a1 = a2 , which shows that n = 2 implies n = 1 . 2. Now we show that if A has (no more than) n + 1 elements, then A has (no more than) n elements. Let A have n + 1 elements, which we label by a1 , . . . , an+1 . S, K ∈ A ; hence, without loss of generality, we may assume that a1 = K . If S = a1 too, then we can proceed as in case 1.1. Otherwise, we stipulate that S = a2 . Again, this choice does not affect the generality of the proof. We note that there are terms of arbitrarily large finite length such as, for example, K · K , K · (K · K) , etc. These terms exist in the language of A independently of the size of the carrier set of A . Let K(n) be defined inductively as follows. (1) K(1) is K ; (2) K(n+1) is (K · K(n) ) , when n ∈ N+ .4 In the algebra of CL, the corresponding combinators K(n) have arity n + 1 , and K(n) x1 . . . xn xn+1 Bw xn . To prove that, for some elements ai and a j (where i 6= j ), we have ai = a j , it is sufficient to prove that K(i) = K( j) implies ai = a j . Let us assume that K(i) = K( j) . Again, we may arbitrarily choose whether i > j or j > i ; let us suppose the former. Then we take i -many copies of the term S · K · K for the first i arguments of K(i) and ai for its i + 1st argument. The term equals to S · K · K , by applying i times the equation for K . Replacing K(i) by K( j) , we get that the term equals to one or more copies of S · K · K followed by ai , hence, to ai . Starting with a similar term but with a j in place of ai , we get a sequence of equations: ai = S · K · K = a j . qed Exercise 6.2.4. Prove the claims we made in the proof about the K(n) ’s, namely, that (a) each K(n) has arity n + 1 , and (b) each K(n) cancels all but its n th argument. Exercise 6.2.5. Give a simpler proof of lemma 6.2.6. (Hint: Scrutinize the above

proof.) L EMMA 6.2.7. If I(M) = I(N) in every combinatory algebra, then M =w N in CL. Proof: Let us assume that M 6=w N in CL. We show that there is a combinatory algebra and an interpretation such that I(M) 6= I(N) . Then, by contraposition, the claim of the lemma follows. Consider the algebra that is formed by taking the equivalence classes of CL-terms, and by defining the application operation on them. Since M 6=w N , M and N do not belong to each other’s equivalence class. We define I as the identity function, that is, each term is mapped into the equivalence class it generates. It is straightforward to verify that I is an interpretation of CL-terms into a combinatory algebra. Obviously, I(M) 6= I(N) . qed 4 We

have been omitting the outside parentheses from algebraic terms (just as we did for CL-terms). In clause (2), they are included to underscore that for n > 2 , K(n) is right associated: (K · (K · . . .)...) .


140


Equations are easy to handle, and varieties are a well-understood kind of algebras. Moreover, they have important closure properties, for instance, homomorphic images of algebras from a variety belong to the same variety. Sometimes, it might appear that the language of a logic does not contain a connective that leads to an equational algebraization, but there is a way to define equality anyway. The situation is different when we look at CL with Bw (rather than =w ). There is no conjunction or disjunction like connective that would allow us to introduce = , and of course, if we focus on Bw , then we do not wish to define equivalence classes via =w . It is possible to algebraize CL with Bw , that is, to consider the algebra of the inequational calculus for CL. However, the resulting algebra is not characterized by equations. The idea is to place into the same equivalence class not the terms that are weakly equal to each other, but only those terms that weakly reduce to each other. For instance, WI(WI) and I(WI)(WI) are terms that are not only weakly equal, but also reduce to each other. D EFINITION 6.2.8. A combinatorial reduction algebra is a partially ordered algebra A = hA; ≤, · , S, Ki of similarity type h2, 0, 0i , when the inequations in (1)–(2), and the quasi-inequations in (3)–(4) are true, for all a, b, c ∈ A . (1) S · a · b · c ≤ a · c · (b · c) ; (2) K · a · b ≤ a ; (3) a ≤ b implies c · a ≤ c · b ; (4) a ≤ b implies a · c ≤ b · c . A partially ordered algebra also carries certain tacit assumptions, namely, ≤ is a partial order. Sometimes partially ordered algebras are defined to contain everywhere monotone operations. However, we may assume a more general definition, what may be viewed to be the definition of a tonoid. (We made the tonicity of · explicit in (3) and (4).5 ) The notion of an interpretation is as in definition 6.2.2, with S , K and · belonging to a combinatorial reduction algebra now. L EMMA 6.2.9. If M Bw N in CL, then I(M) ≤ I(N) in every combinatorial reduction algebra under any interpretation function I . Proof: The proof is similar to the proof of lemma 6.2.3. The combinatory axioms for S and K match the inequations in (1) and (2) in definition 6.2.8. The two other conditions are easily seen to hold in view of Bw being a preorder on the set of CLterms. The inequational formalization of CL includes the assumptions of an ordered algebra save the antisymmetry of the order relation; thus, the rest of proof is not difficult, and it is left to the reader. qed 5 For

a discussion of notions of ordered algebras and the definition of tonoids, see [, §§3.9–10].


Chapter 6.

Models

141

The algebraization of CL with respect to Bw is appropriate, as the following lemma shows. L EMMA 6.2.10. If I(M) ≤ I(N) is every combinatorial reduction algebra under any interpretation function I , then M Bw N . Proof: We prove the contraposition of the statement. Let us assume that M does not reduce to N . Let us define [N] = { M : N Bw M ∧ M Bw N } . In words, we use in place of an equivalence relation the relation of mutual weak reducibility to generate equivalence classes of CL-terms. From the assumption and the definition, we get that M∈ / [N] . We have for any CL-term P , that P ∈ [P] . Thus I can be taken as the identity function on terms, or a bit more precisely, I(P) = [P] . I(MN) = [M] [N] , hence the type-lifted application operation may be taken for · . It is not difficult to check that A = h{ [M] : M is a CL-term }; ≤, · , [S], [K]i , where ≤ is the obvious partial order on the set of equivalence classes is a combinatorial reduction algebra. Then I(M) = [M] [N] = I(N) is immediate. qed Exercise 6.2.6. Verify in detail that the algebra A as defined in the above proof is

indeed a combinatorial reduction algebra as we claimed. The model that we describe next is closely related to typed-CL as well as to the canonical construction in the relational models. Indeed, this model can be viewed as a preeminent example of a combinatorial reduction algebra.6 In chapter 9, we introduce in detail several typed versions of CL. At this point we do not intend to introduce a formal type system; however, we would like to appeal to the connection between implicational formulas (i.e., simple types) and certain combinators. Implicational formulas are inductively generated from a set of propositional variables by the binary connective → , which is called implication. Example 6.2.11. Let us assume that Z4 is a combinator with axiom Zxyzv B z(xyv) . We could, perhaps, view Z as an implicational formula so that taking the application operation as modus ponens, Zxyzv would yield the same formula that z(xyv) does. Let us take, in place of Z , (D → A → B) → D → (B → C) → A → C . We take the antecedents of this formula for x, y, z and v , respectively. To get the formula that corresponds to xyz , we detach D and then A from D → A → B getting B . z is B → C , and so C is the wff corresponding to the term on the right-hand side, and of course, C is the formula that remains after detaching the antecedents from the formula standing for Z . After this quick example, we introduce a partial operation that takes two formulas A → B and C , and returns a formula (if certain conditions can be met), which is the result of a detachment of C0 from A0 → B0 , where the 0 ’s indicate a certain amount of substitution that is sufficient for modus ponens to become applicable. There are pairs 6 The

model comes from Meyer et al. [], and there it is called “the fool’s model.” This label might be stunning, but it is an allusion to some ideas of Anselm of Canterbury from the 11th century, and the motivation is more fully explained in the paper itself.


142


of formulas A → B and C such that no amount of substitution can make detachment achievable; hence, the operation is partial.7 D EFINITION 6.2.12. (M GCI ) Let A and B be formulas that do not share any propositional variables. The wff C is a most general common instance (mgci, for short) of A and B , when C is a substitution instance of both formulas, and all C0 ’s that are common instances of A and B are substitution instances of C . Mgci’s are described in a somewhat complicated fashion, but they are quite simple. Example 6.2.13. Let the two formulas be p and q . Then p is an mgci of these formulas, so is q . Indeed, any propositional variable would do, but no wff that contains → is a mgci of them. The example illustrates why we may use a definite article with mgci’s: they all look the same, that is, they are each other’s substitution instances when the substitutions are restricted so that they assign distinct propositional variables to distinct propositional variables. Such formulas are called alphabetic variants of each other, and the procedure of generating them is called relettering. Example 6.2.14. Let the two formulas be (p → p) → q and s → (r → (s → r)) . In this case, neither formula can be taken to be the mgci, because one of the formulas has an implication in its antecedent with the other having a variable, and the other way around for the consequents. The idea would be to take r → (s → r) for q and p → p for s , but it is not sufficient to use the substitution [q/r → (s → r), s/p → p] on the formulas, and not only because we would end up with formulas that still do not share all their variables: (p → p) → (r → (s → r)) and (p → p) → (r → ((p → p) → r)) . If we compare the resulting formulas, then we can easily see why the purported substitution does not work. We stipulated to change s to p → p ; however, we also substituted a wff with an occurrence of s for q . [q/r → ((p → p) → r), s/p → p](p → p) → q is (p → p) → (r → ((p → p) → r)) , and so is [q/r → ((p → p) → r), s/p → p]s → (r → (s → r)) . Notice that two wff’s that have no common propositional variables either have infinitely many mgci’s or none. Exercise 6.2.7. Create an example with two formulas so that they have no mgci.

Given a pair of formulas, it is always possible to decide whether they have an mgci, that is, if they can be unified. The next definition has an algorithmic flavor. In chapter 9, we give a more descriptive definition (that is equivalent to the present one). D EFINITION 6.2.15. (C ONDENSED DETACHMENT ) starting formulas. 7 Definition

Let A → B and C be the

9.1.37, in chapter 9, is an alternative definition of this partial operation.


Chapter 6.

Models

143

1. Let C0 be a relettering of C so that C has no variables in common with A → B . 2.1. Let D be a mgci of A and C0 , that is obtained by the substitution σ . 2.2. If there is no mgci for A and C0 , then there is no formula that results from A → B and C by condensed detachment. 3.1. σ(B) is the result of the condensed detachment of C from A → B . By the numbering of the steps, we intend to indicate how the algorithm may proceed: 1, 2.1, 3.1 or 1, 2.2. Example 6.2.16. Let us suppose that we are given the formulas p → q → p and ((p → q) → p) → p . Both of them are implications, hence we could take either for the major premise of modus ponens. We surely have to reletter one of them though. ((r → s) → r) → r is a relettering of the latter formula, which is often called Peirce’s law. Let the first formula be the major premise. Its antecedent is a propositional variable; hence, we simply have to substitute the second wff for p : (((r → s) → r) → r) → q → ((r → s) → r) → r . The condensed detachment is successful in the sense that it results in a formula, namely, q → ((r → s) → r) → r . Now let us reverse the roles of the formulas. Then we want to find a common substitution for (r → s) → r and p → q → p . We saw in example 6.2.14 that, in principle, it is not an obstacle to finding a common instance that the formulas have compound formulas in different places in their antecedent or consequent. But these two formulas have more structure than the previous ones, because of the repeated occurrences of some propositional variables in them. It appears that we have to make p = r → s and r = q → p . (The constrains obtained from an attempted unification are often written in the form of equations. We follow this practice here using the “ = ” symbol in the meta-language.) The equational form lure us into replacing r in the first equation according to the second one: p = (q → p) → s . We could proceed the other way around, and get an equation for r : r = q → r → s . Either way, we end up with an equation in which a variable occurs on one side of the equation and it also occurs on the other side — but there as a proper subformula. However, this situation is excluded, which means that the condensed detachment of the so-called positive paradox from Peirce’s law does not yield a formula. Mgci’s are not unique in the sense that any relettering of an mgci is an mgci. In the case of condensed detachments, which are successful, the use of the definite article in “the result” is to be understood similarly. Strictly speaking, there is no unique formula that results, because the renaming of variables is allowed, and we have not defined a deterministic algorithm that would produce for each formula exactly one relettering. However, we wish to stress that a relettering is a very special kind of substitution, which does not identify distinct variables and does not increase the complexity of the formula. Certain combinators are associated with implicational formulas and certain implicational formulas are associated with combinators. (The matching though is not


144


total for either set.) Section 9.1 gives a detailed motivation, in the form of a natural deduction calculus, for type assignment. The natural deduction calculus shows how this association between formulas and combinators emerges straightforwardly. Suffice it to say here that, if we are thinking about the combinatory basis { S, K } , then the formulas that are assigned to some combinators are exactly the theorems of the implicational fragment of intuitionistic logic. If we consider other bases, especially, bases that are not combinatorially complete, then the set of implicational formulas is a proper subset of those theorems, for example, it may be the set of theorems of the implicational fragment of a relevant logic. The slogan “formulas-as-types” originated in the context of typing combinators and λ -terms. Here we do not assign formulas to combinators (or in general, to CLterms) using a proof system; rather, we will interpret CL-terms as sets of formulas. The next definition emphasizes the latter point of view. D EFINITION 6.2.17. (S ETS OF SUBSTITUTION INSTANCES ) Let A be an implicational formula. The set of all substitution instances of A is denoted by { A }s . That is, { A }s = { B : B is σ(A) } , where σ is a substitution. There is no standard notation for sets of formulas that are substitution instances of a wff — except by resorting to the use of meta-variables. We added the subscript s to avoid confusion with the singleton set containing A . We give a list of combinators and sets of formulas associated to them. Combinator

Set of wff’s

S

{ (p → q → r) → (p → q) → p → r }s

0

{ (p → q) → (p → q → r) → p → r }s

S

K

{ p → q → p }s

B

{ (p → q) → (r → p) → r → q }s

B0

{ (p → q) → (q → r) → p → r }s

W

{ (p → p → q) → p → q }s

I

{ p → p }s

C

{ (p → q → r) → q → p → r }s

T

{ p → (p → q) → q }s

CII

{ ((p → p) → q) → q }s

KI

{ p → q → q }s

J

{ (p → q → q) → p → q → p → q }s

The set { p → q → p }s contains all the reletterings of the formula, and all the reletterings of p → p → p , as well as all formulas that are obtained by substitutions that increase the complexity of the formula. For instance, (q → q) → r → q → q ,


Chapter 6.

Models

145

q → (q → q) → q and (p → r → s) → (r → q → q) → p → r → s are all elements of { p → q → p }s . It so happens that some formulas, which have been given names during the historical development of logic, are principal types of some combinators that we introduced earlier. We gave a list of combinators and sets of formulas without any motivation. However, a clear motivation emerges from typed CL, what we introduce in chapter 9.8 We have listed nearly all the combinators that appeared in chapter 1. A combinator that is missing is M . WI defines M , and if we think about W , that is, contraction: (p → p → q) → p → q , as the major premise and I , that is, self-identity: p → p , as the minor premise in an application of condensed detachment, then we can see that there should be no wff associated to M .9 There is a “mismatch of levels” between the rule condensed detachment, which is applied to pairs of formulas, and the combinators, which are sets of formulas. However, we can define an operation on sets of formulas that is derived from condensed detachment and is similar to condensed detachment. D EFINITION 6.2.18. Let X and Y be sets of wff’s. The condensed detachment of X and Y, denoted by X ·Y, is defined as X ·Y = {C : ∃A ∈ X ∃B ∈ Y. D(A, B) = C }, where D(A, B) is the wff (if exists) that is obtained by condensed detachment from A and B . We call this operation condensed detachment too, because no confusion can arise — precisely because the two operations are applicable to different kinds of objects. This definition does not assume that either set of formulas, X or Y , comprises substitution instances of some single formula. Example 6.2.19. Let X = { (p → p → q) → p → q } and Y = { p → p, p → q → p } . Then r → r ∈ X ·Y , and this happens not because p → p ∈ Y , but because D((p → p → q) → p → q, p → q → p) = r → r . L EMMA 6.2.20. Let us consider { A }s and { B }s . { A }s · { B }s = {C }s , provided that the condensed detachment of the two sets is not empty. Proof: Let us assume that E ∈ { A }s · { B }s . Then there are C1 → C2 ∈ { A }s and D ∈ { B }s such that E = D(C1 → C2 , D) . We may assume that C1 → C2 and D do not share any propositional variables, because the reletterings of these wff’s are also elements of the sets. Hence we can suppose that the relettering in the application of condensed detachment is relegated to the choice of elements from { A }s and 8 For

instance, the notion of principal types is introduced in definition 9.1.23. Roughly speaking, the principal type of a combinator is the generator of a principal cone in the set of wff’s when substitution is viewed as an ordering. 9 To be more precise, no purely implicational wff should get attached to M . See section 9.2 for types with further constants.


146


{ B }s . By the definition of condensed detachment, there is a substitution σ1 such that σ1 (C1 ) = σ1 (D) , and E is σ1 (C2 ) . Now, if there are substitution instances of A and B that permit a “successful” application of the condensed detachment rule, then condensed detachment is successful on A and B themselves. The A is A1 → A2 and σ0 (A1 → A2 ) = C1 → C2 . If D(A, B) = F , then σ2 (A1 ) = σ2 (B) and σ2 (A2 ) = F . σ2 (A1 ) is the mgci of A1 and B ; therefore, σ1 (C1 ) is a substitution instance of σ2 (A1 ) . Similarly, σ1 (D) is a substitution instance of σ2 (B) . If σ3 (σ2 (A1 )) = σ1 (C1 ) , then σ3 (σ2 (A2 )) = σ1 (C2 ) , which means that E = σ3 (F) . qed The situation in the proof may be depicted as follows. D(A1 → A2 , B) =

D(C1 → C2 , D) =

σ

F ←−−2−−   σ3 y

A2  σ y 0

E ←−−−− C2 σ1

Exercise 6.2.8. The above proof depends on the fact that the substitutions compose

into substitutions. Prove this claim. (Hint: Substitutions are total functions on the set of propositional variables.) D EFINITION 6.2.21. The fool’s model for CL is MF = hT, ⊆, ·i , where T = { { A }s : A is a wff } ∪ { 0/ } , ⊆ is set inclusion and · is condensed detachment on sets of formulas. An interpretation I is a function from the set of CL-terms into T such that the interpretation of a combinator Z is { pt(Z) }s . This model is not as abstract as a combinatorial reduction algebra where the elements and the operation are not circumscribed beyond the requirement that they satisfy (1)–(4). By the notation T , we intend to allude to “types;” pt(Z) (if exists) is a concrete formula and the · operation is also quite concrete. L EMMA 6.2.22. MF is a combinatorial reduction algebra. Proof: 1. hT, ⊆i is obviously a partially ordered set. We have to verify that · is a total operation. Totality is unproblematic, because 0/ is included into T . Lemma 6.2.20 provides that a successful condensed detachment between elements of T is an element of T . 2. We will look at clause (2) now. Let us assume that a and b are { A }s and { B }s , respectively. K is interpreted as { p → q → p }s . We may assume that A does not contain p or q , and so by lemma 6.2.20, the result of condensed detachment gives the interpretation of K · a to be { q → A }s . A similar reasoning leads us to conclude that K · a · b is { A }s , that is, (2) holds. If either a or b is interpreted as 0/ , then the interpretation of K · a · b is 0/ too, and 0/ ⊆ X , for any X ∈ T . (We leave the rest of the proof as an exercise.) qed Exercise 6.2.9. Complete the previous proof. In other words, show that (1) and (3)–

(4) from definition 6.2.8 hold in MF . (Hint: (3) and (4) are nearly obvious.)


Chapter 6.

Models

147

Step 2 in the above proof provides a clear indication of why the above model cannot be modified to yield a combinatory algebra in the sense of definition 6.2.1. The prototypical example of a pair of formulas such that the second cannot be unified with the antecedent of the first is h(p → p → q) → p → q, r → ri . This means that the same phenomenon occurs on sets of formulas — with the difference that condensed detachment is turned into a total operation on sets of implicational formulas, by the inclusion of 0/ into T . 0/ is the bottom element in T , that is, 0/ ⊆ X , for all elements of T . The addition of the bottom element to T helps to make · a total operation on T . However, at the same time, the addition of the bottom element allows us to raise the question whether the operation is normal in the presence of the bottom element. The answer is that the operation · is normal, that is, X · 0/ = 0/ = 0/ · X . This is not really a surprise, because the operation on sets is defined by an existentially quantified formula involving condensed detachment on formula, which is known not to be a total operation (in view of the example we just mentioned). The somewhat unfortunate consequence of normality is that K · a · b ≥ a cannot be guaranteed in this model. If b happens to be interpreted by 0/ , then we get 0/ on the left-hand side of the inequation. But a ’s interpretation in no way depends on b ’s interpretation, that is, the set on the right-hand side of the ≥ need not be empty. L EMMA 6.2.23. There is a fool’s model for CL with a basis B that comprises proper combinators without a cancellator, when each Zi ∈ B has a principal type associated to it. Proof: Let B be { Z1 , . . . , Zn } , with pt(Z1 ), . . . , pt(Zn ) being the associated implicational formulas. MF = hT ; · i with the interpretation function I such that I(Zi ) = { pt(Zi ) }s is a model of CL with basis B . The construction is clearly not a combinatory algebra, not even a combinatorial reduction algebra. Because of the stipulation that there are no cancellators in B , K , for example, is neither an element of B nor definable from B . However, we have the following for any interpretation function. If Zm i x1 . . . xm B M , then I(Zi x1 . . . xm ) = I(M) . The lack of combinatorial completeness precludes these MF ’s from satisfying condition (2) in definition 6.2.1, and (1) may not hold either depending on the concrete B . However, for each B we could define a suitably modified notion of a combinatory algebra with a restricted set of distinguished elements and corresponding equations involving them. The assumption that the implicational formula associated to Zi is the principal type of the combinator ensures that I(Zi ) · I(x1 ) · . . . · I(xm ) = I(M) whenever the I(x j )’s are not empty.10 We have to scrutinize what happens if some of the I(x j )’s are empty. Let I(xl ) = 0/ , for instance. Then I(Zi ) · I(x1 ) · . . . · I(xl ) = 0/ , hence all further applications of · 10 In

chapter 9, we discuss principal types in detail, and we also show that there is a close connection between the E → rule and condensed detachment. Here we take it for granted that the principal type of a combinator ensures this equation when the condensed detachment on formulas is successful.


148


result in 0/ . On the other hand, xl occurs in M , because Zi is not a cancellator. Let xl N be a subterm of M . (The case when Nxl is a subterm of M is similar.) Then I(xl )·I(N) = 0/ , and if there are further applications of · , then those yield 0/ too. That is, I(M) = 0/ . It may be somewhat uninteresting that the result is 0/ , but 0/ results on both sides, which is sufficient for the equality to hold. qed The “fool’s model” interprets CL without types, though the types figure into the interpretation itself. Just as not all combinators are typable with simple types, as we will see in detail in section 9.1, not all combinators are interpreted here by a nonempty set of types. Typability of all CL-terms may be achieved by adding conjunction and constant truth as type constructors, and then the model can be turned into a model of =w . We return to models involving types in section 6.5.

6.3

Encoding functions by numbers

Abstract mathematical structures such as abstract algebras are excellent interpretations of CL — whether with =w or Bw . However, it may be desirable to have more concrete interpretations for CL, which is, after all, one of the general theories of functions. Chapter 3 has shown how to use various combinators to represent functions such as the constant zero function, projections, successor, and further on, addition, multiplication, etc. Theoretically speaking, it might not be completely definite what natural numbers are, but practically, we all seem to be very comfortable to deal with natural numbers. They are wholesome, some of them are triangular or square numbers, and some of them are even perfect. Therefore, it is especially pleasing that CL can be interpreted using natural numbers — with just a bit of structure added. The set of subsets of the set of natural numbers is often denoted by P (N) or by P (ω) .11 The model of CL, that we present in this section, is derivatively denoted by P ω or Pω , and called the graph model. As any power set of some set, P (N) is a Boolean algebra, hence a lattice, moreover a complete lattice.12 This suggests — in the light of the next section — that P (N) may be a suitable set to define a model on. The power set of N contains many ( 2ℵ0 -many, to be precise) sets, but all they can be easily categorized into two types of sets: finite and infinite. Not only infinite sets are “much bigger” than finite sets — they contain infinitely many more elements — but P (N) itself is too large to be matched with the set of all finite subsets of N . The next definition places a topology on N . For the sake of completeness, we included the definition of a topology into section A.6. 11 ω

is an alternative notation for N , which may imply that the set of natural numbers is taken with its usual order ≤ as a poset, or with < as an ordinal. 12 For definitions of these concepts, see section A.6.


Chapter 6.

Models

149

D EFINITION 6.3.1. (S COTT TOPOLOGY ON N ) Let the set of open sets be denoted by OS , which is defined by the basis comprising the set of increasing sets generated by a finite subset of N . Clauses (1) and (2) together define OS . (1) s↑ = { X ⊆ N : s ⊆ X } is an increasing set that is generated by a finite subset, whenever s is finite. (2) OS = τ({ s↑ : s ∈ P (N) ∧ s is finite }) . The idea behind choosing the finite subsets of N as the elements generating the cones of subsets of N is that a finite subset represents some finite amount of positive information. The basis has cardinality ℵ0 , because there are only so many finite subsets of N . Finite subsets also allow an alternative characterization of continuity. D EFINITION 6.3.2. (C ONTINUITY ) f is continuous whenever f (X) =

Let f be a function of type P (N) −→ P (N) .

[

{ f (s) : s ⊆ X ∧ s is finite }.

The value of a continuous function (in the just defined sense) is completely determined by the values the function takes on finite sets that are subsets of its argument. Roughly speaking, this means that with continuous functions there is no need to worry about infinite subsets of N in calculations. In the context of topologies, which contain open and closed sets, functions that ensure that the inverse image of an open set is open are of particular interest. These functions are called continuous, and it is remarkable that the functions that are continuous according the above definition are continuous, and vice versa. (See definition A.6.9 and theorem A.6.10.) Exercise 6.3.1. Prove the claim, that is, theorem A.6.10.

The finite subsets of N can be enumerated, and the particular enumeration chosen is crucial to the whole composition of the model. For the workings of the model, the enumeration of the finite subsets of N should be in harmony with the enumeration of ordered pairs over the natural numbers. D EFINITION 6.3.3. (E NUMERATION OF N × N ) Consider the natural numbers placed on points with integer coordinates in the top-right quadrant of the coordinate system as illustrated below. There is an obvious 1–1 correspondence between the sets N and N × N , which is the enumeration of ordered pairs of natural numbers that we use. We picture only the hx, yi points with both coordinates nonnegative. The pairs in the leftmost column and in the bottom row are to be thought to be on the y - and x -axes, respectively. (We omit the lines that would represent the axes.)


150


35 27 20 14 9 5 2 0

34 26 33 19 25 32 13 18 24 8 12 17 4 7 11 1 3 6

31 23 16 10

30 22 15

29 21

28 . . .

The informal idea is to fill the quadrant with natural numbers via filling in the short diagonals bottom up. The ordered pairs are the pairs of hx, yi coordinates and they may be thought of as a function. Example 6.3.4. The illustration above makes it easy to see the value of some of the ordered pairs with small numbers: h5, 0i = 15 and h2, 4i = 25 . However, we might want to be able to have a more efficient way to calculate, let us say, h7, 11i than to draw a big picture of the coordinate system and fill in sufficiently many short diagonals.13 The following formula is another way to calculate the value of a pair. (x + y)(x + y + 1) +y 2 Exercise 6.3.2. Verify for a couple of pairs from the above illustration that the formula

gives the correct numbers. What is h7, 11i ? Exercise∗ 6.3.3. Prove that the formula is a function and gives the number obtainable

by successively filling the short diagonals. (Hint: The length of the short diagonals is 1 , 2 , 3, . . . and the sum of the natural numbers up to n is 21 n(n + 1) .) The possibility to enumerate the pairs should not be surprising, though the elegance of this particular enumeration may be flattering. An important difference of this enumeration from the enumeration of the positive rational numbers, which we gave earlier, is that now we have an invertible function.14 In other words, h , i is an injective function. Exercise 6.3.4. Describe an algorithm that for any natural number n , gives a pair

hx, yi , where x and y are the coordinates of the number n . The finite subsets of N may be enumerated in various ways. The enumeration that we need will be calculated through the binary representation of numbers and using the identity function as an enumeration of N . 13 Drawing

a big chart might not feel like computation, but it is an effective procedure, and it is a suitable method to determine the value of the h , i function. In sum, it is computation. 14 A sample enumeration of the positive rational numbers may be found in section 3.1. Although the idea behind the enumeration there is to fill in short diagonals, we did not aim at a bijection, and every positive rational occurs ℵ0 -many times in that whole enumeration.


Chapter 6.

Models

151

Recall that the difference between the decimal and the binary representation of numbers is mainly what the places stand for: 10110 can be expanded as 1 · 102 + 0 · 101 + 1 · 100 , whereas 1012 is 1 · 22 + 0 · 21 + 1 · 20 . To put it differently, in the decimal notation the places indicate (from right to left) 1, 10, 100, 1000, . . . , similarly, in the binary notation they stand for 1, 2, 4, 8, 16, . . . . Of course, the decimal notation needs and permits more symbols too, because 2, 3, . . . , 9 are all less than 10 , whereas in binary notation only 0 and 1 are less than 2 . The natural numbers written in binary notation are just (finite) nonempty strings over the alphabet { 0, 1 } . The identity enumeration of natural numbers is the same as the lexicographic ordering of all the binary strings that begin with 1 . Example 6.3.5. Let us consider the numbers 7, 8, 9, 10 and 11 . In binary notation these are the strings 111 , 1000 , 1001 , 1010 and 1011 . 72 comprises only 1’s, however, shorter than any of the four other strings (i.e., 111 is only three symbols, whereas the others contain four symbols). 92 precedes 102 , because in the former the second 1 from the left is the rightmost symbol unlike in 102 . (Of course, we assume that the alphabet { 0, 1 } itself comes with the ordering 0 ≤ 1 .) Every binary string can be thought of as a characteristic function of a set. To turn each finite sequence of 0 ’s and 1’s into a characteristic function of a set, we can consider each string prefixed with a denumerable sequence of 0 ’s. Now, we apply these functions defined on N — with the symbol at the end of the sequence (i.e., the rightmost symbol) being the first argument. Each padded string gives a finite subset of N . Example 6.3.6. 010 looks the same as 02 : 0 . The infinite binary sequence corresponding to 02 is . . . 00000000000000000000000000000, which means that the finite set s0 has no elements, that is, s0 = 0/ . A slightly more interesting example is 2610 = 110102 , which produces the sequence . . . 00000000000000000000000011010, which, in turn, means the 0 ∈ / s26 , neither are 2 or numbers strictly greater than 4 elements of s26 . Thus s26 = { 1, 3, 4 } . The enumeration of the finite subsets may be pictured in a coordinate system too. The first 36 finite subsets are listed below. { 0, 1, 5 } { 0, 1, 3, 4 } { 1, 5 } { 2, 4 } { 1, 3, 4 } { 0, 5 } { 1, 2, 3 } { 0, 1, 4 } { 0, 3, 4 } {5} { 0, 3 } { 0, 2, 3 } { 1, 4 } { 3, 4 } { 0, 1, 2, 3, 4 } { 0, 2 } {3} { 2, 3 } { 0, 4 } { 0, 1, 2, 3 } { 1, 2, 3, 4 } {1} {2} { 0, 1, 2 } { 0, 1, 3 } {4} { 1, 2, 4 } { 0, 2, 3, 4 } 0/ {0} { 0, 1 } { 1, 2 } { 1, 3 } { 0, 1, 2, 3 } { 0, 2, 4 } { 2, 3, 4 }


152


In the case of models that are constructed from terms, we do not have to worry about having a term of the form xx — at least once we have gotten accustomed to seeing such CL-terms. Similarly, there is no reason why a term a · a in an abstract algebra should raise eyebrows. However, if we want to define a function to represent application with P (N) as its domain, then somehow the definition should be flexible to capture self-application too. If we simply look at a function in a set-theoretic sense, then it is a set of ordered tuples, which is never applicable to itself. Of course, every number may be seen as an ordered pair (even as an ordered n tuple), and as a finite subset of natural numbers. The maps between the various data types are 1–1 correspondences, that is, they are total onto invertible functions, which means that one can pick which set of objects to take. Choosing one or the other set invites us — due to our familiarity with numbers and sets — to affix to them the operations, which are most frequently used with those kinds of objects: + , / or ∩ , ∪ , etc. Sets comprising different kinds of objects are completely exchangeable when the operations (or even the relations) on one of them have analogues on the other, that is, there is an isomorphism between the sets. The latter means that from a certain point of view there is no way to distinguish between those sets despite the fact that from some other angle the objects and operations differ. Part of representation theory and duality theorems concern finding 1–1 maps between sets of objects and between sets of operations on those objects. To model CL, we have to find sets — certain subsets of N — to represent combinators, and to define an operation that behaves like the application operation in CL. D EFINITION 6.3.7. ( f FROM A SUBSET )

Let X ⊆ N . f(X) is of type P (N) −→

P (N) , and for any Y ⊆ N , gives f(X)(Y ) = { m : ∃sn . sn ⊆ Y ∧ hn, mi ∈ X }, where sn is a finite subset of N . f is an operation on subsets of N , which turns the subset X into a function. The role of the finite subsets is to ensure that f is a continuous function. L EMMA 6.3.8. The function f : P (N) −→ (P (N) −→ P (N)) is continuous. S

Proof: Let us assume that X ⊆ N , and X = i∈I Xi for some index set I . By the definition of f , for any Y ⊆ N , f(X)(Y ) = { m : ∃sn . sn ⊆ Y ∧ hn, mi ∈ X } . The usual definition of ∪ , and the assumption about the Xi ’s gives that the latter set equals to S S . sn ⊆ Y ∧hn, mi ∈ Xi } . The expression after i∈I defines f(Xi )(Y ) , that i∈I { m : ∃snS S is, we have i∈I f(Xi )(Y ) . Therefore, f(X) = i∈I f(Xi ) , which means — according to definition 6.3.2 — that f is continuous, as we intended to show. qed The possibility to consider a set of natural numbers as a function hints at the idea of using f itself as the representation for application. D EFINITION 6.3.9. Let X and Y be subsets of N . The application of X to Y is f(X)(Y ) .


Chapter 6.

Models

153

Given the above definition, we can think of interpreting terms as sets of natural numbers. However, just as combinators are special CL-terms, so should be the sets that represent them. We start with the identity combinator I , which has as its axiom Ix B x . Example 6.3.10. The variable x can be interpreted as any subset of N — including 0/ and N itself. I 0/ = 0/ . The only subset of 0/ is 0/ , and this is s0 . Then from / , we get that m ∈ 0/ iff s0 ⊆ 0/ ∧ h0, mi ∈ I . Of course, m ∈ the definition of f(I)(0) 0/ is always false, hence no number, which looks like in its ordered pair form as h0, mi can be an element of I . If we look back at the small initial fragment of the enumeration of the natural numbers in the coordinate system, then we see that 0, 2, 5, 9, 14, 20, 27, 35 ∈ / I . (There are infinitely many more natural numbers that are not elements of I , but we did not picture those.) If we exclude the leftmost column of natural numbers from I , then we may or may not have the right set for I . Perhaps, h1, 1i ∈ / I either. Exercise 6.3.5. Find an X ⊆ N that can be used to show (via calculating f(I)(X) ) that

h1, 1i ∈ / I. To discover a more complete description of the set of numbers that belong to I , let us consider that f(I)(Y ) should be Y , for any Y ⊆ N . Then we have that m ∈ Y iff ∃sn . sn ⊆ Y ∧ hn, mi ∈ I . For each Y , 0/ ⊆ Y , for each m ∈ Y , { m } ⊆ Y and Y ⊆ Y — possibly, with other subsets of Y in between. (Of course, Y may not be an sn .) If sn ⊆ Y , then for all m ∈ sn , m ∈ Y , hence it should be that hn, mi ∈ I . Y = N is a possibility, and then for all n , sn ⊆ Y . Then, from the previous consideration, we get that I = { hn, mi : m ∈ sn }. We could have thought that I should be the diagonal starting with h0, 0i , or perhaps, with a slight shift from h0, 0i . An initial segment of I contains the following pairs: h1, 0i , h2, 1i , h3, 0i , h3, 1i , h4, 2i , h5, 0i , h5, 2i , h6, 1i , h6, 2i , h7, 0i , h7, 1i , h7, 2i , h8, 3i , h9, 0i and h9, 3i . The corresponding numbers are not in increasing order, which is a consequence of the set of all finite subsets of N forming a poset that is not linearly ordered, whereas N is linearly ordered by its natural ordering. However, we can consider the same subset of I with the elements listed as { 1, 6, 7, 11, 15, 23, 28, 29, 30, 37, 38, 45, 47, 69, 81 } . From the definition of I above, it is clear that I is an infinite set of numbers, thus the listed elements constitute only a small subset of I . The other combinators are also subsets of the set of natural numbers. Let us consider K . It should be interpreted by a set of natural numbers so that applied to any X,Y ∈ P (N) , the result is X . If f(K)(X) is applied to Y , then, by the definition of f , we get that the result is { m : ∃sn . sn ⊆ Y ∧hn, mi ∈ f(K)(X) } . But m ∈ f(f(K)(X))(Y ) iff m ∈ X , which suggests that f(K)(X) should contain all pairs of the form hn, mi where m ∈ X , because Y , hence the sn ’s are arbitrary. Now some of our visual expectations are vindicated: K · X looks like a collection of constant functions; for each m ∈ X , a constant function taking the value m .


154


This gives an informal description of f(K)(X) , but we would like to get to the numbers that are in K . Although the pairs correspond to natural numbers, it is easier to keep them in their pair form for now. f(K)(X) = { j : ∃si . si ⊆ X ∧ hi, ji ∈ K } . We know that the j ’s are hn, mi’s with m ∈ X . Again X need not be finite, but if it were, then we would get that K contains hi, hn, mi i iff m ∈ si . But for any set we can look at its finite subsets, thus we get that K = { hi, hn, mi i : m ∈ si ∧ n ∈ N }. K is a cancellator, which is reflected by the “unrestricted” n .

Example 6.3.11. Let X be { 2 } = s4 — for a simple example. 2 ∈ s4 , therefore, h4, hn, 2i i ∈ K , for any n . Let us also assume that Y = { 0, 3 } = s9 . The two subsets of s4 are 0/ and { 2 } , that is, s0 and s4 . (Since the empty set has no elements, K ’s definition excludes all the pairs of the form h0, ji .) f(K)(s4 ) = { hn, 2i : n ∈ N } . The subsets of Y are s0 , s1 , s8 and s9 , which select four pairs from f(K)(s4 ) : h0, 2i , h1, 2i , h8, 2i and h9, 2i . Then 2 ∈ K · X ·Y ; indeed, 2 is the only element of this set. This simple example illustrates how a set of numbers can stand for K . The triples that are elements of K can be viewed as natural numbers. For instance, 1, 4, 13 and 34 are elements of K . Exercise 6.3.6. Find a handful of other numbers that are elements of K . (Hint: The

numbers may get large quickly depending on i and n .) Giving a description of a set of numbers that represent I is, probably, the easiest, and K is not difficult either. The above examples and the definitions of the corresponding sets also provide hints as to the shape of these sets. Exercise 6.3.7. Find some numbers that belong to S , then define the set that represents S in this model.

Once we have at least K and S , we have a model of CL. D EFINITION 6.3.12. An interpretation of CL is a function I such that (1)–(3) holds. (1) I(x) ⊆ N ; (2) I(K) = K and I(S) = S ; (3) I(MN) = f(I(M))(I(N)) . L EMMA 6.3.13. If M Bw N in CL, then I(M) ⊆ I(N) , for all interpretations I . Proof: The interpretation of Bw by ⊆ guarantees that the reflexivity and transitivity of Bw holds. The combinatory axioms hold, because of the choice of the sets of numbers that represent them. The only remaining step is to ensure that I(M) ⊆ I(N) implies I(MP) ⊆ I(NP) as well as I(PM) ⊆ I(PN) . Let us assume that I(M) ⊆ I(N) , and I(P) = Y . By the definition of f , I(MP) = { m : ∃sn . sn ⊆ Y ∧ hn, mi ∈ I(M) } . If m ∈ I(MP) , then — assuming sn ⊆ Y —


Chapter 6.

Models

155

hn, mi ∈ I(M) , hence hn, mi ∈ I(N) and m ∈ I(NP) . sn ⊆ Y is a common expression in I(MP) and I(NP) ; therefore, this reasoning may be repeated for any m ∈ I(MP) . (For the last step of the proof, see the next exercise.) qed Exercise 6.3.8. Finish the proof, that is, verify that I(M) ⊆ I(N) implies I(PM) ⊆

I(PN) . (Hint: Notice that there is an “asymmetry” in the definition of f , which means that this case slightly differs from I(MP) ⊆ I(NP) .) The application operation f takes pairs of natural numbers in the first argument and depending on the second argument returns the second element of the pair. Although there is a 1–1 correspondence between the natural numbers and ordered pairs of them, the second coordinate is certainly not in 1–1 correspondence with the natural numbers. Exercise 6.3.9. Show — using finite subsets of N — that X * Y does not imply that

XZ * Y Z for all Z . Show that ZX * ZY does not follow either. The model also can be taken to model weak equality. L EMMA 6.3.14. If M =w N in CL , then I(M) = I(N) for all interpretation functions I . Proof: Some of the steps are very much like the steps in the proof for Bw , and so we skip them. Let us assume that M =w N . By the hypothesis of induction, I(M) = I(N) . Further, let P be a CL-term that is interpreted by Y , that is, I(P) = Y . Then f(Y )(I(M)) = { m : ∃sn . sn ⊆ I(M) ∧ hn, mi ∈ Y } . I(M) = I(N) obviously implies that for all sn that is a finite subset of N , sn ⊆ I(M) iff sn ⊆ I(N) . Hence { m : ∃sn . sn ⊆ I(M)∧hn, mi ∈ Y } = { m : ∃sn . sn ⊆ I(N)∧hn, mi ∈ Y } , and so I(PM) = I(PN) . (The rest of the proof is easy and left as an exercise.) qed Exercise 6.3.10. Think about all the steps of the preceding proof. What did we omit?

Give all the details of the omitted steps. Exercise 6.3.11. Consider two subsets of N , let us say, X and Y . Show that there are sets P and Q such that f(P)(X) = f(P)(Y ) and f(Q)(X) = f(Q)(Y ) .

The model we outlined in this section is not the only model of CL that can be constructed from natural numbers and finite sets of natural numbers. The enumerations may be thought of as encodings, and it has been shown that such enumerations come in tandem, that is, they cannot be randomly paired. Also this particular encoding is not unique, though it may be the most often presented in the literature.

6.4

Domains

We often think of functions as operations on some set of numbers. The previous section showed that sets of natural numbers may be viewed as functions via viewing


156


each number as a pair of natural numbers as well as a finite set of natural numbers. The set-theoretical understanding of functions is that they are sets of ordered tuples. Obviously, an ordered pair is never identical to either of its elements, because they are different types of objects. On the other hand, 1–1 correspondences and isomorphisms can work magic: one set of objects can stand in for another, and the other way around. The concreteness of natural numbers meant that it was relatively straightforward to find or define suitable 1–1 correspondences. However, if we want to consider sets that might contain elements other that numbers, then correspondences have to be provided in a different way. Domain theory, as it became called later, started with Scott’s work in the late 1960s (see Scott []).15 Some of the ideas behind this theory are similar to the ideas that appeared in the P ω model. For example, finite amounts of information and continuous functions play a crucial role. D EFINITION 6.4.1. (D IRECTED SUBSETS ) Let hD, vi be a poset (i.e., a set with a partial order v ). X ⊆ D is a directed subset of D iff X 6= 0/ and for all x1 , x2 ∈ X , there is a y ∈ X such that x1 v y and x2 v y . The set of directed subsets of D is denoted by P (D)Z . A directed set contains an upper bound for any pair of its elements. For instance, all finite subsets of N are bounded because the largest number in the set is an upper bound for all the elements (because N is totally ordered). Example 6.4.2. Let us utilize the enumeration of finite subsets from the previous section. The set { s1 , s2 , s3 , s4 } is not a directed set (with the partial order ⊆ ), because s3 = { 0, 1 } and s4 = { 2 } are not subsets of each other or of the other elements. The pairs hs1 , s2 i , hs1 , s3 i and hs2 , s3 i have upper bounds in the set, but pairs with s4 in it, do not. The situation could be remedied by throwing in the set s7 (or one of the infinitely many other sets sn , for which s7 ⊆ sn , like s23 ). Completeness has several meanings and usages. The next notion of completeness is closely related to the algebraic notion. D EFINITION 6.4.3. (CPOS ) Let hD, vi be a poset. D is a complete partial order, a CPO, when (1) and (2) are true. (1) There is a ⊥ ∈ D such that for all d ∈ D , ⊥ v d . (2) If X ∈ P (D)Z , then there is an x ∈ D such that lub(X) = x , that is, x is the least upper bound of X in D . It might seem that we are unfamiliar with CPOs, and some of them are indeed not exactly commonly used sets. 15 The

term “domain” is used for a set of objects that can be arguments of a function. Here this term is used not just to denote a set of objects, but also a certain structure on that set.


Chapter 6.

157

Models

Example 6.4.4. The set N is not a CPO with the usual ≤ ordering. The reason is that all subsets of N are directed subsets, but no infinite subset of N has an upper bound. Consider N itself or the set E of odd numbers. Neither N nor E has an upper bound. However, the linear ordering of N ensures that n ≤ m or m ≤ n for all n and m , thus n or m is an upper bound of hn, mi . Every infinite subset of natural numbers is unbounded, because the natural numbers are discretely ordered. Thus there is plenty of sets ( 2ℵ0 -many), which are directed but fail to have an upper bound, let alone a least upper bound. The example pinpoints the “problem” with N . It is easy to turn the set upside down, that is, we can take hN, ≥i . Then every subset contains an upper bound, and the upper bound is — again due to the linear ordering — the least one in N . This structure is still not a CPO though. Now the missing component is the bottom element. We can easily add ω with the stipulation that for all n ∈ N , n ≤ ω (and ω ≤ ω too). Under the converse of ≤ , ω becomes the bottom element. Adding an extra element into a set in order to obtain a set bounded from below (or from above) is a frequently used trick — not only in the construction of a CPO. Exercise 6.4.1. Check that adding ω does the trick by itself. That is, verify that hN ∪ { ω }, ≤i is a CPO.

0 •

1 •

3

2 •

•

...

n •

..... . .. .. .... ..... ........ .. ...... .. .... .. ........ .. ..... ..... .. ....... .. .. ..... ... .. . . . . . . ... ..... ..... .. . ...... .... .... . .. ....... ..... ... .. .. ....... .. . ............. ................ .

...

N⊥

T

•

•

... ... ... ... .. .. ... .. . ... . ... ... ... ..... ... ... ..... .

•

⊥

F

•

2⊥

⊥

The natural numbers may be viewed with a little amendment as a CPO in a different way. Example 6.4.5. The set N ∪ { ⊥ } with x v y iff x = ⊥ or x = y is a CPO. The set N⊥ and its partial order are depicted above (on the left). Notice that the usual ≤ ordering is dropped now. Another CPO that is constructed from a familiar structure in the same way is h{ T, F, ⊥ }, vi . The capital letters T and F stand for the two (classical) truth values “true” and “false,” and ⊥ is an extra element added. This CPO is depicted above (on the right). Notice that the usual ordering F ≤ T , (or 0 ≤ 1 in 2 , the two element Boolean algebra) is omitted. In this CPO, the partial ordering can be interpreted as an information ordering, and then ⊥ indicates the lack of information. Recall that we said that the completeness here is related to the algebraic notion of completeness. The power set of any set is a lattice with ∩ and ∪ (intersection and union) being the meet and join. Moreover, P (X) is always a complete lattice,


158


because intersections and unions of infinitely many sets exist in P (X) . The partial order is ⊆ , and since P (X) is a lattice, another way to look at ∪ and ∩ as lub and glb (greatest lower bound). Power sets include a least element 0/ , which can be taken to be ⊥ . CPOs will be the sets of objects into which the objects of CL are interpreted. The objects of CL operate on each other, thus merely having a set of objects will not be sufficient as a model of CL. D EFINITION 6.4.6. (M ONOTONE AND CONTINUOUS FUNCTIONS ) Let hC, vi and hD, vi be CPOs. A function f of type f : C −→ D is monotone iff c1 v c2 implies f (c1 ) v f (c2 ) . Let f be a monotone function from hC, vi into hD, vi . f is continuous iff for all X ∈ P (C)Z , f (lub X) = lub f [X] , where f [X] is the image of the set X with respect to the function f . We had definition 6.3.2 in the previous section that concerned continuity of a function on subsets of natural numbers. P (N) is a CPO, and so we might wonder whether there is a connection between the two definitions, or even the previous definition is a special instance of the new one. L EMMA 6.4.7. Let f be a function from the CPO hP (N), ⊆i into hP (N), ⊆i . f is continuous in the sense of definition 6.3.2 just in case it is continuous in the sense of definition 6.4.6. Proof: We prove the “if and only if” statement in two steps. 1. From left to right, we start with showing that f is monotone if it is continuous according to definition 6.3.2. Let X ⊆ Y . For any finite subset sn , if sn ⊆ X , then sn ⊆ Y . Thus if f (sn ) ∈ f (X) , then f (sn ) ∈ f (Y ) . By the definition of ∪ , then f (X) ⊆ f (Y ) , as we had to show. Beyond monotonicity f has to commute with lub on directed sets. Let then X be a directed set of subsets of N . X is directed and lub(X) exists in P (N) , which is a CPO. We denote lub(X) by Y ; Y ∈ X . We may assume that X comprises some Xi ’s: X = { Xi : i ∈ I } , where I is an index set. From the stipulation that Y is least upper bound follows that Xi ⊆ Y , for each i . Then f (Xi ) ⊆ f (Y ) by monotonicity, which ensures that lub f [X] ⊆ f (Y ) . If the converse inclusion fails to hold, then f (Y ) ( lub f [X] , which means, by the definition of union (that is the lub on P (N) ), that for some Xi , f (Xi ) * f (Y ) , but that is not the case. Thus f (Y ) = lub f [X] . 2. From right to left, we assume that f is continuous in the sense of definition 6.4.6. Let X ⊆ N . We consider a directed set X , namely, X = { sn : sn ⊆ X } . lub(X) = X , thus f (X) = lub f [X] . Because of the shape of X , this implies that S f (X) = { f (sn ) : sn ⊆ X } , as we intended to prove. qed Having established a connection with the previous model, we proceed with the more general structures. Not all CPOs are isomorphic to P (N) , thus from now on we mean continuity in the sense of definition 6.4.6. In order to boost our understanding of continuous functions on CPOs, we look at some examples.


Chapter 6.

159

Models

Example 6.4.8. Let C be 4 (see below), which is a CPO, and let D be an arbitrary CPO.16 All the monotone functions from C into D are continuous. Notice that if C is finite, then every directed set X contains its own lub . Thus, f [lub(X)] = f (x) for some x ∈ X . Then it is obvious that the monotonicity of f implies that f (x) = lub( f [X]) . 1

a

..•... ... ..... ... ... .... ... .... . ... . ... ... ... ... . . ... ... . •.... ..• ... ... . . . ... ... . ... . . ... .... .... ... ... ... ... ..... . ..

b

•

4

0

Example 6.4.9. We have seen above N (without its usual ordering ≤ ) supplanted with a ⊥ . Let D be again an arbitrary CPO. All monotone functions from N⊥ into D are continuous. There are many directed sets on N⊥ , but the variation in their shape is very limited. A directed subset of N⊥ contains either one element, or two elements where one of the elements is ⊥ . Then continuity is obvious. The next example shows that monotonicity, in general, is not sufficient to guarantee that the function is continuous. Example 6.4.10. In example 6.4.1, we mentioned that topping N with an element, for instance, ω , creates a structure, which is a CPO. However, there are functions from N ∪ { ω } into a CPO D that are monotone but not continuous. For the sake of concreteness, let us take 2 , which a complete lattice, hence a CPO, in place of D . Let f be defined so that it separates the natural numbers from ω , that is, f (n) = 0 for each n ∈ N , whereas f (ω) = 1 . The set of even numbers E is directed, and f (lub(E)) = f (ω) = 1 . On the other hand, lub( f [E]) = lub{ 0 } = 0 . Monotonicity is sufficient for continuity if there are no ascending chains — like N itself — in the CPO. Exercise∗ 6.4.2. Prove the last statement. (Hint: An ascending chain is a directed set, which has to have a lub in the whole carrier set of the CPO.)

Lastly, there is a way to construct a CPO with a continuous function from any poset with a function. Example 6.4.11. Let hC, vi be a poset, and let f be of type f : C −→ D , where D is a set. P (C) as well as P (D) are CPOs, and there is a natural way to lift f into the 16 4

is a well-known distributive lattice that can be turned into a Boolean algebra or a De Morgan lattice depending on whether it is complemented by an order-inverting operation.


160


power sets. For X ⊆ C , let the function F be defined as F(X) = { f (c) : c ∈ X }. In other words, F(X) is Sf [X] . F is easily seen to be monotone. FSis also conS tinuous, because lub is on power sets. Obviously, F( X ) = i∈I i i∈I F(Xi ) = S F[Xi∈I ] . So far we looked at sets with an order and functions from or into those sets. To create structures, in which correspondences between sets and functions on those sets can be found, we need a partial order on functions too. D EFINITION 6.4.12. (O RDERING OF FUNCTIONS ) from the CPO hC, vi into the CPO hD, vi . f vg

iff

Let f and g be functions

∀x ∈ C. f (x) v g(x).

We have already used v without indices as the partial order of several CPOs, and now we added yet another use. Context determines uniquely which order is meant. L EMMA 6.4.13. The set of all continuous functions between a pair of CPOs is a CPO. Proof: 1. f (x) v f (x) always holds, which means that v on functions is reflexive. Transitivity and antisymmetry can be established similarly from those properties for v on D together with the observation that the defining clause is universally quantified. 2. There is a function ⊥ such that ⊥(c) = ⊥ . This function is obviously continuous, and ⊥ v d for all d ’s in D . 3. Let us suppose that F = { fi : i ∈ I } is a directed set of continuous functions. We define g to be lub(F) as follows. For all x ∈ C , g(c) = lub{ fi (c) : i ∈ I } . fi v g is immediate. Let a distinct function g0 be a purported “real” least upper bound of F. Then g0 v g but not the other way around. Therefore, there is a c ∈ C such that g0 (c) v g(c) , but not g(c) v g0 (c) . Then there is a fi such that fi 6v g0 , which contradicts to g0 ’s being an upper bound of F. We also have to prove that the function g is continuous. Let X ⊆ C and X ∈ P (C)Z . lub(X) exists in C , let us say, it is x . We have to show that g(x) = lub(g[X]) . g(x) = lubi∈I { fi (x) } . Each fi is continuous by our assumption about F, hence fi (x) = lub fi [X] , that is, fi (x) = lub j∈J fi (x j ) , where J is the index set for X. Then we have g(x) = lubi∈I lub j∈J fi (x j ) , which is the same as lub j∈J lubi∈I fi (x j ) . However, lubi∈I fi (x j ) = g(x j ) , thus g(x) = lub j∈J g(x j ) . The latter is merely another way of writing lub(g[X]) , which means that g is continuous, as we wanted to prove. qed In chapter 3, we saw that CL has the expressive power of computable functions, and one way to solve recursive equations is to apply the fixed point combinator. Theorem 2.3.1 is a fixed point theorem for monotone functions on complete lattices. The analogous theorem for CPOs is the following.


Chapter 6.

Models

161

L EMMA 6.4.14. (F IXED POINTS IN CPOS ) Let f be a continuous function from the CPO hD, vi into itself. f has a least fixed point d f in D , that is, (1) f (d f ) = d f ,

and

(2) for all d 0 ∈ D such that f (d 0 ) = d 0 , d f v d 0 . Proof: D has ⊥ with the property that ⊥ v d , and also ⊥ v f (⊥) . f is monotone (because continuous), hence f (⊥) v f ( f (⊥)) , and in general, f n (⊥) v f n+1 (⊥) . (The superscript indicates the iteration of f .) The set X = { f n (⊥) : n ∈ N } is a directed set, thus its lub , d f is in D , by the definition of a CPO. f (lub(X)) = lub( f [X]) , because f is continuous. Notice that lub(X) = lub( f [X]) , because of the way X is defined. That is, f (d f ) = d f . If d is a fixed point of f , then f n+1 (d) = f n ( f (d)) = f n (d) , since f (d) = d . Also, f n (⊥) v f n (d) , for any d ∈ D , including a d that is a fixed point of f . Thus d f is indeed the least element in the set of fixed points of f . qed A function might have more than one fixed point, but some do not have more than one. The least fixed point has a featured spot among all the potentially existing fixed points: its existence is guaranteed, by the above lemma. Working with the least fixed point provides a certain uniformity when moving from one CPO to another CPO. There is quite a distance between the P ω model from the previous section and arbitrary CPOs. In particular, the functions considered were determined by their behavior on finite subsets of N .17 The following definition generalizes this aspect of P ω to CPOs that may not contain any natural numbers or their sets. D EFINITION 6.4.15. Let hD, vi be a CPO. d ∈ D is a finite element iff for all X ∈

P (D)Z , if d v lub(X) , then there is a y ∈ X such that d v y . The set of all finite elements of D is denoted by fin . To see the rationale behind the label “finite,” let us consider hN ∪ { ω }, ≤i . A directed subset X is finite (with lub(X) = max(X) ) or infinite (with lub(X) = ω ). If n ∈ N , then it is obvious that all directed subsets X with lub(X) ≥ n contain an element suitable for y . If we take ω , then ω ≤ lub(N) , however, no n ∈ N satisfies ω ≤ n . In sum, all the natural numbers are finite elements, whereas ω is not. D EFINITION 6.4.16. Let hD, vi be a CPO. D is algebraic iff for all d ∈ D , both (1) and (2) hold. (1) { x : x ∈ fin ∧ x v d } ∈ P (D)Z , (2) d = lub{ x : x ∈ fin ∧ x v d } . In words, the CPO D is algebraic whenever the finite elements below each d form a directed set, the lub of which is d itself. Thinking about hN ∪ { ω }, ≤i again for a moment, each n ∈ N clearly satisfies (1) and (2) above. N is the set fin in this CPO, and lub(N) = ω , as needed. 17 Scott

emphasized from early on the ideas of approximation and computing with finite pieces of information — see, e.g., Scott [].


162


D EFINITION 6.4.17. (D OMAINS ) Let hD, vi be an algebraic CPO. D is a domain iff card(fin) = ℵ0 , that is, D has ℵ0 -many finite elements. This is a good place to note that the term “domain” is not used fully uniformly in the literature (beyond the common use of the term as the set of arguments of a function).18 Our aim here is merely to recall how models for untyped CL can be obtained based on certain posets. There is an abundance of interesting results about domains; however, we focus our consideration on CPOs. There are various ways to move between CPOs and to combine CPOs. Lemma 6.4.13 guarantees that the set of continuous functions from the CPO D into itself, that is sometimes denoted by [D −→ D] , is a CPO. Again, recalling an idea from P ω , we would like to set up a correspondence between D and [D −→ D] . D EFINITION 6.4.18. (R ETRACTION ) Let hC, vi and hD, vi be CPOs. A pair of functions hi, ji is a retraction whenever i : C −→ D and j : D −→ C , and j ◦i = idC . That is, the function composition of i with j is the identity function on C . C is called a retract of D by i and j . The requirement that the composition of i and j is identity implies that i is injective, that is, i embeds C into D . j ¹ i[C] is also injective, although j may not be injective on all of D . In general, i ◦ j ⊆ idD . Such a pair hi, ji of functions is an embedding–projection pair, which is an alternative terminology used instead of “retraction” adopted from category theory. Having the above definition we want to define concretely the retraction when the two CPOs are a CPO and the space of its continuous functions. We take N⊥ to be D0 , and denote by Dn+1 the continuous functions of Dn . That is, for any n , we set Dn+1 = [Dn −→ Dn ] . All the Dn ’s are CPOs, since we started with a CPO. Exercise 6.4.3. Prove that, if we start with N⊥ , then all the function spaces [Dn −→ Dn ] are domains (not just CPOs).

D EFINITION 6.4.19. ( hin , jn i ) The retractions hin , jn i between the Dn ’s are defined inductively. The elements of the n th retraction have types in : Dn −→ Dn+1 and jn : Dn+1 −→ Dn . (The subscripts show which D the element belongs to.19 ) (1) i0 (d0 ) = λx0 . d0 ; (2) j0 ( f1 ) = f1 (⊥0 ) ; (3) in+1 (dn+1 ) = in ◦ dn+1 ◦ jn ; (4) jn+1 ( fn+2 ) = jn ◦ fn+2 ◦ in . 18 For

instance, in the volume Gierz et al. [], a domain is not required to have ℵ0 -many finite elements (which are called way-below elements there). 19 The first glance at the subscripts might suggest that something is wrong with (4). However, it should be kept in mind that only the retraction is defined here; the d ’s and f ’s are already defined.


Chapter 6.

163

Models

In clause (1), we used λ which should be understood as a symbol in the metalanguage rather than in the λ -calculus. The content of this clause is simply that every element of D0 is taken into D1 as the constant function with that element as its value. (We could have used here combinators informally, and write Kd instead.) The second clause specifies that for a function from D1 we take the element that the function yields on ⊥0 , which is the least element of D0 . Each function in D1 is continuous, hence monotone, and so the effect of this clause is taking the least value each function in D1 takes as the representative of that function in D0 . The following picture shows the moves. N⊥

=

[D0 −→ D0 ] =

Dx0   i0 y j0

d0  y

f1 (⊥ x 0)  

D1

λx.d0

f1

Exercise 6.4.4. Verify that i0 and j0 are continuous functions.

Given d ∈ Dn+1 , the corresponding function in+1 (d) of type Dn −→ Dn is the composition of jn with d and then with in . jn takes an element e of Dn+1 into an element jn (e) of Dn , which makes d applicable to that element. The value d( jn (e)) — due d ’s type — is an element of Dn , hence, in maps that element into an element of Dn+1 . The definition of jn+1 involves a similar transition between Dn ’s. jn+1 ( fn+2 ) should give a function in Dn+1 , which takes arguments from Dn . To calculate jn+1 ( fn+2 )(dn ) , we insert in , that is, in (dn ) . The latter is an element of Dn+1 , and so f is applicable. The result is in the same Dn+1 ; an application of jn takes that element into an element in Dn as needed. The last two clauses may be visualized as follows. Dn+1 dn+1 jn ◦ fn+2 x  x ◦ in    in+1 y jn+1 y  Dn+2 in ◦ dn+1 ◦ jn fn+2 The functions defined are all continuous. To prove this claim inductively, it is useful to prove first the following lemma. L EMMA 6.4.20. Continuous functions on CPOs compose into a continuous function. Proof: Let f and g be continuous functions, f : C −→ D and g : D −→ E . We show that g ◦ f is continuous. Let X ∈ P (C)Z . Then f (lub(X)) = lub( f [X]) . The continuity of f implies its monotonicity, which in turn, implies that f [X] ∈ P (D)Z . lub( f [X]) ∈ D , and by g’s continuity, g(lub( f [X])) = lub(g[ f [X]]) . However, g[ f [X]] = { e : ∃x ∈ X. e = g ◦ f (x) } . g(lub( f [X])) = g( f (lub(X))) , which is further g ◦ f (lub(X)) . To sum up, we have that for a directed subset X of C , g ◦ f (lub(X)) = lub(g ◦ f [X]) . qed L EMMA 6.4.21. (C ONTINUITY OF RETRACTIONS ) ments of hin , jn i is continuous.


For all n , each of the ele-

164


Proof: The proof is by induction on n , which is the index of the functions in the retraction. Exercise 6.4.4 concerned the base case, n = 0 . To show that in+1 is continuous, we appeal to the preceding lemma and the definition of in+1 . There are three functions in the definition: in : Dn −→ Dn+1 , jn : Dn+1 −→ Dn and dn+1 : Dn −→ Dn . All these functions are between CPOs, and dn+1 is known to be continuous. in and jn are continuous by the hypothesis of the induction. Then so is in+1 . ( jn+1 can be proved to be continuous in a similar fashion.) qed The collection of all the Dn ’s together with the retractions hin , jn i form an inverse system. The inverse limit, denoted by D∞ = lim(Dn , hin , jn i) (or simply by lim Dn ), ← ← is the space in which a model of CL exists. The elements of D∞ can be viewed as infinite sequences of elements, for instance, d∞ = hd0 , d1 , . . . , dn , . . .i , where d0 ∈ D0 , d1 ∈ D1 , etc. As a concrete example, ⊥∞ = h⊥0 , ⊥1 , . . . , ⊥n , . . .i . There is a natural ordering emerging on D∞ via the coordinate-wise ordering. That is, d∞ v∞ d∞0 iff dn vn dn0 , for all n . Then it can be shown that hD∞ , v∞ i is a CPO. ∞ ∞ The limit construction gives, for each n , a retraction hi∞ n , jn i such that in : Dn −→ ∞ ∞ D∞ and jn : D∞ −→ Dn . Informally, i returns an element of the infinite sequence, whereas the j∞ yields an infinite sequence. i∞ n (d∞ ) = dn and jn∞ (dn ) = h jn7→0 (dn ), . . . , jn7→n−1 (dn ), In (dn ), in7→n+1 (dn ), in7→n+2 (dn ), . . .i, where In is the identity function on Dn . Furthermore, jn7→n−1 is jn , in7→n+1 is in , and the other i ’s and j ’s are compositions of the one-step i ’s and of the one-step j ’s that we have defined previously. D∞ can be used as a model of CL, if we can find suitable elements to stand for the combinators S and K , and we can define a binary operation to represent application. D EFINITION 6.4.22. (CL MODEL IN D∞ ) Application and the combinators S and K are defined as in (1)–(3). ( I1 abbreviates the element of D1 that is λx0 .x0 . The subscripts indicate to which Dn ’s the elements belong.) (1) S∞ = h⊥0 , I1 , j2 (S3 ), S3 , S4 , . . . , Sn , . . .i , where Sn = λxn−1 yn−2 zn−3 . xn−1 ( jn−3 (zn−3 ))(y(z)) .20

(2) K∞ = h⊥0 , I1 , K2 , K3 , K4 , . . . , Kn , . . .i ,

where

Kn = λxn−1 yn−2 . jn−2 (xn−1 ) .

(3) d∞ · d∞0 = lubn∈N jn∞ (dn+1 (dn0 )) . D EFINITION 6.4.23. A function I from CL-terms into hD∞ , · , S∞ , K∞ i is an interpretation iff it satisfies (1)–(3). 20 Notice

that we use a few extra pairs of parentheses compared to CL or the λ -calculus. For instance, jn−3 (zn−3 ) is the application of j to z , in the sense of the usual notation for functions.


Chapter 6.

Models

165

(1) I(x) ∈ D∞ ; (2) I(S) = S∞ and I(K) = K∞ ; (3) I(MN) = I(M) · I(N) . The definition allows variables to be interpreted by any elements of D∞ , but requires the combinators and the application operation to have a fixed interpretation. L EMMA 6.4.24. If M =w N in CL, then I(M) = I(N) in D∞ . Exercise∗ 6.4.5. Prove the lemma.

In this model, if I(MP) = I(NP) for all P , then I(M) = I(N) , that is, the model is extensional. Exercise 6.4.6. Prove the latter claim. (Hint: The proof might be extracted from the

proof of the previous lemma.)

6.5

Models for typed CL

In this section we will be concerned with typed CL. Some systems of typed CL are introduced in chapter 9.21 The intersection type system CL ∧ is slightly more complicated than the type system that contains only → . However, the additional expressive capability of the language of types is clearly a plus. Later, in chapter 9, we will see that all CL-terms are typable in CL ∧ . Now we show that CL ∧ allows CL-terms to be interpreted in a straightforward way as sets of types. The type constructors in CL ∧ are → , ∧ and the constant ω . The latter is a top element in the set of types (i.e., it is like ω in N ∪ { ω } rather than the elements of N ). Types are thought of as formulas. The type system in itself amounts to the logic BT∧ (where T is the usual notation for the Church constant “truth,” which is like ω ). D EFINITION 6.5.1. (A XIOMS FOR BT∧ ) The axioms and rules for BT∧ are as follows. ( A, B,C, . . . are arbitrary formulas.) (A1) A → A (A2) (A ∧ B) → A (A3) (A ∧ B) → B 21 We

suggest reading this section in parallel with section 9.2, or skipping this section now and moving onto section 6.6. The reader might return to this section as well as the concrete operational model at the end of section 6.2 after reading chapter 9.


166


(A4) ((A → C) ∧ (A → B)) → (A → (B ∧C)) (A5) A → T (A6) T → (T → T ) (R1) A, A → B ⇒ B (R2) A, B ⇒ A ∧ B (R3) A → B ⇒ (C → A) → (C → B) (R4) A → B ⇒ (B → C) → (A → C) A formula A is a theorem of BT∧ iff there is a finite sequence of wff’s — called a proof — ending with A in which each wff is either an instance of an axiom or obtained from previous formula(s) by an application of a rule. BT∧ is quite usual as an axiom system, and the notion of a proof is uncomplicated. The presence of ∧ as a type constructor is crucial in ensuring the typability of terms like xx . ω is a universal type that can be assigned to any term. In the spirit of the “formulas-as-types” paradigm, we use “type” and “wff” synonymously here. At the end of section 6.2, we have seen an interpretation of CL-terms by sets of types, however, that modeling was restricted to Bw . Having more types — that is the real advantage of having more type constructors — allows us to give a model for =w , that is, for expansion too. D EFINITION 6.5.2. (T HEORIES OF TYPES ) (1)–(3) hold of X .

A set of wff’s X is a theory when

(1) X 6= 0/ ; (2) if A, B ∈ X then A ∧ B ∈ X ; (3) if A ∈ X and A → B is a theorem then B ∈ X . The set of types has a natural preorder on it: A 6 B iff A → B is a theorem of BT∧ . The reflexivity of this relation is obvious due to (A1), and its transitivity follows by the rules (R3) and (R4). As a counterexample to antisymmetry, we can take A ∧ B and B ∧ A , which imply each other, but distinct as wff’s. We can consider wff’s that imply each other together, and then we have a partial order (on the set of equivalence classes of wff’s). If we apply this usual trick, then we get a meet semilattice with a top from the word algebra of wff’s. Talking about algebras, more specifically, lattices and meet semilattices, certain subsets of elements are called filters. A filter is an upward closed set of elements that is also closed under the (binary) meet operation. Sometimes filters are defined not to be empty, and we would want that version of the definition here. There is a 1–1 correspondence between theories and filters, though they are not the same object. There are certain advantages to the less discriminative view of types, because


Chapter 6.

Models

167

partial orders are easier to treat than quasi-orders. This may be an explanation why in some of the literature the model (or its close variants) are called filter λ -model. To complete the model though, we have to have an operation that can stand in for the application operation. D EFINITION 6.5.3. (F USION ) denoted by ◦ , is defined as

Let X and Y be theories. The fusion operation,

X ◦Y = { B : ∃ A. A → B ∈ X ∧ A ∈ Y }. This operation is very similar to the condensed detachment operation from section 6.2. The definition says that A → B ∈ X and A ∈ Y , that is, B is obtained by detachment. A difference between the operations is that we do not allow the unification of the formulas in X and Y via substitution. However, substitution is an admissible rule in BT∧ , because the axioms are formulated as axiom schemas. The name “fusion” for ◦ comes from the name of a connective that is included in some formulations of B (and other relevance logics). Arguably, detachment is best formulated using fusion, which is an operation closely related to → . ( → is a residual of ◦ in the algebra of the logic B .) The structure that arises from theories together with the fusion operation is a combinatory algebra in the sense of definition 6.2.2. This time we want to interpret not simply the terms of CL, but type assignments, or even type assignments given a (consistent) set of assumptions. This means that we have to have an interpretation both for CL-terms and types. D EFINITION 6.5.4. Let A = hD, · , S, Ki be a combinatory algebra, and let I and v be functions that interpret atomic terms and propositional variables.22 (1) I(K) = K , I(S) = S and I(I) = S · K · K ; (2) I(x) ∈ D ; (3) I(MN) = I(M) · I(N) ; (4) v(p) ∈ P (D) ; (5) v(T ) = D ; (6) v(A → B) = { d1 : ∀d2 . d2 ∈ v(A) ⇒ d1 · d2 ∈ v(B) } ; (7) v(A ∧ B) = v(A) ∩ v(B) . In a model M = hA, I, vi , the type assignment M : A is true, denoted by M ² M: A 22 The

iff

I(M) ∈ v(A).

extensions of these functions to all the CL-terms, and to all the types, respectively, are also denoted by I and v .


168


A set of type assignments is true whenever each element is true. A type assignment with an assumption set is valid, denoted by ∆ ² M: A

iff

∀ M. M ² ∆ implies M ² M : A.

The notation ∆ `CL∧ M : A (or ∆ ` M : τ in chapter 9, where we use Greek letters for types) means that given the type assignments of variables in ∆ , CL ∧ proves M : A . The notation ∆ ² M : A , in the above definition, on the other hand, stands for a semantic statement that is spelled out on the right-hand side of the iff. The latter contains a universal quantifier, and it should be noted that A does not determine uniquely either I or v . Thus the definition of validity involves three universal quantifiers: for all combinatory algebras, for all interpretations of CL-terms (in the algebra), and for all interpretations of types (in the algebra). In the “fool’s model,” CL-terms were interpreted by types, and we already mentioned that there is a similarity between the fusion operation on theories and condensed detachment. Notice, however, that clause (6) interprets the implicational wff’s via the operation in the combinatory algebra (that is the analogue of the application operation on CL-terms). The calculus CL ∧ allows us to prove expressions of the form ∆ ` M : A . Roughly speaking, we would like to show that the two relations ` and ² coincide. L EMMA 6.5.5. (S OUNDNESS OF CL ∧ ) ∆ ² M : A.

If ∆ ` M : A is provable in CL ∧ , then

Proof: 1. The axiom id is obviously valid, and so is axiom ω . For the combinatory axioms, we have to take a look at the interpretation of the types that are assigned to them. Let us take A → B → A . d1 ∈ v(A → B → A) iff for all d2 ∈ v(A) , d1 · d2 ∈ v(B → A) . Further, d1 · d2 ∈ v(B → A) just in case, for all d3 , if d3 ∈ v(B) then (d1 · d2 ) · d3 ∈ v(A) . If we combine the two conditions, then we get that for d1 to be an element of v(A → B → A) , it must be the case that for all d2 ’s in v(A) and d3 ’s in v(B) , d1 · d2 · d3 has to be an element of v(A) . There is no constraint linking v(B) to v(A) — except that they are subsets of the same set D . Thus given d2 ∈ v(A) , K is an element that guarantees K · d2 · d3 ∈ v(A) . The function I is fixed on the constants, that is, I(K) = K , where the K on the left is the combinator, and the K on the right is the constant element of A . Clearly, I(K) ∈ v(A → B → A) meaning that ² K: A → B → A. The interpretation of A → A is { d1 : ∀d2 . d2 ∈ v(A) ⇒ d1 · d2 ∈ v(A) } . We have S and K as distinguished elements of D , and they behave with respect to · in A just like the identically denoted combinators do in CL. In other words, S · K · K · d = d , because A is a combinatory algebra. Then S · K · K ∈ v(A → A) . Since SKK defines I in CL, we have above that I(I) = S · K · K , which is sufficient to prove that I(I) ∈ v(A → A) , that is, ² I : A → A . The case of the S axiom is left as an exercise. 2. Next we look at the E → rule. The premises provide, by the hypothesis of induction, that ∆1 ² M : A → B and ∆2 ² N : A . The applicability of the rule means


Chapter 6.

Models

169

that ∆1 and ∆2 do not assign different formulas to one and the same variable. Then for all I and v , ∆1 is true if ∆2 is true and the other way around. If ² ∆1 , ∆2 , then both I(M) ∈ v(A → B) and I(N) ∈ v(A) . By the definition of v(A → B) , I(M)·I(N) , that is, I(MN) is an element of v(B) . This is exactly what we need for the validity of ∆1 , ∆2 ² MN : B . 3. Lastly, we consider an E∧ rule. Let us assume that ∆ ² M : A ∧ B . With the proviso that ∆ is true, this means that I(M) ∈ v(A ∧ B) . We know that v(A ∧ B) = v(A) ∩ v(B) ; hence, by the usual definition of ∩ , I(M) ∈ v(A) is immediate. (Again, we leave the rest of this step for an exercise.) qed Exercise 6.5.1. Describe the set that is the interpretation of (A → B → C) → (D →

B) → (A ∧ D) → C . Exercise 6.5.2. Finish step 3 in the above proof. (Hint: There are two more ∧ rules

that we have not considered.) To prove the converse of the claim of the above lemma, we select a particular combinatory algebra, as well as certain functions I and v . D EFINITION 6.5.6. Let AF be hF, · , S, K, Ii , where the components are as follows. (1) F is the set of theories of wff’s (or equivalently, the set of filters on the algebra of BT∧ ); (2) F1 · F2 = { B : ∃ A. A ∈ F2 ∧ A → B ∈ F1 } ; (3) S = [{ E : E = σ((A → B → C) → (D → B) → (A ∧ D) → C) }) ; (4) K = [{ E : E = σ(A → B → A) }) ; (5) I = [{ E : E = σ(A → A) }) . The notation E = σ(G) is to indicate that E is a substitution instance of G . The mismatched-looking [ ) forms a theory from a set of wff’s.23 L EMMA 6.5.7. AF is a combinatory algebra. Proof: We have to prove that · is an operation on filters, as well as, that the selected filters, S , K and I behave as expected. 1. Let F1 and F2 be filters, and let us assume that A1 and A2 are in F1 · F2 . By (2), for A1 , ∃B1 ∈ F2 . B1 → A1 ∈ F1 , and similarly for A2 , ∃B2 ∈ F2 . B2 → A2 ∈ F1 . By our starting assumption, F1 and F2 are filters, hence B1 ∧ B2 ∈ F2 . In BT∧ , it is provable that → is antitone in its first argument place, in particular, (B1 → A1 ) → (B1 ∧ B2 ) → A1 and (B2 → A2 ) → (B1 ∧ B2 ) → A2 . Therefore, the consequents of these implications are also elements of F1 . F1 is a filter too, and so ((B1 ∧ B2 ) → A1 ) ∧ ((B1 ∧ B2 ) → A2 ) ∈ F1 . BT∧ proves the latter wff to be equivalent to (B1 ∧ B2 ) → (A1 ∧ A2 ) . Then, by the definition of · , A1 ∧ A2 ∈ F1 · F2 . 23 This

notation is widely used in the algebraic literature for filters.


170


For the other defining feature of filters, let us assume that A ∈ F1 · F2 and A → B is a theorem. The definition of · implies that C → A ∈ F1 and C ∈ F2 for some formula C . By rule (R3), (C → A) → C → B follows, thus C → B ∈ F1 . But this implies that B ∈ F1 · F2 , again, by (2), that is, by the definition of · . 2. We consider the easiest constant I . (The exercise below asks you to complete this step of the proof.) The easy direction involves showing that F ⊆ I · F , for any F ∈ F . Let A ∈ F ∈ F . By the definition of I in (5), A → A ∈ I too, hence A ∈ I · F . For the converse, let F ∈ F , and A ∈ I · FV. Then there is a B ∈ F such that B → A ∈ I . The definition of I provides that ni=1 (Ci → Ci ) → B → A for some n . BT∧ proves every instance of Ci → Ci , hence also their conjunction. Then by rule (R1), B → A is a theorem, thus by the definition of theories (or filters), A ∈ F . qed Exercise 6.5.3. Verify that S and K behave as expected.

In order to be able to prove the completeness of CL T∧ , we also have to define I and v appropriately. We know that AF is a combinatory algebra with the elements of the carrier set being filters of formulas. The usual canonical interpretation in various nonclassical logics takes a wff and maps that into a proposition, which is a set of theories (of a suitable kind). Thus we have to find an element in those propositions, that is, a theory that can be taken to interpret the term that can be assigned the formula (represented by the proposition). L EMMA 6.5.8. The set of formulas that can be assigned to a CL-term in CL ∧ is a theory. In other words, { A : ∆ ` M : A } ∈ F . Proof: 1. First of all, ω (i.e., T ) can be assigned to any formula, therefore, { A : ∆ ` M : A } 6= 0/ . (Notice that this is in contrast with the interpretation of CLterms in the last model in section 6.2.) Let B,C ∈ { A : ∆ ` M : A } . Then both ∆ ` M : B and ∆ ` M : C , hence by rule I∧ , ∆ ` M : B ∧C . The latter means that B ∧C ∈ { A : ∆ ` M : A } . Next, let B ∈ { A : ∆ ` M : A } and A → B a theorem of BT∧ . Rule up guarantees that ∆ ` M : B as well. qed The proof is a nice illustration of how the addition of the top element to the set of types and the new type constructor ∧ provide a nonempty and well-shaped set of types for all CL-terms. Actually, if ∆ is the least set such that ∆ ` M : A is provable in CL ∧ , then { A : ∆ ` M : A } is the theory generated by { B : ∃x. x : B ∈ ∆ } . Exercise 6.5.4. Prove the previous claim. (Hint: There are two ∧ elimination rules.)

D EFINITION 6.5.9. The interpretation of a wff A is v(A) = { F ∈ F : A ∈ F } . Let I be a function assigning elements of F to variables, x, y, z, . . . . Let ∆0 be a modification of ∆ where xi : Ai when Ai ∈ I(xi ) . Then the definition of I(M) provides that I(M) = { A : ∆0 ` M : A } . (The interpretation of the constants is unchanged; that is, they are certain selected filters.)


Chapter 6.

171

Models

L EMMA 6.5.10. The function I as defined above is an interpretation of CL-terms into the combinatory algebra AF . Proof: We are only concerned with the interpretation of the binary application operation. Let us assume that A ∈ I(N) and A → B ∈ I(M) . By the definition of · , B ∈ I(M) · I(N) . But an application of E → gives MN : B (with the combined assumption set), hence B ∈ I(MN) , as we need. To prove the converse, we have to make sure that ∆ ` MN : B implies that for some A , A → B ∈ I(M) and A ∈ I(N) . The axioms contain atomic terms, hence we only have to scrutinize the rules of CL ∧ . Obviously, E → gives what we need. If ∆ ` MN : B is by E∧ , then by hypothesis, ∆ ` MN : B ∧C implies ∆ ` M : A → (B ∧ C) and ∆ ` N : A , which is sufficient for A ∈ I(N) . (A → (B ∧ C)) → A → B is a BT∧ theorem; hence, A → B ∈ I(M) , as desired. The case of the other E∧ rule is alike. If ∆ ` MN : B is by I∧ , then B is C ∧ D . By the hypothesis of the induction, we have that ∆ ` MN : C implies E → C ∈ I(M) and E ∈ I(N) , as well as ∆ ` MN : D implies F → D ∈ I(M) and F ∈ I(N) . The two implicational types imply (E ∧ F) → (C ∧ D) in BT∧ . Given the assumptions provided by the hypothesis of the induction, we can obtain a common type assigned to M and a common type assigned to N in the following way. ∆ ` M: E →C ∆ ` M: F → D ∆ ` M : (E ∧ F) → (C ∧ D) ∆ ` MN : C ∧ D

∆ ` N: E ∆ ` N: F ∆ ` N: E ∧F

This shows that (E ∧ F) → (C ∧ D) ∈ I(M) and C ∧ D ∈ I(N) as we need. The last two rules to consider are mon and up . The former is straightforward. If ∆ ` MN : B is by up , then A ≤ B for some A , and by hypothesis, C → A ∈ I(M) and C ∈ I(N) . However, A ≤ B implies C → A ≤ C → B , thus we have ∆ ` M: C → A C →A ≤C →B ∆ ` M: C → B ∆ ` MN : B

∆`N: C

Thus C → B ∈ I(M) , which is sufficient to establish the claim.

.

qed

L EMMA 6.5.11. If ∆ ² M : A , then ∆ ` M : A is provable in CL ∧ . Proof: The algebra of theories (i.e., AF , as defined above) is a combinatory algebra by lemma 6.5.7. We have proved that a particular function I is an interpretation of CL-terms in this algebra. v can be taken to be the canonical interpretation of types as propositions. Thus hAF , I, vi is a model of CL ∧ . Let us assume that CL ∧ does not prove ∆ ` M : A . Then A ∈ / I(M) , which means that A is not a member of a particular theory (or filter) from F . However, v(A) contains only filters of which A is an element. This gives I(M) ∈ / v(A) , that is, M ² M : A is not true. The definition of I ensures that M ² ∆ ; that is, hAF , I, vi makes the type assignments in the assumption set true without making M : A true. By definition 6.5.4, ∆ ² M : A is not valid. qed


172


The intersection type assignment system CL ∧ allows a type to be assigned to any CL-term. However, without ∧ and T , not all CL-terms are typable.24 The logic of types in CL ∧ is BT∧ , and it is known that the extension of the implicational logic B→ by conjunction and top is conservative. The conservativity of the extension may be shown to carry over to CL ∧ when that is viewed as an extension of CL → . L EMMA 6.5.12. The above model is complete for CL → . Exercise∗ 6.5.5. Use the conservativity of BT∧ over B→ to show the conservativity of CL ∧ over CL → , and thereby, give a proof of this lemma.

Another way to utilize the existence of a model for CL ∧ is to eliminate the type assignments. Then we get a model of pure CL. We built the model above piece by piece, and so we can leave off parts of the construction. The core results pertaining to the possibility of this deletion are lemma 6.5.7 and lemma 6.5.8. The previous section considered CL models in an abstract setting. F , the set of filters (or theories) forms a lattice; moreover, a complete lattice with intersection as meet and with the least covering filter of filters as join.25 Clearly, hF, ⊆i is a CPO with { T } being the least element in F . Furthermore, this model is a domain. Exercise 6.5.6. Recall the definition 6.4.17. Give a detailed proof that hF, ⊆i is a CPO, and also a domain.

In section 9.2, we briefly mention, a union type assignment system CL + . The type inferences in CL + prove exactly the theorems of the logic known as BT+ .26 D EFINITION 6.5.13. (P OSITIVE BT ) The positive fragment of the logic BT is axiomatized by adding axioms (A7)–(A10) to the axiomatization of BT∧ (in definition 6.5.1). (A7) A → (A ∨ B) (A8) A → (B ∨ A) (A9) ((A → B) ∧ (C → B)) → (A ∨C) → B (A10) (A ∧ (B ∨C)) → ((A ∧ B) ∨ (A ∧C)) The axioms are easily seen to be analogues of the type inference axioms that were added to CL ∧ to obtain CL + . The standard logical notions of BT+ — such as proof and theoremhood — are defined as usual. The Stone representation of Boolean algebras or the completeness of classical logic uses prime filters. Prime theories (prime filters) have the property that, if they 24 See

section 9.1 for simply typed systems of CL. lattice F is not always a chain like the filters on Q are, which are well-known from the Dedekind completion of Q . This explains why union cannot be taken for join, in general. For other ways to define the “covering,” see, for example, [, §9.4]. 26 A subscript + is often used to indicate the positive fragment of a logic, which means the fragment that does not contain negation (and constants like F or f ). 25 The


Chapter 6.

173

Models

contain a disjunction (a join), then they contain a component from the disjunction (the join). Fundamentally, this is the reason why intersection and union on sets of prime filters can represent meet and join of a distributive lattice. To make a long story short, from the semantical studies of nonclassical logics, mainly of relevance logics, it is well-known that sets of prime theories can be used to give a model for various positive relevance logics. But it is just as well-known that the set of prime theories is not closed under a · -like operation — unlike the set of theories is. In other words, we cannot simply replace theories by prime theories in the previous model. D EFINITION 6.5.14. (H ARROP THEORIES ) defined by (1)–(3). (1) A ∈ hwf

The set of Harrop formulas, hwf, is

if A is an atomic formula;

(2) A ∧ B ∈ hwf

if A, B ∈ hwf ;

(3) A → B ∈ hwf

if B ∈ hwf and A ∈ wff .

A set of wff’s X is a Harrop theory iff X is a theory in which for all formulas A ∈ X , there is a Harrop formula B such that B → A is a theorem of BT+ . The set of Harrop theories is denoted by H . The application operation is defined as before, that is, as in definition 6.5.6. Before we prove that the Harrop theories provide closure under the application operation, we state a lemma that gives the crucial step in the proof of the next lemma. L EMMA 6.5.15. (B UBBLINGWLEMMA FOR BT+ ) Let M and J be finite subsets of V N . Then m∈M Am → Bm ≤ j∈J C j → D j just in case _

∃ j ∈ J : Cj ≤

Am ∧ ∀K. K ( M ⇒ (C j ≤

m∈M

_ k∈K

Ak ∨

^

Bi ≤ D j ).

i∈M−K

Exercise∗ 6.5.7. Prove the bubbling lemma for BT+ .

L EMMA 6.5.16. The set H is closed under · , the application operation. Proof: Let us assume that F1 , F2 ∈ H , and B ∈ F1 · F2 . Then there is A ∈ F2 with A → B ∈ F1 . At this point, we do not know whether B ∈ hwf or not. For F1 · F2 to be a Harrop theory, we have to show that there is a C (possibly, B itself) such that C ∈ hwf and C → B is a theorem. A ∈ F2 ∈ H , hence there is a D ∈ hwf such that D → A is a theorem. By suffixing, (A → B) → D → B , therefore, D → B ∈ F1 . Then there is an hwf E ∈ F1 such that E → D → B is V a theorem. Since E is hwf, it can be taken to be of the form V ( m∈M Em → Fm ) ∧ k∈K pk , where the Fm ’s themselves are hwf’s. ThenVby the bubbling lemma, there is a finite subset of M , let us say J , for which D → j∈J E j V and j∈J V Fj → B . We need a hwf such that that formula implies B , and we already have that j∈J Fj implies B . All the Fj ’s are hwf’s, and J is finite.VThe conjunction of hwf’s is an hwf, by the definition above. Since D ∈ F1 , then j∈J E j ∈ F1 too. V Then j∈J Fj ∈ F1 · F2 , which shows that F1 · F2 is a Harrop theory, as we intended to prove. qed


174


Harrop theories are quite special among all the sets of formulas — they provide the desired closure under · for a model. However, there are not enough many of them, in general. In other words, they cannot provide an isomorphic representation for CL. We do not pursue further the problem of modeling CL based on Harrop theories. Instead we conclude this section with a couple of exercises. Exercise 6.5.8. In order to obtain a model from CL, suitable sets of formulas has to be

selected to interpret the combinators. Work out those details of the model, and prove soundness. Exercise∗∗ 6.5.9. Determine why completeness is not provable using Harrop theories.

Fix the problem. (Hint: This is a completely open-ended exercise.)

6.6

Relational models

The models for typed CL showed an interaction between structures which included a binary operation and types. We also saw a connection between CL and the minimal relevance logic B . Many nonclassical logics have been interpreted starting with a relational structure rather than an algebra. These sorts of semantics were first introduced by Kripke in the late 1950s for normal modal logics. The usual modal operators, ¤ and ♦ , are unary operations in (the algebra of) modal logics. However, the set of maximally consistent sets of formulas (in the sense of classical logic) is not closed under the operations that correspond to these modal operators. Kripke’s idea was to use a binary relation instead, which later on, became known as the “accessibility relation” between “possible worlds.” Taking the existential image operation determined by the relation, we can obtain an operation on sets of possible worlds that shares tonicity and distributivity properties with ♦ , possibility. The lack of closure under an operation is a recurring problem; we have already encountered this difficulty in the case of BT+ and the · operation. Relevance logics are typically not extensions of classical logic. However, prime filters on the algebra of these logics perform adequately in the modeling of conjunction and disjunction — just like ultrafilters (or maximally consistent sets of formulas) do in normal modal logics. The (former) prime filters though are not maximal with respect to not being identical to the carrier set of the algebra. The relational paradigm that originated in the context of logics with unary operators was adapted to relevance logics by Dunn, Meyer and Routley. Later on, it was generalized and extended to other nonclassical logics by them and others.27

27 For

a comprehensive and state-of-the-art exposition see [], which is completely devoted to this approach (and it also contains an extensive bibliography).


Chapter 6.

175

Models

We have combinatory algebras and combinatorial reduction algebras that were introduced in definition 6.2.1 and definition 6.2.8, respectively. The relational semantics for various nonclassical logics can be viewed as representations of the algebras of those logics. Having isolated the algebras of CL, we can consider representations of combinatory and combinatorial reduction algebras. First, we assume that we have a combinatorial reduction algebra — with constants S and K ; then, we note some necessary modifications for a semantics for CL with =w . D EFINITION 6.6.1. (S TRUCTURES ) A structure (or frame) is F = hU, ≤, R, s, ki , where the structure satisfies (f1)–(f4).28 (f1) U 6= 0/ ,

≤⊆ U2 ,

R ⊆ U3 ,

(f2) α ≤ α ,

α ≤ β∧β ≤ γ. ⇒ α ≤ γ,

s, k ∈ U ,

R↓ ↑ ;

α ≤ β∧β ≤ α. ⇒ α = β;

(f3) ∃u, v. Rsαu ∧ Ruβv ∧ Rvγδ . ⇒ ∃u, v. Rαγu ∧ Rβγv ∧ Ruvδ ; (f4) ∃u. Rkαu ∧ Ruβδ . ⇒ α ≤ δ . Informally, we have a partially ordered set of situations (or possible worlds). In extensions of classical logic, for instance, in normal modal logics, the situations may be thought of as complete and consistent descriptions of states of the world, and accordingly, they are called possible worlds. Here we cannot assume that the descriptions are complete, which motivates both the label “situations” for them and the stipulation of a partial order on the set of situations. U , the set of situations is assumed not to be empty, as usual. The relation linking some of the situations is R . If R were binary, then it would be natural to call it an accessibility relation. However, R is ternary, and so it is perhaps, more natural to view R as a compatibility relation on triples of situations, or even as a reachability relation; combining a pair of situations, from which the situation in the last argument of R may be reached. R is stipulated to interact with the ordering on the situations, in particular, R is antitone (decreasing) in its first argument place, and it is monotone (increasing) in its last argument place. s and k are elements of U — they will be involved in the modeling of the constants S and K of the combinatorial reduction algebra, as the notation is intended to suggest. These distinguished elements are required to satisfy their respective conditions in (f3) and (f4). We intend to use a certain kind of subsets — cones — of the set of all situations to represent CL-terms.29 Given a structure with U , the set of all cones on U is denoted by P (U)↑ . To obtain an interpretation of CL-terms, we augment a structure with an interpretation function v that is stipulated to conform to certain conditions. 28 The

term “frame” is sometimes used for a certain class of Heyting algebras. Our usage more closely follows the use of this term is part of the literature on modal logics. 29 Definition A.9.11 in section A.9 introduces cones in semilattices. The same definition can be adopted for our frames, because the definition does not depend on the existence of greatest lower bounds.


176


D EFINITION 6.6.2. (M ODELS ) Let F be a structure as defined above. A model is M = hF, vi , where v has to satisfy (v1)–(v4). (v1) v(x) ∈ P (U)↑ ; (v2) v(S) = s↑ ∈ P (U)↑ ; (v3) v(K) = k↑ ∈ P (U)↑ ; (v4) v(MN) = { γ : ∃α, β. α ∈ v(M) ∧ β ∈ v(N) ∧ Rαβγ } . The inequation M ≥ N is valid iff v(M) ⊆ v(N) for all models on all structures. L EMMA 6.6.3. If v(M), v(N) ∈ P (U)↑ , then so is v(MN) . Proof: Let us assume that γ ∈ v(MN) and γ ≤ δ . Clause (v4) above means that ∃α, β. α ∈ v(M) ∧ β ∈ v(N) ∧ Rαβγ . After instantiating the quantifiers and eliminating conjunction, we have Rαβγ . R is monotone in its third argument place, and so we get that Rαβδ holds too. Then by conjunction and existential quantifier introduction, δ ∈ v(MN) , as we had to show. qed T HEOREM 6.6.4. If M Bw N then M ≥ N is valid. Proof: We prove that v(K MN) ⊆ v(M) and that function application is interpreted by an operation that is monotone in both argument places. (See the next exercise for a step of the proof that we do not detail.) 1. Let δ ∈ v(K MN) , that is, by (v4), ∃γ ∈ v(K M) ∃β ∈ v(N). Rγβδ . Further, ∃ε ∈ v(K) ∃α ∈ v(M). Rεαγ . After quantifier and conjunction elimination, we have Rεαγ . v(K) = k↑ , that is, k ≤ ε . Then also Rkαγ , because R is antitone in its first argument place. According to (f4), α ≤ δ , and since v(M) ∈ P (U)↑ , δ ∈ v(M) . This is sufficient to show that v(K MN) ⊆ v(M) . 2. Let us assume that v(M) ⊆ v(N) . If δ ∈ v(MP) , then we have to show that δ ∈ v(NP) . By clause (v4), ∃α ∈ v(M) ∃β ∈ v(N). Rαβδ . Existential quantifier and conjunction elimination give ε ∈ v(M) . But by the starting assumption, ε ∈ v(N) , thus retracing the steps backward, we have that ∃α, β. α ∈ v(N) ∧ β ∈ v(P) ∧ Rαβγ , that is, δ ∈ v(NP) . The definition of function application on upward-closed sets is completely symmetric in its two arguments. Then it is obvious that v(PM) ⊆ v(PN) may be established based on the same assumption v(M) ⊆ v(N) . qed Exercise 6.6.1. Prove that a model satisfies v(SMNP) ⊆ v(MP(NP)) .

In order to be able to prove the converse of the claim, we have to define a structure that can make sufficiently many distinctions. We define a so-called canonical structure, which is constructed from CL-terms. We need the following notion. D EFINITION 6.6.5. (D OWNWARD - DIRECTED CONES ) Y ⊆ X . Y is a downward-directed cone on X iff (1) x ∈ Y and x ≤ y imply y ∈ Y ;


Let hX, ≤i be a poset, and

Chapter 6.

177

Models

(2) Y 6= 0/ ; (3) x, y ∈ Y imply ∃z ∈ Y. z ≤ x ∧ z ≤ y . The set of all downward-directed cones on X is denoted by P (X)↑Y , or if X is clear from the context, then simply by CY . These special subsets are the analogues of filters on lattices. (Cf. definition A.9.13.) Informally speaking, downward directedness in necessary, because S is a duplicator. The effect of a duplicator with respect to types is identification, and in the completeness proof, they have a similar impact. A downward-directed cone provides identification by ensuring that there is an element that is less than the two given elements. D EFINITION 6.6.6. (C ANONICAL STRUCTURE AND MODEL ) The canonical structure is Fc = hCY , ⊆, Rc , [S), [K)i , where Rc is defined by (c1). (c1) Rc αβγ ⇔ ∀M, N. M ∈ α ∧ N ∈ β . ⇒ (MN) ∈ γ . The canonical model is Mc = hFc , vc i , where vc (M) = {C ∈ CY : M ∈ C } . The components of Fc are of appropriate type. [S) and [K) are the principal cones generated by S and K , respectively.30 L EMMA 6.6.7. (C ANONICAL STRUCTURE IS A STRUCTURE ) ture is a structure in the sense of definition 6.6.1.

The canonical struc-

Proof: We prove one of the conditions, namely, that [K) behaves as needed. Let us assume that Rc [K)αu and Rc uβδ , as well as M ∈ α . K ∈ [K) , hence KM ∈ u . β 6= 0/ , and if N ∈ β , then KMN ∈ δ . The axiom of K guarantees that KMN ≤ M , hence, M ∈ δ too. We leave two further steps from the proof as exercises. qed Exercise 6.6.2. Prove that Rc has the tonicity that was stipulated for the compatibility

relation in (f1) in definition 6.6.1. Exercise 6.6.3. Show that (f3) is true in the canonical structure. (Hint: It is essential in this step that the cones are not arbitrary but downward-directed cones.)

T HEOREM 6.6.8. (C OMPLETENESS ) tures, then M ≥ N .

If v(M) ⊆ v(N) in all models on all struc-

Proof: It is obvious that the constants get interpretations that satisfy conditions (v2) and (v3), respectively. It remains to show that vc is a homomorphism for function application on cones, which is the content of the next exercise. The last step of the proof is to show that, if M ≥ N is false, then the two terms may be separated. [M) is a downward-directed cone and it cannot contain N , because M ≥ N is false. vc (M) contains [M) , but vc (N) does not. qed 30 The

order relation is ≤ , which is generated by ≥ or equivalently, Bw .


178


Exercise 6.6.4. Prove that vc (MN) satisfies (v4).

Lastly, we note a modification that is not completely obvious if the =w relation is to be modeled. Function application in combinatory logic would not be a normal operation if there would be a bottom element in the set of CL-terms. In a model, a bottom element appears simply as 0/ . Since function application is not a normal operation, though it is modeled by an existential image operation, 0/ must be excluded from P (U)↑ . Of course, the conditions characterizing s and k have to be strengthened to biconditionals.31

31 Further

details on relational semantics for CL and structurally free logics, see, for example, [], [],

[] and [].


Chapter 7 Dual and symmetric combinatory logics

The application of a numerical function f to arguments x1 , . . . , xn is usually written as f (x1 , . . . , xn ) , which is an example of prefix notation where the function symbol comes first. There are other notational conventions used, such as + being placed between its arguments in infix notation, or the exponent appearing as a superscript. In the case of these functions, we think of numbers as a different sort of object than the sort the functions belong to. This distinction is reinforced by the set-theoretical understanding of functions. However, we saw in chapter 6 that the natural numbers themselves may be seen as functions, and at the same time, computable functions on N may be viewed as natural numbers. This suggests that f (n) could be thought of as an application of n to f — not only the other way around, an application of f to n . Dual and symmetric combinators are functions that are applicable to arguments from the right-hand side, or from either side. The introduction of these new types of constants changes CL and its properties.

7.1

Dual combinators

In certain areas of mathematics, it is not unusual that an operation may be applied to an object in more than one way or from more than one “direction.” •........... .. .. .

..... ..... ..... .....

•..................................•

•.....

. .. ...... .. .. .. .. ..

C •...

..... ..... .. .. ..... •..... ..... ..... ....•.

A

.. ...... ..... .. ..... .. ..... ..... . •..................................•

•.... B

...... ........ ..... .. ................ .. .. ..... •...... ...... ...... ....•.

•........... .. .. .

..... ..... ..... .....

•..................................•

Ordinate and abscissa parallel transformations A simple geometrical example can show that a polygon in a two-dimensional coordinate system can be moved in parallel with either of the two axes, which in general, results in different locations. The diagram above illustrates this idea.


180


Universal algebra considers operations abstractly. The label “universal” shows that the operational structures investigated do not need to be thought of as operations on some set of numbers. The function application operation of CL has a certain similarity to group multiplication, and it is even more similar to the binary operation of a groupoid. Group multiplication is not commutative — unless the group is Abelian. A groupoid multiplication is not even associative. A multiplication operation of a non-Abelian group or groupoid may be residuated, when there are two further operations appropriately related to multiplication. These other operations are called residuals. For example, a combinatorial reduction algebra from definition 6.2.8 would be residuated if there were two further binary operations → and ← satisfying b≤c←a

iff

a·b ≤ c

iff

a ≤ b → c.

The → operation resembles → from typed CL, which we introduce in chapter 9. An immediate question then is what corresponds to types that can be generated when ← is included. A connective like ← is quite well-known in nonclassical logics. (Sometimes another symbol, \ is used for essentially the same connective.) ← was introduced into sequent calculi, which do not contain structural rules.1 These sequent calculi, nowadays, are often called Lambek calculi, and they do not stipulate their fusion operation, ◦ , to be commutative. \ and / cannot be proved to coincide in either the associative or in the nonassociative Lambek calculus. This sort of connection between → , ← , and the combinators and dual combinators is pursued further in section 7.3 below. The idea of having functions that apply from the right-hand side is not as farfetched as it first might appear. Among programming languages, APL stands out as an early example that, in effect, uses suffix and infix notation for functions, because the parsing of strings and the execution of commands proceeds from the right — unlike in many other programming languages. Some other languages later also used suffix notation for functions.2 It is well-known that infix notation may be replaced by a parentheses-free prefix notation when each function has a fixed (and known) arity. A version of the prefix notation for the connectives of classical logic is still widely taught in introductory logic courses. It could be thought that the parentheses-free notation is helpful to students who fail to properly parenthesize strings of symbols to make them into wff’s; but as it turns out, they have just as much difficulty with parsing or writing wff’s in prefix notation. The prefix notation for sentential connectives is called “Polish notation,” because it was introduced by the Polish logician J. Łukasiewicz. In object-oriented programming, there is an interaction between methods and objects. For instance, a method called the replacement of a subobject might be applicable to both strings and trees. Of course, those objects are likely to have different 1 See

Lambek [] and Lambek []. Newer expositions may be found in many places — e.g., in Bimbó and Dunn [, Ch. 5]. 2 For instance, some Hewlett-Packard printers used to work with such a language.


Chapter 7.

Dual and symmetric combinatory logics

181

low-level implementations, that is, they are different data types. The replacement then is carried out differently too. However, when replacement(a, b) is evaluated, then the objects a and b are the ones that determine how replacement will be performed. These examples provide ample motivation for us to consider functions that are applicable from the right-hand side within CL. We adopt the notational convention that dual combinators are denoted by lowercase sans serif letters. The duals of the already introduced combinators will be denoted by the same (but small) letter. Dual combinators are constants just as combinators are. Having only dual combinators among the constants has some interest, but it is quite easy to see that this leads to a notational variant of CL. Unless we explicitly state otherwise, we assume that there are some combinators and some dual combinators in the set of constants. The definitions of terms and subterms are unchanged — see definitions 1.1.1 and 1.1.4. Exercise 7.1.1. Consider the set of CL terms that are generated by the duals of some

combinators together with an infinite set of variables. Define a translation between this new set of CL-terms and the set generated by the matching combinators together with variables. We could use the same symbol B in axioms of dual combinators, for example, to write xi B x . However, it will not cause confusion if we use the “dual symbol” C , which will emphasize that the dual combinators apply from the right. We use B and C , just as we might use with equivalent meaning ≥ and ≤ , when we switch the numbers too. The axioms for some dual combinators are as follows. We place the dual combinator as the head of a redex on the right-hand side of C , which is also in harmony with the use of 1 C as a symbol for one-step expansion in previous chapters. x C y(xk) xx C xm x yx C x y

zyx C z(y(xb)) y(zx) C z(y(xc)) zxy C z(y(xb0 ))

zy(zx) C z(y(xs)) y(yx) C y(x w) zx(zy) C z(y(xs0 ))

If we would consider only dual combinators as constants, then we could dualize the convention about omitting parentheses from right-associated sequences. However, we typically want to include both types of constants into one system. We cannot have in place though both conventions without introducing ambiguity. We wish to keep CL-terms unambiguous. This is the reason why the terms on the right-hand side of the C ’s contain parentheses — when the combinator is at least binary — unlike redexes in axioms for combinators. T HEOREM 7.1.1. (U NIQUE DECOMPOSABILITY ) Every term is uniquely decomposable, that is, every term has a unique formation tree. Proof: Formation trees for terms are introduced in section A.1, and they closely reflect the way in which terms are put together from their components.


182


A term is obtained from one of the clauses in definition 1.1.1. If the term M is a constant — a combinator or a dual combinator — then M is one of the two types of constants, but never of both. If M is a variable, then M is a variable in one way. In each of these cases, M is an atomic rather than a complex term, and belongs to exactly one category. If M is obtained by the last clause in definition 1.1.1, then M must be of the form (NP) . By the hypothesis of induction, N and P are uniquely decomposable, and then M is uniquely decomposable too. qed There are objects in mathematics that are not uniquely decomposable. For instance, strings from definition A.1.18 do not have a unique formation tree, despite the fact that each formation tree of a string has the same leaves. It is possible to define strings so that each string can be composed in only one way. This is rarely done, probably, because this causes the connection between the set of strings and a monoid to be lost (or at least to become hidden). Exercise 7.1.2. Form a string (not a CL-term!) that contains each of { B, k, x, C, w } . Draw all the possible formation trees for the string. (Hint: You might wish first to calculate the number of trees.) CL-terms are not strings, even when dual combinators are included into the language, and theorem 7.1.1 ensures that dual combinators do not introduce any ambiguity into the terms themselves. Definition 1.3.1 is unchangeably applicable to redexes that are headed by a combinator. However, we need to expand the notion of redexes to incorporate dual combinators.

D EFINITION 7.1.2. (R EDEXES ) If Zn is a combinator and zm is a dual combinator, then the terms ZM1 . . . Mn and (Nm . . . (N1 z)...) are redexes, and the displayed occurrences of Z and z are the heads of the redexes, respectively. The terms M1 , . . . , Mn are the arguments of Z ; similarly, N1 , . . . , Nm are the arguments of z . Example 7.1.3. Ix is a redex, and so is xi . On the other hand, iI is not a redex, whereas Ii is two redexes. I is the head of one of the redexes with argument i , and i is the head of the other redex with I as its argument. This is perhaps, the simplest example of a term in which two redexes overlap — indeed, as CL-terms coincide — but neither is wholly inside of an argument of the other one. Exercise 7.1.3. Find terms in which there is a redex headed by the combinator S and there is a redex headed by the dual combinator c and the two redexes are the same as CL-terms. Exercise 7.1.4. Find terms with redexes headed by W and b0 such that the redexes

overlap, however, they do not coincide as terms.


Chapter 7.


183

Exercise 7.1.5. Find terms with redexes headed by S0 and t such that the redexes

overlap, however, neither redex is wholly inside of an argument of the other constant. Looking at the axioms of the identity combinator and its dual, it appears that we should get two different results from Ii depending on which constant is applied to the other as its argument. This intuition mirrors the informal motivations we put forward earlier. We make the idea formal in the next definition, which expands definition 1.3.2. D EFINITION 7.1.4. (O NE - STEP REDUCTION ) Let z be an n -ary combinator or dual combinator that is a primitive. Let the axiom of z (with variables x1 , . . . , xn ) yield the term P . If N is a CL-term with an occurrence of a redex that has z as its head and M1 , . . . , Mn as the arguments, and N 0 is the replacement of that redex occurrence by the term by [x1 /M1 , . . . , xn /Mn ]P , then N one-step reduces to N 0 . This is denoted by N B1 N 0 . Notice that sizewise z is in between a combinator and a dual combinator. That is because the definition of one-step reduction does not distinguish between combinators and dual combinators; the difference between those constants surfaces in the shape of the redexes they form. Strictly speaking, definition 1.2.2 — the definition of substitution — is not applicable to the present case. However, the incorporation of dual combinators is quite straightforward, and so instead of repeating the definition, we assume that Z can be viewed as a little too tall small letter — with a little squinting. The addition of dual combinators does not lead to significant changes in the way how substitution and replacement are preformed. Therefore, we use the earlier definitions and notions with the obvious necessary modifications tacitly stipulated. The notion of weak reduction is unchanged, that is, it is the transitive, reflexive closure of one-step reduction. Of course, the set of CL-terms now is expanded, and so a term might contain a redex with a dual combinator as its head. Example 7.1.5. Let us consider the term x(M1 (M2 (M3 b))) , where M1 , M2 and M3 are terms. The subterm M1 (M2 (M3 b)) is a redex with the head b . Thus we have that x(M1 (M2 (M3 b))) B1 x(M1 M2 M3 ) and so x(M1 (M2 (M3 b))) Bw x(M1 M2 M3 ) . Depending on the shape of the terms M1 , M2 and M3 , there might be other redexes in the term in the above example. We saw in example 7.1.3 that a term, Ii that contains overlapping redexes headed by a combinator and by a dual combinator, can reduce to two terms that do not reduce to each other. We continue to use =w as the notation for weak equality, and this relation is the transitive symmetric reflexive closure of B1 as before. (Cf. definition 1.3.14.) Previously, S and K turned out not to be weakly equal; were I included as a primitive, I 6=w S and I 6=w K would be provable too. That is, all the primitive constants that we introduced with distinct axioms were not equal in the sense of =w . The case of the term Ii suggests that the situation might have changed with the inclusion of the dual combinators. Ii shows immediately that I =w i . First, we prove an easy lemma that becomes important now.


184


L EMMA 7.1.6. Let M be a term over the combinatory basis { I } , that is, the only atomic terms in M are I ’s.3 M Bw I . Dually, if M ∈ { i }⊕ , then M Bw i . Proof: If M is I , then obviously, M Bw I . Otherwise, M is (M1 M2 ) . By the hypothesis of the induction, M1 Bw I and M2 Bw I , hence (M1 M2 ) Bw II . But of course, II Bw I . We leave writing out the details of the dual case to the reader. qed The next lemma shows why the reductions of CL-terms built from identities is of any interest now. L EMMA 7.1.7. (I DENTITIES EQUATE ) Let B , a combinatory basis contain at least I and an n -ary proper dual combinator z1 . Then I =w z1 . Furthermore, zm 2 ∈ B implies z1 =w z2 , as long as z2 is proper. Dually, if i, Z ∈ B , where Z is proper, then Z =w i , and Z weakly equals to all proper combinators in B . i, I ∈ B implies that all proper constants in B are weakly equal. Proof: The crux of the proof is the CL-term I . . . Iz1 , where all the arguments of z1 are filled by I . Having performed n one-step reductions, we have that I . . . Iz1 Bw z1 . On the other hand, I . . . Iz1 Bw M , where M is a term that has only I as its atomic term (possibly, occurring repeatedly). Now that term weakly reduces to I . I =w z1 as the result. Next, it is sufficient to note that the only features of z1 that figured into the proof are that z1 is a dual and proper combinator. This means that the same steps — possibly, with m I ’s instead of n I ’s — can be repeated for a z2 . I =w z1 and I =w z2 give that z1 =w z2 . (The rest of the proof is easy and left as an exercise.) qed Exercise 7.1.6. Finish the previous proof.

Such a sweeping equating of constants should raise the alarm with respect to the consistency of the set of CL-terms with combinators and dual combinators. L EMMA 7.1.8. For any terms M and N from the set of terms over the combinatory basis { S, K, k, S } (with or without a denumerable set of variables), M =w N . That is, both { S, K, S, k }⊕ and ({ S, K, k, S }∪{ xi : i ∈ N })⊕ are inconsistent with respect to the weak equality relation. Proof: Let us consider the term Kx(yk) . Obviously, Kx(yk) B1 x and Kx(yk) B1 y . By the definition of the weak equality as the transitive symmetric reflexive closure of B1 , x =w y . We can substitute any term for x and y , that is, we may consider the term KM(N k) instead of the previous one. The two one-step reductions lead the M and N , respectively. Therefore, M =w N . qed 3 The

set of terms over a set of terms is given in definition A.1.20. The inclusion of dual combinators does not impact the definition except that the set of constants is potentially larger.


Chapter 7.


185

Both example 7.1.3 and lemma 7.1.8 show that the Church–Rosser property no longer holds for the set of all CL-terms given a combinatorially complete basis. Moreover, the mere inclusion of K and k suffices for all terms to turn out weakly equal to one another. We can pursue these themes further. Something much stronger can be proved concerning the Church–Rosser property about sets of terms with dual combinators. T HEOREM 7.1.9. (N O CONFLUENCE ) Let B be a combinatory basis that contains at least one combinator and at least one dual combinator, both of which are proper. There is a term M ∈ (B ∪ { xi : i ∈ N })⊕ such that M Bw N1 and M Bw N2 , but there is no term P to which both N1 and N2 reduce. Before we turn to the proof itself, we give some definitions and explanations about the proof. We have not emphasized so far that the classification of combinators in section 1.2 can be extended straightforwardly to include dual combinators as well. We already called i a dual identity combinator, and we can call m a dual duplicator, etc. Exercise 7.1.7. Write out the axiomatic characterizations for dual combinators that

are identities, associators, cancellators, permutators, duplicators and regulars. (Hint: The convention concerning omitting parentheses is unchanged, which may be a bit confusing.) The categorization of combinators and dual combinators is handy in the proof of the theorem. The next definition introduces a new category of combinators and dual combinators, which will be found surprisingly useful in the proof. This class of combinators and dual combinators is almost a subcategory of the cancellators. Incidentally, the combinators in this category are exactly those that were used in chapter 3 to represent the projection functions. D EFINITION 7.1.10. (V ERY SHORT COMBINATORS ) If Z is an n -ary combinator with axiom Zx1 . . . xn B xi (where 1 ≤ i ≤ n ), then Z is a very short combinator. Similarly, zn with axiom (xn . . . (x1 z)...) B xi is a very short dual combinator. The proof of theorem 2.1.14 used the notion of simultaneous one-step reduction, that we denoted by B p1 . This relation on CL-terms was confluent, and its transitive closure is Bw . The claim of theorem 2.1.14 was a universal statement, which applied to each and every CL-term. The claim that we wish to prove now is an existential statement. Notice that it is obviously false that we can demonstrate the lack of confluence starting with an arbitrary term. A variable x , for instance, weakly reduces only to itself, and x Bw x prevents us from using x to demonstrate the lack of confluence. This fact, of course, chould have been foreseen, because the term x is “not new,” so to speak. x is in the set of CL-terms when the only constants are combinators, and that set of the CL-terms is confluent. This observation leads us to look for terms that are new in the set of CL-terms when both combinators and dual combinators are permitted as constants.


186


Thus all CL-terms that do not have an occurrence of a dual combinator fall short of demonstrating the lack of confluence. A little bit of thought — and perhaps, exercise 7.1.1 — leads us to the conclusion that all CL-terms that are void of at least one combinator, whether they do or do not contain a dual combinator, are also unsuitable to prove the failure of the Church– Rosser property. So far, we established that a term that could show the lack of confluence must have at least a combinator and at least a dual combinator in it. We can still further delineate the set of terms that cannot exhibit confluence with respect to weak reduction. However, we delay doing that until definition 7.1.14 after the proof of theorem 7.1.9 and theorem 7.1.11. To sum up, we have to select terms carefully to be able to show that after two weak reductions the resulting terms do not reduce to a common term. A further difficulty is that we are not considering a concrete combinatory basis like { S, K, k, S } or { S, s } , but we made a claim concerning all bases B such that { Zn , zm } ⊆ B , where m, n ∈ N , and Zm , zn are proper constants. Instead of the elegant proof for theorem 2.1.14, which relied on confluence being preserved under transitive closure, now we get a lengthy proof by cases. The description of the cases is where we make use of the categorization of the combinators. We have only one category in which the reduct of a redex is fully described, namely, the category of identity combinators and their duals. A way to look at the following proof is that the versatility of our constants together with the existential character of the claim is what complicates the proof. After all the preliminary remarks about the context and the style of the proof, we turn to the proof itself. Proof: All the cases involve two overlapping redexes one of which has a combinator as its head, whereas the other has a dual combinator as its head. A complete proof — including all the cases — is given in []. Here we include only a couple of cases for the sake of illustration. Case 1. Let us assume that Zn is a very short combinator with axiom Zx1 . . . xn B xi . We have assumed that there is a dual combinator in the basis, let us say zm . As always, there is a denumerable set of variables available to us. For the sake of transparency, we use both x ’s and y ’s. The x ’s fill in most of the arguments of Z and the y ’s are placed into most of the arguments of z . The overlap between the redexes implies that one of the arguments of Z is a complex term, which contains z and possibly some y ’s, whereas one of the arguments of z is a complex term, which contains Z and possibly some x ’s. In particular, we arrange the overlap to occur in the i th argument place of Z . The next term and the following two one-step reductions show the lack of confluence. Zx1 . . . (ym−1 . . . (y1 z)...)i . . . xn

B1 (ym−1 . . . (y1 z)...)

M 1C

M ∈ { Zx1 . . . xi−1 , ym−1 , . . . , y1 , xi+1 , . . . , xn }⊕ , and depending on what kind of dual combinator z is, the shape of M varies. But we do not need to concern ourselves with


Chapter 7.


187

the properties of z at all. It is sufficient to note that z does not occur in M , because z is a proper dual combinator, whereas z occurs in (ym−1 . . . (y1 z)...) . Moreover, the latter term is not a redex. This means that confluence could obtain only if M Bw (ym−1 . . . (y1 z)...) could happen. But even if M contains a redex, that redex is headed by an occurrence of Z , which is a proper combinator that cannot introduce z via Bw . Case 2. We may assume that Zn is not a very short combinator, which means that Zx1 . . . xn B M , where `(M) ≥ 2 . Of course, M ∈ { x1 , . . . , xn }⊕ as before. For this particular case, we assume that M has a subterm (xi x j ) , where i 6= j . If Z is not very short, then inevitably, there is at least one subterm that is formed from two variables. Those may be occurrences of distinct variables (like xi and x j ) or of one variable (like xk ). (Some cases in the proof, which we will not recall here, deal with combinators that yield a term that has only one or more subterms of the form (xk xk ) .) We also assume that Z is not a duplicator for i . Of course, we tacitly assume that 1 ≤ i, j ≤ n . The index i in (xi x j ) is the same i for which argument Z is not a duplicator. Lastly, we assume that N C (ym . . . (y1 z)...) . We consider a term — followed by two one-step reductions. Zx1 . . . (ym−1 . . . (y1 z)...)i . . . xn

B1 [(xi x j )/((ym−1 . . . (y1 z)...)x j )]M

([ym /Zx1 . . . xi−1 ]N)xi+1 . . . xn 1 C

Again, the reduction of the redex that has z as its head leads to a term in which there are no occurrences of z , because z is a proper combinator. However, the term on the left, [(xi x j )/((ym−1 . . . (y1 z)...)x j )]M is such that it has a nonredex occurrence of z . That is, z occurs in the term, but there is no redex in the term. It is obvious that the two one-step reductions resulted in distinct terms, and no confluence obtains in this case. Case 3. For this case we continue to assume that Z is not a very short combinator and that M , the term in the axiom of Z , has a subterm of the form (xi x j ) with i 6= j . We also assume that Z is a duplicator for i . (We can make this assumption, because in the previous case we have considered that Z is not a duplicator for i .) Our assumption about z is that it is not a cancellator for its last argument, that is, if (ym . . . (y1 z)...) B N is z ’s axiom then ym occurs in N . Let us consider the same term as in the previous case. Zx1 . . . (ym−1 . . . (y1 z)...)i . . . xn

B1 . . . ((ym−1 . . . (y1 z)...)x j ) . . .

N 1C

The subterm that is displayed on the left is intended to emphasize that z has at least one nonredex occurrence in that term. xi has more that one occurrence in M , the reduct in the axiom of Z . However, the complex term (ym−1 . . . (y1 z)...) remains intact even if further B1 steps are possible — due to our supposition that z is not a final cancellator. To see this, consider that if (ym−1 . . . (y1 z)...)x j is a subterm of a redex occurrence of z , then it is necessarily a subterm of the last argument of the dual combinator. This means that no further reductions — if there are any possible — can result in a term that has no occurrence of z .


188


On the other hand, the term N does not contain any occurrences of z , but it contains at least one occurrence of Z . We have not stipulated anything about z except that it does not cancel its m th argument; therefore, we do not know whether N reduces to a term that has no occurrences of Z or not. However that is unimportant. Z is a proper combinator and so no matter if N does or does not reduce further, it surely does not reduce to a term that contains z . Case 4. Now we change our assumption about z , and further refine the assumptions concerning Z . Let Z be, as before, not a very short combinator, but let Z be a duplicator for its i th argument place. Again, Zx1 . . . xn B M with a subterm (xi x j ) , where i 6= j , in M is stipulated. M might have several occurrences of (xi x j ) , but we assume that at least one of the occurrences of (xi x j ) is not in a subterm of the form ((. . . (xi x j ) . . .)xi ) . For z , we assume that it is a cancellator for its m th argument. (This possibility is complementary to the assumption in the previous case.) We consider a term — together with two one-step reductions. Zx1 . . . (ym−1 . . . (y1 z)...)i . . . xn

B1 . . . ((ym−1 . . . (y1 z)...)x j ) . . .

N 1C

All three terms, the one we started with, the term on the left, and the one on the right look very similar to those in the previous case. However, they are not the same terms. (The similarity is apparent, and it is due to the partial specification of Z and z , as well as of their reducts.) Despite the differences, the reasoning that allows us to conclude the failure of confluence in this case is like the preceding one. We may suppose that the displayed subterm on the left is the subterm that is not in the last argument of an occurrence of z . Then even if further reductions of redexes headed by z are possible, the exhibited occurrence of z remains in any further terms that can result. Once again, N has no occurrence of z , because z is a proper combinator, and z does not occur in an argument of z in the term we started with. This shows that the two terms cannot reduce to a common term. These sample cases show some of the typical features of the structure of this proof. The rest of the proof may be found in the paper we cited above. qed Undoubtedly, a proof that would be shorter and would have fewer cases and subcases would be more elegant and more easy to comprehend. Exercise∗∗∗ 7.1.8. Find a better arrangement of the possibilities or find a completely

different but more elegant proof for the theorem. (Hint: This is a completely openended exercise, which might turn out to be the size of a huge project.) Our theorem appears to have a certain limitation: we only considered proper combinators and proper dual combinators. We know that the fixed point combinator is important, and we also know that it is definable from proper combinators. In the proof of theorem 7.1.9, however, we relied on the possibility of placing terms into various argument places of combinators. Thus it is not immediate that if the fixed point combinator or the dual fixed point combinator are primitive, that is, included


Chapter 7.

189


into or constitute the combinatory basis then the Church–Rosser property should invariably fail. T HEOREM 7.1.11. (N O CONFLUENCE WITH FIXED POINT CONSTANTS ) Let B be a combinatory basis that contains at least one combinator and at least one dual combinator, and at least one element of B is a fixed point constant, that is, Y ∈ B or y ∈ B . Then there is a term M ∈ (B ∪ { xi : i ∈ N })⊕ such that M Bw N1 and M Bw N2 , but there is no term P to which both N1 and N2 reduce. Proof: The combinatory bases that satisfy the stipulation in the above statement are “more concrete,” so to speak, than those in 7.1.9. We know that at least one of the combinators is a fixed point combinator or its dual. Thus we need to consider only three cases, and two of those are each other’s duals, hence we omit one of them. Case 1. Let us assume that we have Y in B , as well as a proper dual combinator zm . The term and the two one-step reductions we consider are Y(ym−1 . . . (y1 z)...)

B1 (ym−1 . . . (y1 z)...)(Y(ym−1 . . . (y1 z)...))

M 1C .

The term M does not contain any occurrences of z , because z is a proper combinator. On the other hand, the first occurrence of the subterm (ym−1 . . . (y1 z)...) is not a redex and it does not overlap with the redexes (Y(ym−1 . . . (y1 z)...)) . The latter implies that the first occurrence of (ym−1 . . . (y1 z)...) remains a subterm of all terms to which (ym−1 . . . (y1 z)...)(Y(ym−1 . . . (y1 z)...)) reduces. This establishes that the Church–Rosser property does not hold. Case 2. Now we consider the fully concrete combinatory basis { Y, y } . (Given Case 1 and its dual, the only remaining possibility is that there are no proper combinators or dual combinators in B ; hence, B contains only the fixed point constants.) We would like to form a term that comprises two redexes, one headed by Y and the other by y . Both Y and y are unary, and so there are not many terms to choose from. Indeed, we can create the following term only. Yy

B1 y(Yy)

YyY 1 C

Of course, neither term is in weak normal form. Indeed, both terms have infinite one-step reduction sequences. Some of the terms to which y(Yy) reduces are as follows. y( y(Yy)),

y(YyY),

y( y( y(Yy))),

y(YyYY),

y( y(Yy)Y)

Some of the terms to which YyY reduces are YyYY,

YyYYY,


y(Yy)Y,

y( y(Yy))Y,

y(YyY)Y.

190


It might be confusing that all these terms are built from y ’s of various sizes with parentheses inserted here and there. However, a little thought and some careful parsing of the terms show that y(Yy) reduces to terms that are of the form yM (with various terms in place of M ), whereas YyY reduces to terms that are of the form N Y (with different complex terms in place of N ). This latter fact is slightly disguised by the convention of omitting parentheses from left-associated terms, which to start with, allows us to write YyY in lieu of (Yy)Y . qed There are infinitely many — ℵ0 -many, to be precise — terms that cannot be used to demonstrate the lack of confluence. Given that there are just as many CL-terms, it may appear as if “practically all” CL-terms are confluent. But, with a little thought, it is quite obvious that in each case in both proofs above, there are ℵ0 -many terms that can show that the Church–Rosser property fails. Exercise 7.1.9. Substantiate the claim in the preceding sentence. (Hint: Just as it

is easy to delineate a denumerable set of confluent terms, it is easy to delineate a denumerable set of nonconfluent terms provided we have already found one nonconfluent term.) We might reiterate that all the terms that we used in the proofs of theorems 7.1.9 and 7.1.11 had at least two redexes such that a dual redex overlapped with a redex. Unfortunately, the absence of a pair of overlapping redexes in a term — one headed by a combinator, another headed by a dual combinator — is not sufficient to guarantee confluence “in the long run.” Example 7.1.12. Let us consider the CL-term KKxy(z((zk)k)) . The term contains two redexes: KKx and (z((zk)k)) . Obviously, these two subterms do not overlap in KKxy(z((zk)k)) ; the term is not even composed of these two subterms as its immediate subterms. However, KKxy(z((zk)k)) B1 Ky(z((zk)k)) , and also KKxy(z((zk)k)) B1 KKxy(zk) . Both these terms contain two redexes, but this time the redexes overlap. Furthermore, one-step reductions of both terms can yield Ky(zk) . However, the latter term not only contains overlapping redexes, but it is the “archetypical” CL-term, which involves a combinator and a dual combinator and can be used to show nonconfluence and even inconsistency. Of course, Ky(zk) Bw y and Ky(zk) Bw z . The lack of overlap between a redex and a dual redex is not sufficient condition for confluence, when the term contains a combinator and a dual combinator. On the other hand, the overlap between a redex and a dual redex is not a sufficient condition for the lack of confluence. Exercise 7.1.10. Find a term in which K and k head overlapping redexes, nonetheless,

the reduction sequences of the term converge. A slight modification of the term in example 7.1.12 can give us a term, for instance, KKxy(z(zk)) , which eventually — in some sense — reduces to exactly one term, namely, y . This term is not very different from the CL-term KKxy(Kzz) , which does not contain any dual combinators. KKxy(z(zk)) Bw Ky(z(zk)) and KKxy(Kzz) Bw


Chapter 7.

191


Ky(Kzz) . In the resulting terms, the redexes z(zk) and Kzz , respectively, are fully inside the argument of the initial K . There are terms, which do not involve cancellators and still, they do not show the lack of confluence despite containing overlapping redexes.

Example 7.1.13. Let us consider Z21 and z22 with axioms Z1 x1 x2 B x1 x2 x1 and x2 (x1 z2 ) B x2 x1 x1 . Both constants are duplicators for their first argument, and additionally, Z1 is a permutator, whereas z2 is an associator. The following term and two pairs of one-step reductions show that the term reduces to the same term no matter which redex is reduced first. Z1 x(xz2 )

B1 x(xz2 )x B1 xxxx

xxxx 1 C Z1 xxx 1 C

The starting term has two overlapping redexes, and neither redex is wholly inside of an argument of a constant. Admittedly, we choose the constants carefully, and this time, we filled the arguments by the same variable x . However, there seems to be no easy way to exclude terms like Z1 x(xz2 ) or to give a general characterization of such terms. Exercise 7.1.11. Find a term with occurrences of Z1 , z2 and x (only), which can

show the lack of confluence. Exercise 7.1.12. Find other terms, with converging reduction sequences in which

overlapping redexes are headed by combinators and dual combinators that were not mentioned in the last couple of examples. Exercise∗ 7.1.13. Determine whether it is possible to construct a term with overlap-

ping redexes in which the arguments of the combinator are filled out with x ’s, and the arguments of the dual combinator are filled out with y ’s (except at the place of the head of the other redex), so that the term still reduces to the same term eventually. It would be good to have a characterization of terms that do not have the diamond property with respect to Bw . As we tried to illustrate, there is a “gray area” in which we do not have concepts of shape that would allow us to capture exactly the boundary between CL-terms that do and do not lead to nonconfluence. Of course, we have the notion of the diamond property itself and so together with Bw we have one kind of characterization. But we would like to have another characterization that is independent of those notions. We can give a description of a set of terms that surely have the diamond property — even though we know that this characterization is not exhaustive in the sense that some CL-terms that cannot be used to show the failure of the diamond property do not belong to this set. D EFINITION 7.1.14. (S AFE TERMS ) (1) or (2) is true of M .

Let M be a CL-term. M is a safe term iff

(1) M has no redex occurrences of a combinator or of a dual combinator;


or

192


(2) M has only redex occurrences of combinators or dual combinators, and for any two redexes, (a) they do not overlap; or (b) if N1 and N2 are two overlapping redexes in M , then either N1 is fully inside of an argument of the head of N2 , or the other way around. The terms we started with in each of the cases in the proofs of theorems 7.1.9 and 7.1.11 were not safe, which should be the case given our motivation for defining safe terms. However, the CL-term from example 7.1.13 is not safe either. The next lemma ensures that some sets of CL-terms that we already considered are subsets of the set of safe terms. L EMMA 7.1.15. All CL-terms that do not contain a dual combinator are safe. Dually, all CL-terms that do not contain a combinator (though perhaps contain dual combinators) are safe. Proof: Clearly, many CL-terms, which do not have occurrences of dual combinators, fall under clause (1), because they are atomic. Or if they are not atomic, the combinator that occurs in them is not the head of a redex. If a CL-term contains just one redex, then (2) obtains vacuously. If there are at least two redexes, then they are either pairwise disjoint, or some of them overlap. The former situation obviously satisfies (a) in (2). We really need to scrutinize the case when there is an overlap. If there are only combinators (but no dual combinators) in a CL-term, then a redex can completely coincide only with itself. In other words, if M and N are two redexes, then one is a proper subterm of the other. Now let M and N be two redexes. They are both headed by a combinator, let us say, by Zn1 and Zm 2 , respectively. Thus M is Z1 M1 . . . Mn and N is Z2 N1 . . . Nm , and both terms are left-associated. Without loss of generality, we may stipulate that N is a proper subterm of M . Then N is one of the Mi ’s or N is inside of one of the Mi ’s, which falls under (b) in (2). Indeed, it is well-known that redexes can overlap only this way in CL without dual combinators. The dual case is similar; hence, we omit the details. qed Example 7.1.16. All terms — whether atomic or not — that have only variables as their atomic subterms are safe, because in such a term there is no occurrence, hence there is no redex occurrence of a combinator or of a dual combinator. The term KKxy(z((zk)k)) from example 7.1.12 is not safe, because some occurrences of the constants do form redexes, but some others do not. The difficulty is that after some B1 steps the combinator and the dual combinator that originally headed no redexes became heads of overlapping redexes (which do not satisfy (b) in (2)). The terms KKxy(z(zk)) and KKxy(Kzz) are not safe either. However, if we drop the first occurrence of K from either term, then we get two safe terms, namely, Kxy(z(zk)) and Kxy(Kzz) . Another potential modification to turn the original CLterms into safe one is by restructuring the terms as K(Kxy)(z(zk)) and K(Kxy)(Kzz) . The former two terms’ nf is xz , whereas the latter two ones’ nf is x .


Chapter 7.


193

Safe terms can be characterized by appealing to how they can be constructed. Accordingly, the definition is similar to, but not the same as the definition of CLterms in general. D EFINITION 7.1.17. (S AFE TERMS , 2) The set of safe terms is defined as the union of the sets of terms obtained by (1)–(4) (the set of whole terms), and by (5)– (6) (the set of nonredex terms), respectively. (1) If x is a variable, then x is a whole term; (2) if Zn is a combinator, and M1 , . . . , Mn are whole terms, then ZM1 . . . Mn is a whole term; (3) if zn is a dual combinator, and M1 , . . . , Mn are whole terms, then the term (Mn . . . (M1 z)...) is a whole term; (4) if M and N are whole terms, then (MN) is a whole term. (5) If M is a variable or a constant, then M is a nonredex term; (6) if M, N are nonredex terms, and M is not of the form Zn P1 . . . Pn−1 , and N is not of the form (Pn−1 . . . (P1 zn )...) , then (MN) is a nonredex term. The crucial clauses are (2) and (3) which require that all the arguments of a combinator or of a dual combinator are filled out by safe terms. Exercise 7.1.14. Show that definition 7.1.14 and definition 7.1.17 yield the same subset of CL-terms. (Hint: The two inductive parts of definition 7.1.17 generate sets that have some common elements.)

It may be interesting to note that the complement of the set of safe terms is not closed under Bw . We can demonstrate this by finding just one CL-term, which is not safe, but reduces to a safe one. KxKy(z(zk)k) is such a term: KxKy(z(zk)k) B1 xy(z(zk)k) . A more interesting question is if the set of safe terms is closed under Bw . L EMMA 7.1.18. (S AFE TERMS REDUCE TO SAFE TERMS ) If M is a safe term that contains occurrences of only proper or fixed point combinators and dual combinators, then M Bw N implies that N is a safe term. Proof: Clearly, we can easily dispense with all the safe terms that are safe due to clause (1) in definition 7.1.14. Otherwise, if M Bw N , then either M is N , or there are B1 steps linking M to N . If M is N , then the claim is obviously true. Let us assume that M 0 resulted by n B1 steps from M . The assumption that M 0 itself is safe. We may also assume that N is yet another B1 step away from M 0 — otherwise, N is safe due to previous considerations. If the redex reduced in getting from M 0 to N is a stand-alone redex, then the claim is obviously true: this B1 step replaces a subterm with a subterm leaving the rest of the term intact, and the new subterm can contain a redex only if the head is a fixed


194


point constant. However, in that case the new redex is like the old one, hence the term remains safe if it was. The more involved cases are the following two. M 0 may contain a redex P that contains inside some of its arguments further redexes, or P itself may be inside an argument of another redex. The reduction of P replaces that subterm with one that is itself safe, because P was safe. A one-step reduction cannot alter the internal structure of the arguments of a constant. In fact, it does not matter whether P is within a redex or contains redexes in its arguments. Replacing the term that is an argument in a redex with another term does not destroy the redex. Thus N is safe too. qed We note that the definition of simultaneous one-step reduction (definition 2.1.6) can be adopted as it is for dual combinatory logic. We simply assume that the notion of redexes is the one in definition 7.1.2, which includes dual redexes too. The simultaneous one-step reduction is unchangeably situated between one-step reduction and weak reduction. L EMMA 7.1.19. If M B1 N, then M B p1 N. If M B p1 N, then M B p1 P1 . . . Pn−1 B p1 Pn B p1 N for some n , or M is N . Proof: The first claim is obvious. For the second claim, we note that B p1 is reflexive, and if M B p1 N by reflexivity, then M is N . If there is exactly one redex reduced, then the claim is again obvious. Lastly, for the truth of the claim, it is sufficient to observe that if the redexes do not overlap, then their respective one-step reductions do not affect each other. Therefore, they can be preformed in a sequence too. qed It may be worthwhile to point out that even if the simultaneous one-step reduction of a set of nonoverlapping redexes produces a nonsafe term, the B p1 step can be emulated by a series of one-step reductions. This is the reason why we did not stipulate that M is safe as a condition in the lemma. We can now turn to proving that the set of safe terms has the Church–Rosser property. Theorems 7.1.9 and 7.1.11 showed that trying to select a subset of combinators and dual combinators in order to ensure that the generated set of CL-terms has the Church–Rosser property is futile. The concept of safe terms carves out a proper subset of CL-terms along different lines: it restricts how terms can be constructed. T HEOREM 7.1.20. If T is the set of safe CL-terms generated by a combinatory basis B comprising proper and fixed point constants only, then for any M ∈ T , M Bw N1 and M Bw N2 imply that there is a P ∈ T such that N1 Bw P and N2 Bw P . Proof: T is the set of safe terms. M ∈ T , hence by lemma 7.1.18, N1 and N2 are also safe. If P with the property N1 Bw P and N2 Bw P is found, then it follows that P is safe, and also that P ∈ T . We have reaffirmed that the B p1 relation is sandwiched between one-step and weak reduction. Thus we only have to show that B p1 has the Church–Rosser property on safe terms. This step is similar to the proof of lemma 2.1.13 — except that we consider only safe terms.


Chapter 7.


195

Let us assume that M is atomic. Then N is M , which is sufficient for the diamond property to hold. 2. Now let us assume that M is complex, for instance, (M1 M2 ) . If M does not contain redexes (e.g., because all occurrences of all combinators and dual combinators are in nonredex position), then M B p1 M only. Hence, confluence follows — exactly as in case 1. The same is true when there are redexes in M , but the set of selected redexes is empty. There are two subcases that we have to scrutinize. M itself may be a redex and may be reduced in one of the B p1 moves, or all the redexes are inside of M1 and M2 . It is important to note that M cannot be a redex in two ways, that is, M cannot be of the form Zn N1 . . . Nn−1 M2 and at the same time of the form M1 (Qm−1 . . . (Q1 zm )...) . This possibility is excluded by the stipulation that M is a safe term. If M is of the form Zn N1 . . . Nn−1 M2 , then it is excluded — for the same reason of being a safe 0 . . . M 0 . The dual term — that M is also of the form M 0 (Qm−1 . . . (Q1 zm )) . . . Mi+1 n case, when M is a dual redex and it contains a redex not fully confined to one of the arguments of the head of the dual combinator, is excluded as well. 2.1 If M is a redex with a combinator as the head, then M is Zn N1 . . . Nn , that is, M1 is Zn N1 . . . Nn−1 and M2 is Nn . All other redexes in the term are completely inside of one of the N ’s, because M is safe. The one-step reductions of nonoverlapping redexes from the Ni ’s yield some Ni0 ’s. (For notational convenience, we write Ni0 ’s for all i , with the understanding that if no redex was reduced in one of the Ni ’s then Ni0 really is Ni .) Then if ZN1 . . . Nn B1 N and each Ni B p1 Ni0 , then N B p1 P as well as ZN10 . . . Nn0 B1 P . The common term is [Nn /Nn0 , . . . , N1 /N10 ]N . (The dual case when M is headed by a dual combinator is similar.) 2.2 If M is not a redex, or it is not a redex that is reduced in the B p1 step, then all the redexes are subterms of either M1 or M2 . We know that since M is safe, so are M1 and M2 . Having apportioned the redexes between M1 and M2 for both reductions M B p1 N1 and M B p1 N2 , we have that M1 B p1 N11 and M2 B p1 N12 , and M1 B p1 N21 and M2 B p1 N22 . The N11 B p1 P1 and N21 B p1 P1 , and similarly, N21 B p1 P2 and N22 B p1 P2 , by hypothesis. M1 and M2 do not overlap; therefore, N1 B p1 P1 P2 and N2 B p1 P1 P2 . The term P1 P2 is a suitable P . This concludes the proof that B p1 has the Church–Rosser property on safe terms. As before, we know that transitive closure is a monotone operation, and it preserves confluence. Then by lemma 7.1.19, Bw has the Church–Rosser property on the set of safe terms. qed 1.

Exercise∗ 7.1.15. Give a conceptually different proof of the previous theorem. (Hint:

Try to make the alleged similarity between the proof of lemma 2.1.13 and the above proof rigorous based on example 7.1.16.) It might appear that the restriction to safe terms is too strong, and it indeed may be. However, it is not clear how to enlarge the set of safe terms without risking the loss of confluence. One idea could be that it is sufficient to require that M reduces to a safe term. On a second glance, this is clearly not sufficient. For instance, the term KKxy(z(zk)k) does reduce to a safe term, namely, to y . But KKxy(z(zk)k) Bw y and


196


KKxy(z(zk)k) Bw z , that is, there is a safe term to which KKxy(z(zk)k) reduces, but

this does not show confluence. Another idea could be that the real problem with terms like KKxy(z(zk)k) , which is not a safe term but which is also not a term with overlapping redexes and dual redexes, is that there are one-step reductions that lead to a nonsafe term that contains a redex and a dual redex, which overlap. We can expand the set of safe terms to the set of mild terms. Before that we give a name to the CL-terms that we indisputably want to separate out, because all the starting terms in the proofs of theorems 7.1.9 and 7.1.11 belong to this set. D EFINITION 7.1.21. (TANGY TERMS ) M is a tangy CL-term iff there is a redex and a dual redex in M that overlap, and neither redex is completely inside of an argument of the head of the other redex. The set of safe and tangy CL-terms are disjoint sets, however, their union is not the set of CL-terms — as long as there are combinators and dual combinators in the language. The informal idea is that tangy terms are likely to reduce to terms that will not further converge. Example 7.1.13 shows that this is not always the case, however, nontangy terms can lead to nonconfluence only if reductions pass through a tangy term. D EFINITION 7.1.22. (M ILD TERMS ) to a tangy term.

M is a mild CL-term iff M does not reduce

Example 7.1.23. The term KKxy(z(zk)k) is not mild but not tangy either. We have seen that this term reduces to a tangy term, hence it is not mild. A term that looks very much like the previous one, Kx(Ky)(zk(zk)) is not safe, because some occurrences of the constants are not in a head position within a redex. The term is not tangy, because the two redexes in the term do not overlap. This term is mild because the only possible B1 steps lead to Kx(Ky)z and x(zk(zk)) . The latter terms clearly cannot reduce to tangy terms, hence these three terms are all mild. A difference between the safe and tangy terms on one hand, and the mild terms on the other, is that given a term, it can be determined by analyzing the shape of the term if it belongs to either of the first two categories, whereas reductions may have to be considered in order to determine if a term is mild. Exercise∗ 7.1.16. Describe a procedure which will generate all the terms that have to

be scrutinized to determine if a given term is mild or not. L EMMA 7.1.24. The complement of the set of tangy terms is not closed under weak reduction. The set of mild terms is closed under weak reduction. Exercise 7.1.17. Prove the lemma. (Hint: The proof is nearly immediate from the

definitions of the tangy and mild terms together with some examples we considered.) Mild terms are indeed well-behaved: they do not cause divergence, let alone inconsistency.


Chapter 7.


197

L EMMA 7.1.25. The simultaneous one-step reduction on the set of mild terms has the Church–Rosser property. Proof: The structure of the proof is similar to the proof of theorem 7.1.20. However, we group the cases differently — for the sake of transparency. 1. If either or both of the terms N1 , N2 resulting from M by B p1 are M , then the truth of the claim is immediate. 2. If N1 and N2 are the same term, then again, N1 is sufficient for the truth of the claim. 3. Let M, N1 and N2 be distinct, but of course, M B p1 N1 and M B p1 N2 . It follows that M is of the form M1 M2 , for some M1 and M2 . The set of redexes in each B p1 step is pairwise disjoint, hence M Bw N1 and M Bw N2 . Then N1 and N2 are mild terms too, moreover, all terms (if there are any) between M and N1 , N2 — obtained by B1 steps — are also mild. We consider the shape of (M1 M2 ) . M itself may be a redex or a dual redex (but not both), and this may be the sole (dual) redex reduced in one of the two initial B p1 reductions. However, then all other redexes and dual redexes must be inside of the arguments of the head, because M is a mild term. This case is like 2.1 in the proof of theorem 7.1.20. This situation is essentially the same as when M is safe. It may be that M is not a redex or a dual redex. (Or M may be a redex or dual redex, but the B p1 steps do not include this (dual) redex in the set of nonoverlapping redexes that are reduced in either B p1 step. We will proceed with the weaker assumption, namely, without assuming that M is a redex or a dual redex.) All the nonoverlapping redexes are inside M1 and M2 . M is a mild term, hence M1 and M2 are mild as well. Clearly, M1 , M2 B p1 N1 means that N1 is N11 N12 , and similarly, M1 M2 B p1 N2 implies that N2 is N21 N22 . There is a P1 to which N11 and N21 reduce via B p1 , and similarly, there is a P2 , such that N21 B p1 P2 and N22 B p1 P2 . Therefore, (P1 P2 ) is a term that ensures confluence. qed Exercise∗∗ 7.1.18. Find a characterization for mild terms without quantifying over all the terms to which a CL-term reduces or show that no such description is possible.

(Hint: A completely new approach might be needed to understand how redexes can be created and how they can interact.) Exercise∗∗ 7.1.19. Give an exhaustive characterization of CL-terms that have only

converging reduction series. (Hint: The question is to be understood as asking for a solution of the potential difficulty which is to find a way to define this set without appealing to all the reducts or to all the reduction sequences of a term.)

7.1.1

Inequational and equational theories

Dual combinatory logic also can be presented in the form of equational and inequational theories. The lack of confluence may or may not be an undesirable property — depending on the context in which the CL-terms are used. If the Church– Rosser property holds with respect to some reduction relation, then the set of CL-


198


terms is consistent with that relation. However, if the Church–Rosser property does not hold for a reduction relation, then it does not follow that the set of CL-terms with that relation added is inconsistent. Of course, in the latter situation, consistency does not follow either. We start with inequational systems. We first take the combinatory basis B1 = { S, K, k, S } and a denumerable set of variables. The choice of the combinatory basis affects only the set of the axioms, and this is the most powerful basis we can choose. Let us reconsider the axioms and rules that we introduced in chapter 5 together with two new axioms. We denote this system by IQB1 . x≥x

id

M≥N [x1 /P1 , . . . , xn /Pn ]M ≥ [x1 /P1 , . . . , xn /Pn ]N M≥P P≥N M≥N M≥N PM ≥ PN Sxyz ≥ xz(yz) Kxy ≥ x

ml

S

K

sub

tr

M≥N MP ≥ NP

mr

z(y(xS)) ≥ zy(zx) y(xk) ≥ x

s

k

The new axioms are those for s and k . It may be interesting to note that previously ml and mr expressed that terms reduce in argument places just as they do standing alone, whereas mr expressed that arguments preserve reduction between functions. Now the two rules are are completely alike, because there are functions that apply from the right-hand side. The notion of a proof is as before. We can define inconsistency to be the provability of M ≥ N , for all M and N . L EMMA 7.1.26. (VARIABLE CONSERVATION ) If M ≥ N is provable in the inequational calculus IQB1 , then x occurs in N only if x occurs in M . Proof: The proof is by structural induction on proofs. 1. There are five axioms in IQB1 . The claim is quite obvious for the identity axiom, as well as for the S and s axioms. Let us consider Kxy ≥ x . Only x occurs on the right-hand side of ≥ , and x does occur on the left, as needed. The axiom for k is similar, in fact, with respect to the occurrences of variables it does not matter from which side the constant is applicable. 2. In the case of the rules, we suppose that the claim holds for all the premises. Let us consider the substitution rule first. If x occurs in [x1 /P1 , . . . , xn /Pn ]N , then there


Chapter 7.

199


are two possible ways how this could happen. x could have been introduced by a Pi , or x could have remained in N after the substitutions. If x occurs in Pi (where 1 ≤ i ≤ n ), then xi must have had at least one occurrence in N , otherwise, x would not occur in the term that results from the substitution. By the hypothesis of the induction, xi occurs in M too. Since Pi is substituted in M for xi , x occurs in [x1 /P1 , . . . , xn /Pn ]M . The other case is even more straightforward: if x occurs in N after the substitution because it occurred in N , then x is not one of the xi ’s. By hypothesis, x occurs in M , and due to its distinctness from the xi ’s, it is retained after the substitution. The monotonicity rules are easy to verify, and we leave that to the reader. Let us quickly glance at the transitivity rule. If x occurs in N , then by hypothesis, x occurs in P , and further it occurs in M . This completes the proof. qed The calculus IQB1 can prove that Kx(yk) ≥ x and Kx(yk) ≥ y . Here are the derivations. z(yk) ≥ y Kxy ≥ x [y/yk]Kxy ≥ x Kx(yk) ≥ y On the left-hand side, we used the substitution [y/yk] and did not carry out the substitution to make it obvious. On the right-hand side, we started with a variant of the k axiom, which itself could be obtained by [y/z] , and we performed the [z/Kx] substitution on the bottom line. Both proofs utilize substitution, but the two proofs start with different axioms. The two derivations also make explicit that one of the constants is “inactive” in each proof, because its axiom is not used in obtaining the bottom inequality. L EMMA 7.1.27. There is no CL-term M such that for all N , M ≥ N is provable in IQB1 . Proof: The claim is almost a consequence of lemma 7.1.26. We only have to add that M — as any CL-term — is finite, that is, `(M) ∈ N . For the sake of concreteness, let us assume that `(M) = n . We can choose n + 1 distinct variables: x1 , . . . , xn+1 . Were M ≥ xi provable for each i , where 1 ≤ i ≤ n + 1 , by lemma 7.1.26, xi would occur in M . However, this contradicts `(M) = n . qed The inequational presentation of dual CL is not more and not less powerful than the presentation where we start with CL-terms, and we use substitution and replacement to characterize relations on the set of the CL-terms. Exercise∗ 7.1.20. Prove that if M Bw N in the set of CL-terms over the combinatory

basis B1 , then IQB1 proves M ≥ N , and vice versa. We can extend the IQB1 calculus by extensionality rules. We denote the resulting η system by IQB1 . Mx ≥ Nx x ∈ / fv(MN) M≥N


extr

xM ≥ xN x ∈ / fv(MN) M≥N

extl

200


Exercise 7.1.21. Recall that for any x , SKKx Bw x and SK(KK)x Bw x . Is SKK ≥ η SK(KK) or SK(KK) ≥ SKK provable in IQB1 ?

One of the uses of extensionality is to define constants. For instance, B with axiom Bxyz B x(yz) is definable as S(KS)K . η

Exercise 7.1.22. Suppose that an axiom for B is added to IQB1 . What does it mean in the extended system that S(KS)K defines B ? Exercise 7.1.23. In section 1.3, we defined the notion of strong reduction (i.e., Bs ). η What is the relationship between provability in IQB1 and Bs ?

The weak equality relation between CL-terms over the combinatory basis B1 is the total relation. We choose another combinatory basis, which comprises the combinators of the λI -calculus and its duals. That is, B2 = { B, I, W, C, c, w, i, b } . The equational calculus EQB2 is by replacing some of the axioms of the equational calculus for CL with new ones.4 x=x

id

M=N [x1 /P1 , . . . , xn /Pn ]M = [x1 /P1 , . . . , xn /Pn ]N M=P P=N M=N M=N PM = PN Bxyz = x(yz)

Cxyz = xzy

W

C

M=N N=M M=N MP = NP

sym

mr

zyx = z(y(xb))

B

Ix = x Wxy = xyy

ml

tr

I

x = xi

sub

b

i

y(yx) = y(x w) y(zx) = z(y(xc))

w

c

In the absence of cancellators, we can be sure that our system is consistent due to the following lemma. L EMMA 7.1.28. If M = N is provable in EQB2 , then x occurs in M just in case it occurs in N . 4 Equality

is symmetric, which makes it convenient to place redexes with dual combinators on the righthand side again.


Chapter 7.

201


Exercise 7.1.24. Prove this lemma. (Hint: The structure of the proof is like that of

lemma 7.1.26.) Although we have consistency, EQB2 is slightly unusual. Recall that lemma 7.1.7 showed that the presence of the identity constants conflates constants. Exercise 7.1.25. Construct proofs in EQB2 that show that I = c and W = i are prov-

able.

Exercise 7.1.26. Construct a proof in EQB2 that show that B = b .

These observations — together with properties of the bracket abstraction definable by B, I, W and C — suggest that EQB2 can be equivalently defined to contain one polyadic constant [ . The identity axiom and the rules remain the same, and the axioms for [ are [x1 . . . xn = M

and

M = (xn . . . (x1 [)...),

where n > 0 and M contains at least one (but possibly multiple) occurrences of each of the x ’s, and it may contain occurrences of [ itself. We denote this calculus as EQ [ . Exercise∗ 7.1.27. Prove that EQB2 and EQ [ are equivalent. (Hint: The two calculi

have different languages; thus first you should come up with a suitable notion of equivalence.) EQB2 may be extended to an extensional calculus by including extl and extr η (with = in place of ≥ ). Let us denote the new calculus by EQB2 . η

Exercise 7.1.28. Find examples of provable equations M = N in EQB2 such that

M =w N is false.

Exercise∗ 7.1.29. In view of the previous exercise, the relation on CL-terms deterη

mined by provability in EQB2 is a proper subset of =w . Give a characterization, perhaps somewhat like the definition of =wζ , of this new relation.

7.2

Symmetric combinators

Intuitionistic logic is sometimes called constructive, because of its interpretation by constructions or proofs. The original motivation in Brouwer’s works behind intuitionism as an approach to mathematics also relied on ideas about how mathematical objects are constructed. Constructions and proofs are both effective, that is, they have an algorithmic flavor. Partly because intuitionism started off as a criticism of classical logic, and partly


202


because how mathematicians and logicians in the classical tradition reacted to intuitionism, classical logic has become to be perceived as nonconstructive. Lemma 9.1.35 in chapter 9 epitomizes the relationship between proofs of type assignments for combinators over the basis { S, K } and intuitionistic logic, more precisely, its implicational fragment. Symmetric λ -calculus was introduced by Barbanera and Berardi in [] to establish a connection between classical propositional logic as a set of types and a λ -calculus.5 In intuitionistic logic, there is a certain asymmetry between formulas that are of the form ¬ϕ and formulas that do not begin with a negation: the former formulas are equivalent to their double negations, the latter, in general, are not. There is no similar distinction in classical logic, that is, the double negation law is applicable in both directions to all formulas. Without going into further details, we point out that if function application is symmetric, then the symmetry between the formulas ϕ and ¬ϕ is restored. Symmetric λ -calculus defines the set of Λ -terms just as other Λ ’s do — see definition 4.1.1. The symmetric character of function application operation, which is the invisible operation between terms signaled by their juxtaposition, becomes apparent once redexes are defined. D EFINITION 7.2.1. ( β - AND η - REDEXES ) The Λ -terms Mλx. N and (λx. N)M are β -redexes. If x ∈ / fv(N) , then λx. Nx and λx. xN are η -redexes. Other notions like one-step β -reduction, β -reduction, etc., are defined as before, but assuming that the new redexes are incorporated. Example 7.2.2. yλx. x is in βη nf in (nonsymmetric) Λ , but it is a β -redex in the symmetric λ -calculus: yλx. x B1β y . The slogan “everything is a function” takes on a new meaning in the symmetric λ -calculus. A λ -abstract λx. M can occur as a subterm of a β normal form, if λx. M is the whole term itself. Closed Λ -terms are called combinators in Λ , and in the symmetric λ -calculus they apply to arguments both from left (as usual), but also from right. For instance, (λxy. yx)(λzvw. v(zw)) yields λy. y(λzvw. v(zw)) in one β -reduction step, but it also gives λvw. v((λxy. yx)w) . Neither of these terms is in nf, and we further get λy. (λvw. v(yw)) and λvw. v(λy. yw) , and then λvw. vw . The two resulting Λ -terms are clearly not α -equivalent. Symmetric λ -calculus straightforwardly leads to the idea of considering symmetric constants in CL. Of course, we suppose that function application is symmetric too, that is, there is no information built-in into this binary operation about the function– argument roles of its arguments. Constants that behave alike on the left-hand side and on the right-hand side of an operation are not a rarity. For instance, 1 is the 5 The types in lemma 9.1.35 are simple types, whereas those for symmetric

type constructors ⊥ , ∧ and ∨ .


λ -calculus involve the Boolean

Chapter 7.


203

left–right identity for · (i.e., for multiplication). Multiplication on R is commutative, which means that 1 must behave this way. However, the commutativity of the underlying operation is not a requirement for a constant to be “symmetric” in this sense. A monoid contains an operation that may be called concatenation, which has a left–right identity.6 Some monoids are Abelian, for instance meet semilattices (see definition A.9.7), whereas others are not (see definition A.1.18). By stipulating that function application is symmetric, we do not stipulate that it is a commutative operation. A symmetric combinator may be thought of as a combinator amalgamated with its dual into one constant. Symmetric versions of the combinators S and K are denoted b and K b . Similarly, placing a b over a sans serif letter will indicate that the as S constant is for a symmetric combinator. The set of CL-terms is defined as before — but with only symmetric combinators included as constants. In order to be able to state axioms for symmetric combinators concisely, we define an operation on CLterms. The notation we use reveals a certain analogy between this dual operation and the converse of a binary relation. D EFINITION 7.2.3. (D UAL TERMS ) fined by (1)–(3).

The dual of a CL-term M is recursively de-

(1) x ˘ is x , whenever x is a variable; (2) b Z ˘ is b Z , whenever b Z is a constant; (3) (MN) ˘ is (N ˘ M ˘) . The dual of a left-associated CL-term is a right-associated CL-term, and vice versa. Exercise 7.2.1. Define dual terms for CL with combinators and dual combinators.

(Hint: Of course, many definitions can be given, however, there is one definition that is a straightforward adaptation of the previous definition.) For symmetric combinators we give an axiom with a left-associated term, and stipulate that the dual of both terms is also an axiom for the constant. For example, b the axiom bxy B x ; the duals are y(xK b) and x , so we have y(xK b) B x too. For S K bxyz B xz(yz) , and we have z(y(xS b)) B zy(zx) implicitly. that we state explicitly is S As a rule, for the well-known combinators that we introduced in section 1.2, their symmetric cousins have the same axiom with a left-associated term plus the dual. b are simply (Of course, we could use completely different notation, because S and S two constants.) The notions of redexes and one-step reductions are defined as previously (with some obvious adjustments for the symmetric constants). n L EMMA 7.2.4. If b Z is the head of a redex (where n > 1 ), then that redex is either a left-associated term or a right-associated term, but not both. 6 See

definition A.9.3.


204


Exercise 7.2.2. Prove the lemma. (Hint: left- and right-associated terms are defined

in section A.1.) The lemma underscores a useful observation: each concrete redex behaves like either a redex with a combinator or as a redex with a dual combinator. In other words, a symmetric combinator can form redexes in two ways, but never in one concrete term. Incidentally, the latter also holds for n = 1 , though if `(M) = 2 , then the term can be viewed both as a left- or as a right-associated term. CL and Λ are closely related, but the differences between them resurface, and perhaps, most vigorously in the symmetric case. Exercise 7.2.3. The symmetric Λ -term (λxy. yx)(λzvw. v(zw)) , which we considered b0 . What terms can be obtained by above, can be thought of in symmetric CL as b TB 0 b is supplied with sufficiently many arguments? (Hint: A combinator Bw when b TB in CL requires as many arguments as its arity for Bw steps.) Exercise∗ 7.2.4. Develop translations between symmetric CL and symmetric Λ . (Hint:

The previous exercise may point at new difficulties.) Perhaps, one could expect that if dual combinators led to a widespread lack of confluence, then symmetric combinators do so even more often. Symmetric combinators in general lead to the failure of the Church–Rosser property. However, the ability of a symmetric constant to form a redex in two directions not only adds potential Bw steps at the upper tip of the diamond, so to speak, but also raises the chance of finding more reductions some of which might converge. In other words, there is a similarity between dual and symmetric CL, but their differences are greater than it may seem at first. T HEOREM 7.2.5. (N O CONFLUENCE ) Let B1 be a combinatory basis containing symmetric constants. If there are at least two proper constants in B1 , then Bw does not have the Church–Rosser property on the set of terms generated by B1 together with a denumerable set of variables. Before we turn to the proof, it is useful to point out that the statements in theorems 7.1.9 and 7.2.5 are independent, and so are their proofs. The general structure of the proofs is similar though, because both proofs are based on the analysis of the structure of CL-terms that contain at least two overlapping redexes. That is, we will have to consider several cases again. We assume that the classification of combinators and dual combinators is extended to include symmetric combinators in a straightforward way. Proof: We give a few examples of the cases.7 Case 1. Let us assume that one of the two proper symmetric constants that are in B1 , let us say b Z1 , is a very short combinator. In particular, b Z1n x1 . . . xn B xi (where 1 ≤ i ≤ n ). We consider the following CL-term and two one-step reductions. (We 7 The

complete proof may be found in [].


Chapter 7.


205

use similar conventions concerning the choice of variables, placing the reducts, etc., as we did in the proof of theorem 7.1.9. Unless we state otherwise, the arity of b Z1 is n and the arity of b Z2 is m .) b Z1 x1 . . . (ym−1 . . . (y1 b Z2 )...)i . . . xn B1 (ym−1 . . . (y1 b Z2 )...)

M 1C

The term on the left contains an occurrence of b Z2 . The arity of a symmetric combinator does not change via one-step reductions, which means that the term is not a redex. The term on the right-hand edge does not contain any occurrence of b Z2 , because it is a proper constant. b Z1 is also proper, therefore, even if further B1 steps are possible starting with M , no further reducts will have an occurrence of b Z2 . The lack of confluence is obvious. Case 2. We may assume that neither b Z1 nor b Z2 is very short. For this case, we assume that both are unary. This greatly simplifies the choice of the term we wish to consider. b Z1 b Z2 B1 M

N 1C

We do not know the exact shapes of M and N , however, we do not need to know them to see that the diamond property fails. By assumption, b Z1 and b Z2 are distinct and both proper. M has occurrences of b Z2 only, and N has occurrences of b Z1 only. It is clear that no confluence can obtain. Case 3. Next we consider when one of the two constants b Z1 and b Z2 is not unary, for the sake of definiteness we suppose that b Z2 ≥2 . For b Z1 , we assume that for some i 6= j , (xi x j ) is a subterm of the reduct of b Z1 , when b Z1 ’s argument places are filled out with x ’s.8 Furthermore, we also assume that an occurrence of (xi x j ) is not a subterm of a term of the form (. . . (xi x j ) . . .)xi . We consider a term likethe term in case 1. b Z1 x1 . . . (ym−1 . . . (y1 b Z2 )...)i . . . xn B1 . . . ((ym−1 . . . (y1 b Z2 )...)x j ) . . .

M 1C

The CL-term on the right-hand side does not contain an occurrence of b Z2 , whereas the term on the left does. By placing (xi x j ) (with the term (ym−1 . . . (y1 b Z2 )...) substituted for xi ) within a pair of . . . , we intend to emphasize that that occurrence cannot disappear from the term even if further B1 steps are possible. Again, because both b Z1 and b Z2 are proper, no confluence can obtain. (The rest of the proof may be found in the paper mentioned earlier.) qed The next three theorems further emphasize the differences between dual and symmetric combinatory logics. careful reader might have noticed that the last assumption about b Z1 implies that b Z1 is not unary (either), which does not complement the previous case. Other cases, which are not included here, deal with the situation when b Z1 is unary.

8A


206


Z be a proper symmetric combinator with arity n ≥ 2 , which T HEOREM 7.2.6. Let b is a cancellator for its n th argument. Weak reduction lacks the Church–Rosser property on the set of CL-terms generated by b Z and 2 · (n − 1) variables.

Proof: Let us consider the term and the one-step reductions: b Zx1 . . . xn−1 (yn−1 . . . (y1 b Z)...) B1 M

N 1C .

M is formed of x ’s only, whereas N is the dual term of M , but with all xi ’s replaced by yi ’s. Neither term contains a combinator, thus the lack of confluence is obvious. qed T HEOREM 7.2.7. Let b Z be a proper symmetric combinator of arity n ≥ 2 with axiom b Zx1 . . . xn B xn M . Weak reduction lacks the diamond property on the set of CL-terms generated by b Z and 2 · (n − 1) variables. Exercise 7.2.5. Prove the theorem. (Hint: The constraint on the arity of b Z is essential.)

In the case of dual combinatory logic, one constant by itself — whether that constant is a combinator or a dual combinator — cannot cause the failure of confluence. Of course, a symmetric constant can be thought of as two constants in one, and so the fact that one symmetric combinator can lead to nonconfluence is not astonishing. Theorem 7.1.11 showed that the fixed point constants also cause nonconfluence in the dual setting. Not so when the fixed point constant is symmetric. T HEOREM 7.2.8. (C HURCH –ROSSER PROPERTY WITH FIXED POINT CONSTANT ) b, bI } . The relation Bw on the set of CL-terms Let B2 be the combinatory basis { Y generated by the basis B2 and a denumerable set of variables has the Church– Rosser property. Proof: The proof that Bw has the Church–Rosser property is by structural induction on the starting term. The only case that is different — indeed, special — for the current set of CL-terms, is when we have a complex term and it is contains two b are unary, hence there are four distinct terms that overlapping redexes. Both bI and Y can be formed; two of them are duals of each other. We consider one of the latter two. bI Y b b B1 Y

bI Y bbI 1 C

The left-hand-side term is in nf, hence confluence can obtain if the right-hand-side b . But, of course, (bI Y b)bI does reduce to Y b . qed term can be reduced to Y Exercise 7.2.6. There are two terms that are not duals of the term we considered in

the proof. Finish the proof by showing that confluence obtains in those cases.


Chapter 7.


207

Despite the somewhat prolific character of symmetric constants in forming redexes, the notion of safe terms is secure for symmetric CL. (We assume the obvious modifications in definition 7.1.14 which consists in replacing all constants with symmetric combinators.) The reason is lemma 7.2.4, which ensures — together with the positive arity of all combinators — that once sufficiently many arguments have been supplied to a symmetric constant, it is — in effect — has been reduced to a combinator or a dual combinator. T HEOREM 7.2.9. (S AFE TERMS ARE SAFE ) Let T be a set of safe terms built from a denumerable set of variables and a set of proper symmetric combinators. Bw has the Church–Rosser property on T . The other related notions from section 7.1.1 — tangy and mild terms — can be straightforwardly adapted for CL with symmetric combinators. In view of theorem 7.2.8, however, it is somewhat less clear that those concepts are the most suitable ones if we try to delineate classes of CL-terms on which Bw is and is not confluent. Exercise∗∗ 7.2.7. Find a proper superset of the set of safe terms such that weak re-

duction retains the Church–Rosser property.

7.2.1

Inequational and equational theories

Symmetric CL also can be presented in the form of inequational and equational theories. The lack of confluence for Bw does not prevent us from using a functionb, K b } . The inequational calculus for ally complete combinatory basis. Let B1 = { S symmetric CL based on B1 is denoted by IQB1 . In section 7.1.1, we gave inequational and equational calculi for dual CL. The possibility to apply constants from the right is a common new feature of dual and symmetric CL compared to CL with combinators only. The set of axioms includes id , together with the following four bl , S br , K bl and K br here; axioms. The rules are sub , tr , mr and ml . (We list only S the rest of the axioms and rules is as in IQB1 in section 7.1.1.) bxyz ≥ xz(yz) Sbl S bxy ≥ x Kbl K

b)) ≥ zy(zx) z(y(xS b) ≥ x y(xK

br S

br K

We do not introduce any conventions about axioms for symmetric combinators in an inequational logic. The two axioms per symmetric combinator make it clear that the axiom subscripted with l is like the axiom for the combinator denoted by the same letter; the axiom subscripted with r is like the axiom for the dual combinator denoted by the same letter. The analogues of lemmas 7.1.26 and 7.1.27 are true for IQB1 . Exercise 7.2.8. State and prove a lemma that parallels lemma 7.1.26, but concerns the

symmetric calculus IQB1 .


208


Exercise 7.2.9. State and prove a lemma for the symmetric IQB1 calculus that is an

analogue of lemma 7.1.27 for the dual calculus IQB1 .

Our aim in formulating the inequational calculus is to capture the relation Bw on the set of CL-terms over the basis B1 together with a denumerable set of variables. L EMMA 7.2.10. If M Bw N , then IQB1 proves M ≥ N , and the other way around. Proof: From left to right, we proceed according to the definition of Bw . M Bw M for any term M . We start a corresponding proof in IQB1 by the identity axiom, and apply the rule of substitution with M for x , which gives M ≥ M . To simulate a one-step reduction, we recall that a redex is a subterm of a CL-term. Therefore, in the formation tree of the term, the redex corresponds to a subtree. A redex is headed by a constant followed by sufficiently many terms (from left to right or from right to left); let us say, the terms are M1 , . . . , Mn . We can start a proof by the l or r axiom for the constant, and then we can apply substitution to x1 . . . xn . This yields an inequality that represents the redex and the reduct with M ’s in place of x ’s in B1 . The left and right monotonicity rules applied (finitely many times) give the term with the redex on the left, followed by ≥ , and then by the term with the reduct. Now let us assume that M Bw N holds due to the transitive closure of B1 , that is there is some CL-term P , such that M Bw P and also P Bw N , where the lengths of the one-step sequences between M and P , and between P and N are strictly less than the length of the sequence between M and N . Then by hypothesis, M ≥ P and P ≥ N are provable in IQB1 . The transitivity rule is exactly what captures in the inequational calculus successive B1 steps and that gives M ≥ N . For the right-to-left direction, let us assume that M ≥ N is provable. The base case is that M ≥ N is an axiom. x Bw x is a special instance of the identity relation on the set of CL-terms, which is a subset of Bw , by definition. The axioms for combinators are special instances of B1 , which is also a subset of Bw , by definition. The whole term is the redex, and no application of substitution is needed, because the axioms in IQB1 are formulated using variables. In the induction step, one of the rules must have been applied. If the rule of substitution has been applied, we appeal to the fact that there is a proof of the same inequation in which the substitution rule has been applied to an axiom. If the axiom is identity, then the resulting inequation is an instance of the identity relation on the set of CL-terms. If the axiom involves a constant, then the resulting inequation is an instance of B1 . The transitivity rule is unproblematic: N Bw P and P Bw M together imply N Bw M . For the monotonicity rules we note that P Bw P for all CL-terms. It M Bw N , by assumption, then both (MP) Bw (NP) and (PM) Bw (PN) follow. qed Exercise∗ 7.2.10. Prove that in IQB1 , for any proof, there is a proof with the same

end inequation in “substitutional normal form.” We let the latter mean that the sub rule is applied to axioms only.

IQB1 can be extended by extensionality rules. They are the rules extr and extl as η in IQB1 in section 7.1.1.


Chapter 7.

209

Dual and symmetric combinatory logics η

Exercise 7.2.11. Suppose that IQB1 has been extended to IQB1 as described. Find a

characterization of the provable inequations as a superset of the Bw relation. (Hint: Exercises 7.1.21 and 7.1.22 are somewhat related to this question.)

Another direction to extend our calculus is to make the inequality relation symmetric, which leads to an equational calculus. This time we assume that the combinatory basis is B2 , which includes the constants b J and bI . We do not repeat the axiom and the rules from EQB2 from section 7.1.1 that do not involve any combinators. The axioms for the elements of B2 are the following four. (The axioms for combinators and dual combinators are, of course, not included now.) b Jxyzv = xy(xvz)

b Jl

bI x = x

bI l

z(vx)(yx) = v(z(y(xb J))) x = xbI

b Jr

bI r

There is no cancellator in the combinatory basis. This means that we can be sure of the consistency of the whole system. L EMMA 7.2.11. There are CL-terms M and N such that the equation M = N is not provable in EQB2 . Therefore, EQB2 is consistent. Exercise 7.2.12. Prove the lemma. (Hint: A suitable modification or adaptation of

lemma 7.1.26 may be useful here.) The proof of the previous lemma makes the next statement self-evident. C OROLLARY 7.2.11.1. There is no CL-term M that is equal to all CL-terms N . The inclusion of bI into B2 leads to the indistinguishability of the constants with respect to provable equations in which they occur — as it happened in the equational dual calculus. This motivates the following exercises. Exercise∗ 7.2.13. Prove that for any b Z1 , b Z2 ∈ B2 , if b Z1 M1 . . . Mn = N is provable, then b Z2 M1 . . . Mn = N is provable too. Exercise∗ 7.2.14. Extend EQB2 to an extensional calculus, and compare the relation

emerging from provable equations to =w . (Hint: If the relations do not coincide, give a characterization of the new relation.) Exercise∗∗ 7.2.15. Investigate various combinatory bases with symmetric combinators that do not include bI from the point of view of provable equalities between terms. (Hint: Recall that { J, I } is sufficient to define all noncancellative combinators, but without I the interdefinability between combinators becomes much more b, W b, C b } .) subtle — both in { b J } and in other bases such as { B


210

7.3


Structurally free logics

Sequent calculi divide rules into two groups: connective rules, which always introduce a connective, and structural rules, which change the structure of the sequent. It has become standard practice — following Curry — to label some structural rules with combinators. For example, the exchange rule can be likened to C , the regular permutator. In the case of LK , the sequent calculus for classical logic, these labels can be taken to be useful pointers that the principal type schema of the combinator involves an application of the structural rule bearing the label. However, the structural connective of LK (i.e., , ) is associative, and so there is a certain mismatch between , and function application. The idea of using a more ramified structural connective goes back at least to a sequent calculus introduced by Dunn in [], and a binary structural connective prominently featured in the approach taken in []. The idea of introducing combinators into a sequent calculus (although in a somewhat limited fashion) seems to have first occurred in []. This section introduces structurally free logics that integrate some of the features of substructural logics and type assignment systems.9 We will consider a class of sequent calculi — rather than just one calculus — hence, we refer to these systems together as LC∗ . Sequent calculi are inherently modular (if appropriately formulated) in the sense that the omission or the addition of a connective means dropping or including a couple of rules. The isolation of the groups of rules from one another was originally intended even for classical logic, where the connectives are strongly linked by interdefinability results. The separation of groups of rules is more of a necessity in many substructural logics, where connectives are seldom definable from each other. In all logics, there are meta-theoretical advantages springing from the isolation of groups of rules. In line with this approach, we introduce rules for combinators and dual combinators so that they remain independent of each other. The language of LC may contain the connectives ∧ (conjunction), ∨ (disjunction), → (implication), ← (co-implication) and ◦ (fusion). The constants may include some of the usual Church and Ackermann constants, T (extensional truth or triviality), F (extensional falsity or absurdity), and t (intensional truth), f (intensional falsity). Of course, we also allow the inclusion of combinators, dual combinators and symmetric combinators. The intensional truth constant is closely related to I , and to some extent also to i and bI ; however, they are not the same. D EFINITION 7.3.1. (W ELL - FORMED FORMULAS ( WFF ’ S )) The set wff, that is, the set of well-formed formulas is inductively defined from a set of propositional variables P , by clauses (1)–(4). 9 Structurally

free logics were introduced in [], and further developed and investigated in [], [], [] and []. Type assignment systems with simple types and intersection types are presented in chapter 9.


Chapter 7.


211

(1) P ⊆ wff ; (2) { T, F, t, f } ⊆ wff ; (3) if c is a combinator, a dual combinator or a symmetric combinator, then c ∈ wff ; (4) if A, B ∈ wff and ∗ ∈ { ∧, ∨, ←, ◦, → } , then (A ∗ B) ∈ wff . The combinators are atomic formulas and to this extent they are similar to propositional variables and to the other constants introduced in (2). The idea of making combinators into wff’s is completely new in structurally free logics. In chapter 9, we will see that typing or type assignment never allows a type to become a term or vice versa; the set of CL-terms and the set of type variables are fully disjoint in those frameworks. Typing and type assignment are ways to put together certain types and certain terms creating a new category of expressions. In structurally free logics, propositional variables are somewhat like variables in pure CL, but they are also somewhat like the type variables in typed CL. The four constants introduced in (2) have varying importance with respect to the LC∗ logics. t is vital to the formulation of these logics as sequent calculi. This constant is closely related to, though in general, distinct from I , which may or may not be included in the set of constants. (We may think of t as the always present alter ego of I .) T and F are wff’s that, respectively, are implied by and imply all the wff’s in the language. f has a limited importance in LC∗ , because we do not allow more than one formula to occur on the right-hand side of a sequent. We do not include + , the dual of ◦ , and we completely omit f from now on. Exercise 7.3.1. Work out what rules or axioms are needed to add f to LC∗ , and what

the impact of the addition is. The original sequent calculus of Gentzen for classical logic included a comma ( , ) in both the antecedent and the succedent of a sequent. We define the LC∗ logics as right-singular sequent calculi; that is, only one wff and no structural connective can occur on the right-hand side of a sequent. To emphasize that the structural connective on the left-hand side of a sequent is related to ◦ — rather than to ∧ — we will use ; . We do not need a second structural connective; however, the usage of ; here is in harmony with the notation in sequent calculi that utilize two structural connectives. (Such sequent calculi were first introduced by Dunn in [] for R+ .) D EFINITION 7.3.2. (S TRUCTURES ) tively defined by (1)–(2).

The set str, the set of structures, is induc-

(1) wff ⊆ str ; (2) if A, B ∈ str , then (A; B) ∈ str . The parentheses that surround A; B in the second clause mean that ; is not a polyadic operation and it is not an associative operation either, because we do


212


not postulate additional equivalences between structures. We denote structures by Gothic letters (as in clause (2)). Structures could be viewed as trees — just like CL-terms. (Some formation trees for CL-terms are given in example A.1.6 in section A.1.) A difference is that the leaves of a tree are now formulas and the binary operation ; replaces function application, which causes binary branching in the formation tree. A formula may occur in several places in a structure. We may assume that we can identify a particular occurrence of a formula in a structure. Similarly, we can identify a particular occurrence of a structure in a structure. We rarely have to make fully explicit a concrete structure, and so for us, it is important that the identification is possible, but not what exact mechanism is chosen to do the job. We will use the notation A[B] to indicate that a particular occurrence of the structure B within the structure A has been selected. This means that B is a subtree of A , possibly, comprising only a leaf. We may replace a subtree by a tree, that is, a structure by a structure; the result is obviously a structure again. To simplify the notation that would emerge by analogy from the replacement of a subterm by a CL-term in a CL-term, we omit the structure that is replaced when context can provide that information. The full notation would look like [B/C]A , or with the new term located next to a selected structure A[B/C] . Instead we use A[C] , when the replacement occurs in a limited context, for instance, within a rule. If A[B] figures into the premise of a rule, and we have A[C] in the lower sequent, then we always assume that C has been inserted exactly where the particular chosen occurrence of B was in the premise. (In the case of the ∨ ` rule, we assume that all three bracketed structures occur in the same place in the formation tree of A .) It is hopefully obvious that we really do not need a more precise procedure, such as indexing, to identify an occurrence of B in A for the purpose of formulating the rules. (To substantiate the claim that occurrences of structures can be precisely identified, we give further details in section A.7.) D EFINITION 7.3.3. (S EQUENTS IN LC∗ ) formed formula, then A ` A is a sequent.

If A is a structure and A is a well-

We list the axioms and rules “by groups.” Once we will have accumulated all of them, we will specify which rules are to be omitted if a restricted vocabulary is considered. AÀ A[A] ` C A[A ∧ B] ` C

∧`

A[A] ` C A[B] ` C A[A ∨ B] ` C


A[B] ` C A[A ∧ B] ` C ∨`

id

∧`

AÀ A ` A∨B

`∨

AÀ A`B A ` A∧B

`∧

A`B A ` A∨B

`∨

Chapter 7.

213


A[A; B] ` A A[A ◦ B] ` A

AÀ B`B A; B ` A ◦ B

◦`

`◦

A ` A B[B] ` C B[A → B; A] ` C

→`

A; A ` B AÀ→B

`→

A ` A B[B] ` C B[A; B ← A] ` C

←`

A; A ` B A`B←A

`←

These rules are not unique to the LC∗ calculi; that is, some of the rules appear in some other logics too. The identity axiom is often formulated for all formulas A , as above, rather than for propositional variables p . There is no thinning built into this axiom. (All versions of the thinning rule correspond to cancellators, and we may or may not want to include such combinators. Even if want to have a thinning kind of rule in some of the LC∗ calculi, we want to be sure that a trace of an application of the rule is retained in the sequent in the form of a combinator.) The rules for conjunction and disjunction are the so-called structure-free, or additive rules. They differ from their counterpart in Gentzen’s LK , because the structures in the premises of the two premise rules are stipulated to be the same. The latter 6 rules show the connections both between ; and ◦ , and between the two implications and ◦ . The three noncombinatory constants each add a rule or an axiom. FÀ

F`

A[B] ` A A[t; B] ` A

t`

A`T

`T

Before we describe the rules for the combinators, we introduce a piece of new notation to make the general form of the rules look more agreeable. Definition A.1.20 defined a set of terms that can be obtained from a starting set of terms. D EFINITION 7.3.4. (G ENERATED TERMS AND STRUCTURES ) Let T = {t1 , . . . ,tn } be a set of CL-terms. If M is a CL-term from the set {t1 , . . . ,tn }⊕ , that is, the set of CL-terms that is generated by the set of terms T according to definition A.1.20, then we occasionally use (|t1 , . . . ,tn |) as a notation for the CL-term M . Let { A1 , . . . , An } be a set of structures. If B is a structure from the set { A1 , . . . , An }⊕ , that is, the set of structures similarly generated by { A1 , . . . , An } according to definition A.7.6, then we occasionally use (| A1 , . . . , An |) as a notation for the structure B . An advantage of using the (| |) notation is that we can skip the cumbersome circumscription of the set to which M or B belong. At the same time, the notation does not require that we give a precise shape to M or B . By introducing the notation in parallel for CL-terms and structures, we intend to stress the similarities between the two concepts. We transplant the convention of omitting parentheses from leftassociated CL-terms to left-associated structures.


214


We give an exhaustive list of rules for concrete combinators and dual combinators. A[B] ` A A[I; B] ` A

I`

A[B] ` A A[B; i] ` A

i`

A[B; (C D)] ` A A[B; B; C; D] ` A

B`

A[D; C; B] ` A A[D; (C; (B; b))] ` A

A[C; (B D)] ` A A[B0 ; B; C; D] ` A

B0 `

A[D; B; C] ` A A[D; (C; (B; b0 ))] ` A

A[B; D; C] ` A A[C; B; C; D] ` A

C`

A[C; (D; B)] ` A A[D; (C; (B; c))] ` A

A[C; B] ` A A[T; B; C] ` A A[B; C; C] ` A A[W; B; C] ` A

T`

W`

A[B; C] ` A A[C; (B; t)] ` A

b`

b0 `

c`

t`

A[C; (C; B)] ` A A[C; (B; w)] ` A

w`

A[B; B] ` A A[M; B] ` A

M`

A[B; B] ` A A[B; m] ` A

A[B; D; (C; D)] ` A A[S; B; C; D] ` A

S`

A[D; C; (D; B)] ` A A[D; (C; (B; s))] ` A

s`

A[C; D; (B; D)] ` A A[S0 ; B; C; D] ` A

S0 `

A[D; B; (D; C)] ` A A[D; (C; (B; s0 ))] ` A

s0 `

A[B] ` A A[K; B; C] ` A

K`

A[B] ` A A[C; (B; k)] ` A

A[B; C; (B; E; D)] ` A A[J; B; C; D; E] ` A

J`

A[D; (E; B); (C; B)] ` A A[E; (D; (C; (B; j)))] ` A

A[B; (Y; B)] ` A A[Y; B] ` A A[D; B; C] ` A A[V; B; C; D] ` A

V`

Y`

m`

A[B; y; B] ` A A[B; y] ` A

k`

j`

y`

A[C; (B; D)] ` A A[D; (C; (B; v))] ` A

v`

Note that all the rules for combinators are left-introduction rules. A combinator can be introduced on the right by the identity axiom only, and afterward it may become a subformula of a formula. (This is true for the constant t too.) We have not listed any rules that would explicitly mention a symmetric combinator. We think of a symmetric combinator as the merger of a combinator and its dual pair. Thus instead of repeating the rules for I and i , for instance, we stipulate that bI , the symmetric identity combinator, comes with two introduction rules on the left — like the ones for


Chapter 7.

215


I and i , except that those constants are replaced by bI . In general, for any symmetric combinator b Z , there are two left-introduction rules, which are like the rules for Z and z .

The concrete combinators and dual combinators in the rules above have been introduced earlier. However, there are infinitely many proper combinators, and just as many dual and symmetric combinators that are not listed above. We formulate rule schemas that allow us to generate a concrete rule for any such constant from its axiom. Let Z be an n -ary proper combinator. Using the notation (| |) , we can state the axiom for Z as: Zx1 . . . xn B (| x1 , . . . , xn |) .

The axioms for dual and symmetric proper combinators can be similarly rewritten. Then the rules in LC∗ look like: A[ (| B1 , . . . , Bn |) ] ` A A[Z; B1 ; . . . ; Bn ] ` A

Z`

A[ (| B1 , . . . , Bn |) ] ` A A[Bn ; (. . . ; (B1 ; z)...)] ` A

z `.

The premise appears to be identical in both rules; however, this does not mean that the structure bracketed in A should be the same. Rather, the (| |) notation is sufficiently liberal to cover both terms, one of which is the dual of the other (when z is the dual variant of Z ).10 The notion of a proof is usual: a proof is a tree in which all the leaves are instances of axioms, and the sequents in the other nodes of the tree are obtained by applications of the rules. The root is the sequent proved. We depicted the formation trees with their roots at the top. The trees that are proofs in a sequent calculus have their root at the bottom. Each sequent can be turned into a formula, which means that provable sequents can be viewed as formulas. First of all, a sequent is not a formula, because it may contain the structural connective ; . But the rule ◦ ` fuses bits of structures into formulas. Second, a sequent is not a formula because it has two parts with ` in the middle. However, every sequent of the form A ` B can be turned into a formula; more precisely, it can be almost turned into a formula. The t ` rule introduces t on the left: t; A ` B . Then the ` → rule is applicable, yielding t ` A → B . If the latter sequent is provable in LC∗ , we say that the wff A → B is provable or a theorem of LC∗ . The constant t is a sort of “placeholder” that fills in what would be an empty left-hand side in a sequent calculus like LK . (To justify that the formula A → B can be equivalently viewed as the sequent we started with, we will need the cut rule.) A significant difference of LC∗ from the classical and intuitionistic sequent calculi is that there are absolutely no structural rules in LC∗ . More precisely, there are no structural rules that are applicable to all structures, but we introduce three rules that

do not use ˘ on (| |) , because the latter notation was not intended to specify the shape of a term completely; thus, (| B1 , . . . , Bn |) ˘ would not be meaningful.

10 We


216


involve t . Also, the combinatory rules are intended to replace the structural rules. A[ t; t ] ` A A[ t ] ` A

t→ `

A[ t; B; C] ` A A[ t; (B; C)] ` A

A[ t; B; C] ` A A[B; (t; C)] ` A

t◦ `

t← `

A wff by itself is a structure, and so these rules are special instances of structural rules, which are not included into LC∗ in their general form. The rule t→ ` is a very special contraction rule: it allows us to collapse adjacent t ’s into a single t . The second rule, t◦ ` moves t that is in front of a bigger structure inside of that structure. Lastly, the third rule does the opposite: t← ` allows us to push t from inside of a structure, moreover, in the process, t can jump over a structure toward the right. There is one more rule that is paramount for a sequent calculus to be sensible. The rule is called the single cut rule. The appropriate formulation for LC∗ is A ` A B[A] ` B B[A] ` B

cut.

The cut rule expresses the transitivity of the consequence relation, and a special case of cut corresponds to the rule of modus ponens. To see transitivity in the cut rule, we consider the premises A ` A and A ` B — the result is A ` B . For modus ponens, we take an instance of the cut with premises t ` A and A ` B . The latter can be viewed as t ` A → B , where the implication is explicit. The application of the cut gives t ` B , which asserts the formula resulting from A and A → B by modus ponens. The cut rule has to be included into a sequent calculus unless it can be shown to be an admissible rule. A rule is admissible when its addition to the calculus does not increase the set of provable formulas (i.e., theorems). The cut rule is not a derivable rule in LC∗ , because given A ` A and B[A] ` B there is no way to apply some of the other rules to obtain B[A] ` B . Nonetheless, we have the following. T HEOREM 7.3.5. (C UT THEOREM FOR LC∗ ) in LC∗ .

The single cut rule is admissible

The proof of this theorem is lengthy and we only sketch some of the ideas in section A.7. We note though that the cut rule has more than one form; some of those variants are equivalent in some calculi in the presence of structural rules. Famously, in LK an expulsive version called mix is admissible too, and the first proof of the admissibility of single cut proceeded through the proof of the admissibility of mix. An LC∗ calculus may include contraction-like rules, in which case the following form of the cut rule can be shown to be admissible by fewer inductions than the admissibility of the single cut can be shown. AÀ BhAi ` B BhAi ` B

cut

The angle brackets indicate at least one but possibly more than one occurrence of the structure A in the structure B . The convention about replacement for the square


Chapter 7.


217

bracket notation is inherited by the h i ’s; that is, BhAi is the result of replacing the selected occurrences of A by A . The cut rule is a remarkable and important rule. If the cut rule is included in a calculus, then the subformula property cannot be demonstrated (unless, of course, the cut is admissible). D EFINITION 7.3.6. (S UBFORMULA PROPERTY ) A sequent calculus has the subformula property iff a provable sequent has a proof in which each formula that occurs in a sequent in the proof is a subformula of the proven sequent. The admissibility of the cut rule in a sequent calculus implies the subformula property. A perhaps more obvious consequence of the admissibility of the cut is that the cut need not be added separately, because it is “tacitly” already there. The cut rule, when looked at without taking into account its admissibility, does not support the subformula property, because the wff A disappears from the proof. However, the admissibility of the cut rule means precisely that the arbitrariness of A in proofs is apparent. Cut can speed up proofs, and even if practical or complexity type considerations are not taken into account, cut is necessary in order to have a calculus with the replacement property. To illustrate the idea, let us consider classical propositional logic in which A ∧ B is provably equivalent to B ∧ A . The truth of the replacement theorem means that no matter where A ∧ B occurs in a wff, that occurrence can be replaced by B ∧ A without affecting the provability or validity of the wff. In LC∗ , for instance, t ◦ t and t are provably equivalent; hence, we want a sequent that contains one of them to be provable just in case the same sequent with the other in that spot is provable. T HEOREM 7.3.7. LC∗ with all the rules listed is consistent. Proof: Let us assume the contrary. Then p ` q is provable, where p and q are propositional variables. However, the admissibility of the cut rule guarantees that p ` q has a cut-free proof, in which all the formulas occurring in the proof are subformulas of p ` q . It is easy to verify by looking at all the rules, that there is no way to prove p ` q — as long as the propositional variables p and q are distinct. qed LC∗ contains many rules, and we mentioned that further rules might be added using the rule schemas Z ` and z ` . Having such a big system, we might consider if we want to omit some of the rules, and what happens, if we do. First of all, we may consider the LC∗ calculi with only some of the constants (combinators, dual combinators or symmetric combinators). Second, we may omit some of the connectives, for instance, ∧ and ∨ . Another advantage of the cut theorem (theorem 7.3.5) is that conservativity readily follows. Approaching the LC∗ calculi from another prespective, we may start with a small calculus containing the axioms and rules id , ◦ ` , ` ◦ , → ` , ` → , t ` , t→ ` and t◦ ` together with the combinatory rules I ` , B ` , B0 ` and W ` . Let us denote this calculus as LC1 .


218


L EMMA 7.3.8. If M is a combinator over the set { B, B0 , I, W } and typable by the simple type A , then LC1 proves M ◦ ` A . The converse is also true; that is, if A is a purely implicational formula, and M ◦ ` A is provable in LC1 , then A is a simple type of M . By M ◦ we denote the wff that is obtained by replacing juxtaposition in the CLterm M by fusion. LC∗ combines types and combinators by treating all of them as formulas, thus the claim should not be very surprising. Exercise∗ 7.3.2. Prove the lemma. (Hint: Type assignment systems are treated in

chapter 9; those with simple types are in section 9.1.) Example 7.3.9. The CL-term BB0 W can be assigned the type (p → p → q) → ((q → r) → p → r) . We give a proof of the sequent B; B0 ; W; p → p → q; q → r; p ` r , which after a few more easy steps can be turned into the desired sequent. q`q r`r q → r; q ` r p` p q → r; (p → q; p) ` r p` p q → r; (p → p → q; p; p) ` r q → r; (W; p → p → q; p) ` r 0 B ; (W; p → p → q); q → r; p ` r B; B0 ; W; p → p → q; q → r; p ` r A nearly obvious result is the following. L EMMA 7.3.10. If M is an n -ary proper combinator over the basis { B, B0 , I, W } such that Mx1 . . . xn Bw N , then M ◦ ; B1 ; . . . ; Bn ` ([x1 /B1 , . . . , xn /Bn ]N)◦ is provable in LC1 . The lemma in effect says that the combinatory rules faithfully reproduce one-step reductions in CL. The reduction steps are blended together by the combinatory rules. Example 7.3.11. Let us consider the CL-term BB0 W again, which is a ternary combinator. BB0 Wxyz Bw y(xzz) , and LC1 proves B ◦ B0 ◦ W; B1 ; B2 ; B3 ` B◦2 ◦ (B◦1 ◦ B◦3 ◦ B◦3 ) . To simplify the proof, we turn the B ’s into B ’s, that is, instead of structures, we take formulas. (The next exercise — with sufficiently many ◦ ` steps — shows that this is harmless.) .. . B2 ` B2 (B1 ; B3 ); B3 ` (B1 ◦ B3 ) ◦ B3 B2 ; (B1 ; B3 ; B3 ) ` B2 ◦ ((B1 ◦ B3 ) ◦ B3 ) B2 ; (W; B1 ; B3 ) ` B2 ◦ ((B1 ◦ B3 ) ◦ B3 ) 0 B ; (W; B1 ); B2 ; B3 ` B2 ◦ ((B1 ◦ B3 ) ◦ B3 ) B; B0 ; W; B1 ; B2 ; B3 ` B2 ◦ ((B1 ◦ B3 ) ◦ B3 ) B ◦ B0 ◦ W; B1 ; B2 ; B3 ` B2 ◦ ((B1 ◦ B3 ) ◦ B3 )


Chapter 7.


219

Exercise 7.3.3. We used in the previous example that for any structure A , A ` A◦ is

provable in LC1 (hence in LC∗ ). Prove this for LC1 . (Hint: Use structural induction on the construction of A .) Exercise 7.3.4. Prove lemma 7.3.10. (Hint: You may want to use the result from the

previous exercise.) So far we have illustrated that LC1 can emulate combinatory reduction as well as type assignment with simple types. However, LC1 can assign types to combinators that do not have simple types — despite the fact that LC1 does not contain the extensional connectives. The presence of the fusion operation allows us to form compound types, which resemble the two CL-terms in the axiom of the combinator. Example 7.3.12. Let us consider the CL-term WI or simply M . This term is not typable, because xx , the reduct of Mx is not typable due to the fact that there is no implicational formula that is identical to its antecedent. Given the above lemma and example, it is easy to see that LC1 proves W ◦ I ` B◦ → (B ◦ B)◦ . Here is the proof (with the B ’s fused into B ’s). B`B I; B ` B B ` B I; B; B ` B ◦ B W; I; B ` B ◦ B W ◦ I; B ` B ◦ B W ◦ I ` B → (B ◦ B) LC1 can be conservatively extended to LC2 by ∧ and ∨ . This gives further possibilities to prove sequences that can be likened to type assignments in an extended type assignment system. Exercise∗ 7.3.5. Investigate the connection between LC2 and the intersection type assignment system (with the basis { B, B0 , I, W } ).

As the next extension, we may consider the inclusion of rules for the dual combinators b, b0 , i and w . Exercise 7.3.6. Which formulas could be thought to replace the simple types for dual

combinators? Exercise∗ 7.3.7. Give an exhaustive characterization of the formulas that may appear

in provable sequents on the right-hand side of ` when the left-hand side contains only a constant or fused constants. There is a lot more that could be added here about structurally free logics, their connections to type assignment systems, their models, etc. We hope that this brief section gave the flavor of these calculi and the sorts of problems and of some results that emerge from this approach on the edge of proof theory and CL.



Chapter 8 Applied combinatory logic

We have emphasized that CL is a powerful theory. Thus it is not surprising that combinatory logic has been applied in the foundations of mathematics. The approach that intended to turn CL into a suitably general framework is called illative combinatory logic. We devote the first section to this topic. The origin of CL is the question of the eliminability of bound variables and the problem of substitution. We give a detailed illustration how the incorporation of combinators into a first-order language allows the complete elimination of bound variables. These examples of applications of CL in mathematics, philosophy and logic are not exhaustive. Some other applications that we do not detail here include compilers and type systems for functional programming languages. Depending on where we draw the line between pure and applied CL, some of the earlier topics could be viewed as applications too, for example, the formalization of recursive functions or the type assignment systems.

8.1

Illative combinatory logic

One of the great intellectual themes of the early 20th century was the quest for an overarching theory that could serve as the foundations for mathematics. The approach based on combinatory logic has been termed illative combinatory logic. CL — inevitably — contains constants. So far, we had combinators, and then dual and symmetric combinators. Illative combinatory logic calls for the inclusion of other sorts of constants that can be thought of as symbols for logical and mathematical operations and relations. For example, constants for connectives such as implication, negation, conjunction and disjunction may be included together with constants for quantifiers. Other constants may stand for equality, set membership and the subset relation. Illative combinatory logic extends pure combinatory logic, where the latter is thought of as the theory of weak equality. The inclusion of new constants, of course, expands the set of CL-terms. Example 8.1.1. P is the symbol for ⊃ , that is, for implication. By definition 1.1.1, constants are CL-terms. With the extended set of constants, the set of CL-terms is


222


extended too. Pxx is thought of as x ⊃ x , and P(Pxy)(P(Pyz)(Pxz)) is (x ⊃ y) ⊃ ((y ⊃ z) ⊃ (x ⊃ z)) . This formula is theorem of classical logic (with formulas in place for x , y and z ), and it is the principal type schema of B0 .1 The use of P is reminiscent of C , which is used in prefix notation for implication. A difference is that C is used in a parentheses-free manner. The next three expressions are “essentially the same.” (1) P(Pxy)(P(Pyz)(Pxz)) (2) CCpqCCqrCpr (3) A → B → (B → C) → A → C (1) is an illative CL-term. (2) is a formula in prefix notation with p , q and r standing for propositional variables. (3) is the simple type schema of B0 with some parentheses omitted according to association to the right. Notice that (1) is similar to (2) in respect to the locations where P appears (instead of C ), but it includes parentheses to indicate the arguments of P (in accordance with the convention about delimiting arguments by parentheses in CL-terms). The inclusion of constants would be more or less pointless if they would be simply symbols, which are not completely unlike meta-variables except that no substitution is possible for them. Accordingly, the set of weak equalities is enriched by assertions and rules that are specific for terms of predetermined shapes. In fact, if the identity is represented by a constant, then weak equalities may be viewed as a proper subset of assertions too; then all the theorems of the system are of one kind. D EFINITION 8.1.2. Let the set of constants be expanded by P . Further, let the set of CL-terms be defined as in 1.1.1, where Z ranges over { S, K, P } . The set of theorems comprises equalities (in the extended language) provable in EQB1 with the combinatory axioms restricted to S and K , and assertions obtainable from the assertions (A1)–(A3) by rules (R1)–(R2).2 (A1) PM(PNM) (A2) P(PM(PNP))(P(PMN)(PMP)) (A3) P(P(PMN)M)M (R1) PMN and M imply N (R2) M and M = N imply N 1 Simply

typed CL is introduced in the next chapter, in section 9.1, with → for implication. Implicational fragments of various logics are briefly recounted in section A.9. 2 We use M, N, P, . . . as before to denote meta-terms. This incorporates the effect of substitution into the assertions and rules without postulating a separate substitution rule.


Chapter 8.

223

Applied combinatory logic

We denote this system by Il , and call it the minimal illative combinatory logic. The axioms together with (R1) are equivalent — with M and N thought of as formulas rather than CL-terms — to the implicational fragment of classical logic. The notion of a proof for assertions is the same as in an axiomatic calculus. Namely, a proof is a finite sequence of assertions in which each assertion is an instance of (A1)–(A3) or obtainable from previous elements of the sequence by an application of one of the rules (R1) and (R2). For our purposes the following theorems are of particular importance. We list them together with their usual name. (1) PMM

[self-implication]

(2) P(PM(PMN))(PMN)

[contraction]

Exercise 8.1.1. Show that (1) and (2) are theorems. (Hint: To prove (2), it may be useful to prove P(PM(PNP))(PN(PMP)) first.)

L EMMA 8.1.3. The system Il is inconsistent. Proof: The proof of the lemma can be carried out by utilizing Curry’s paradox. We use the later version of the paradox now. In order to keep CL-terms to readable size, we freely use some of the well-known combinators (which are definable from S and K ). We can form the CL-term C(B(WB)P)y , where y is a variable. C(B(WB)P)yx Bw Px(Pxy) , hence the equality of the latter two CL-terms is provable. Then, of course, C(B(WB)P)y(Y(C(B(WB)P)y)) Bw P(Y(C(B(WB)P)y))(P(Y(C(B(WB)P)y))y). Y is the fixed point combinator, hence, we know that YM =w M(YM) for any M , including C(B(WB)P)y . We abbreviate C(B(WB)P)y by M . The displayed weak reduction is of the form M(YM) Bw P(YM)(P(YM)y) . Hence, YM = P(YM)(P(YM)y) is a provable equation. We construct the following sequence of equations and assertions.3

1. P(P(YM)(P(YM)y))(P(YM)y) 2. YM = P(YM)(P(YM)y) 3. P(YM)(P(YM)y) 4. YM

[provable equation]

[by (R2) from 1. and 2.]


5. P(YM)y 6. y

[theorem, by exercise 8.1.1]



3 We

insert the equations for transparency; they can be left out to obtain a sequence of assertions only, which conforms to the definition of proofs.


224


This means that y , which is a variable, is a theorem. Clearly, we could have used a meta-term everywhere in the proof or any concrete CL-term — nothing depends on the fact that y is a variable. Then it is immediate that all CL-terms are theorems, which means that Il is absolutely inconsistent. qed Curry’s original paradox starts with a different CL-term. Let the meta-term M stand for CPN , where N is a meta-term. CPNx Bw PxN , and so CPN(Y(CPN)) Bw P(Y(CPN))N . Of course, Y(CPN) Bw CPN(Y(CPN)) . That is, using M , we have that YM = P(YM)N . Again we construct a proof (with some equations restated and inserted) to show that N is a theorem. 1. P(P(YM)(P(YM)N))(P(YM)N) 2. YM = P(YM)N

[provable equation]

3. P(P(YM)(YM))(P(YM)N) 4. P(YM)(YM) 5. P(YM)N 6. YM 7. N

[theorem, by exercise 8.1.1]


[theorem, by exercise 8.1.1] [by (R1) from 3. and 4.]

[by (R2) from 5. and 2.] [by (R1) from 5. and 6.]

Again, N is a meta-term, hence all CL-terms are theorems of Il . These paradoxes depend only on the presence of two formulas in the form of CLterms, namely, P(PM(PMN))(PMN) and PMM . An immediate thought is to leave out (at least) the first one of these CL-terms from among the CL-terms that are assertions or theorems. P(PM(PMN))(PMN) is a theorem of many nonclassical logics: from intuitionistic logic to the logic of entailment and the logic of relevant implication. The implicational fragment of a logic without contraction is quite weak in the sense that many theorems, with which we are familiar, are no longer provable. Then (A2) could hardly be an axiom, and neither could P(PMN)(P(PM(PNP))(PMP)) be an axiom if PMM is included. One could think that economizing on the implicational part of a logic may be compensated by the inclusion of other connectives and assertions for them. In general, there is no guarantee that this approach leads to a consistent system.4 Let us assume that the set of constants is { S, K, P, N } . The informal interpretation of N is that it is negation. We consider the following two additions to Il — an axiom and a rule, which are (A4) and (R3). ((A1)–(A3) can be weakened as much as desired, because now we only rely on rule (R1).) We denote the modified system by Il0 . (A4) P(PM(NM))(NM) 4 Variations

on Curry’s paradox have been investigated in the literature. We recall only one new variant from among the paradoxes considered in [].


Chapter 8.


225

(R3) M and NM imply N (A4) is a so-called reductio principle, because it can be read as “if A implies notA (i.e., its own negation), then not- A .” (R3) expresses that a contradiction implies anything. The CL-term W(B(CP)N) does not have any occurrences of any variables, and we denote this term by Q . W(B(CP)N)x Bw Px(Nx) . We can construct a sequence of equations and assertions to prove N as 1–8: 1. P(P(YQ)(N(YQ)))(N(YQ)) 2. YQ = Q(YQ)

[provable equation]

3. Q(YQ) = P(YQ)(N(YQ)) 4. YQ = P(YQ)(N(YQ)) 5. P(YQ)(N(YQ)) 6. YQ 7. N(YQ) 8. N

[instance of (A4)]

[provable equation] [provable equation]


[by (R2) from 5. and 4.] [by (R1) from 5. and 6.] [by (R3) from 6. and 7.]

N is an arbitrary meta-term; therefore, Il0 is inconsistent. Given the three examples of inconsistency proofs for illative systems, we may try to find the commonalities in them. An inevitable part of the constructions is the presence of constants (beyond combinators), which come with some axioms and rules added to pure CL as the theory of weak equality on CL-terms. The constants, which are typically considered, and their characterization are guided by some connectives from a logic. However, there is another crucial element that comes from pure CL itself: combinatorial completeness. In each case, we started with a CL-term (with or without a free variable) that we denoted by M or Q . In fact, these terms are the results of abstracting out a variable in place of which we inserted the fixed point of the CL-term itself. For instance, the last construction really starts with Px(Nx) , which can be seen to be an instance of a subterm of axiom (A4). By combinatorial completeness, there is a combinator that reduces to Px(Nx) , when applied to x , and we denoted this combinator by Q . We know also that from a combinatorially complete basis the fixed point combinator is definable. Then YQ is a CL-term. Combinatorial completeness in an illative system has a certain similarity to naive comprehension in (naive) set theory. The naive comprehension principle permits a set to be formed given any property ϕ , that is, { x : ϕ(x) } is a set. To reinforce this similarity, let us consider Russell’s paradox. Let R stand for { x : x ∈ / x } . R ∈ R if and only if R satisfies the defining property for R , that is, R ∈ / R . But A iff ¬A is a classical contradiction, which implies anything. We already have all the components in Il0 to reconstruct this paradox.


226


1. N(YN) = YN

[provable equation]

2. P(P(YN)(N(YN)))(N(YN)) 3. P(P(YN)(YN))(N(YN)) 4. P(YN)(YN) 5. N(YN) 6. YN 7. N

[instance of (A4)] [by (R2) from 2. and 1.]

[theorem, by exercise 8.1.1] [by (R1) from 3. and 4.]

[by (R2) from 5. and 1.] [by (R3) from 5. and 6.]

The CL-term on line 4 is an instance of the same theorem that figured into Curry’s original paradox. A ⊃ A is an axiom or a theorem of nearly every extant logic, because it guarantees a very elementary property of ⊃ , namely, reflexivity. The latter is essential to the algebraizability of a logic. Informally, the equation on line 1 may already look problematic, because the two CL-terms in the equation are exactly those from which anything may be concluded in some logics; notably, both in intuitionistic logic and in classical logic. “Solutions to Russell’s paradox” in set theory typically restrict the formation of sets, for example, by giving a series of axioms that describe allowable ways of forming sets. The so-called Zermelo–Fraenkel set theory (ZF) and the so-called von Neumann–Bernays–Gödel set theory (NBG) follow this approach. Neither ZF nor NBG contains naive comprehension. Another approach that aims at guaranteeing consistency of set theory restricts the logic that is used but keeps the naive comprehension principle. Given this view, the importance of Curry’s paradoxes is that they make clear that negation is not needed to arrive at inconsistency. Illative combinatory logic took a similar turn as set theory. The dominant idea has been that the categories of expressions have to be separated from each other by the introduction of constants that function like predicates do in a first-order language. For example, H may be used for propositions, that is, HM means that M is a CLterm that stands for a proposition. Such sorting of CL-terms into categories may be likened to the elimination of sorts in first-order logic. This may be accomplished if there are unary predicates such that they are true of the elements of exactly one sort. Incidentally, in set theories that incorporate ur-elements into the domain, sorting or a special predicate S (which is true of sets, but not of ur-elements) is typically used in a similar fashion. We are not going to go into the details of further developments in illative combinatory logic, which itself could be a topic of a whole book.


Chapter 8.

8.2


227

Elimination of bound variables

Schönfinkel introduced combinators as part of the procedure that accomplishes the elimination of bound variables. Variables are clearly important in a first-order language. We already saw that variables and variable binding is important in Λ . Free variables in first-order formulas may be thought to formalize pronouns such as “this” or “it,” when used deictically or anaphorically in a natural language sentence. Thus, they play a less significant role in formal sciences than bound variables do. The main function of variables is to exhibit variable binding relationships precisely, for instance, to indicate whether an argument is existentially or universally quantified. Another function of variables (both free and bound) is to show that certain arguments are identified. Example 8.2.1. Let P be a 2 -place predicate, and let a be a name constant. We may think that P means “strictly less than,” and a is 0 . We may form a series of simple sentences — assuming that both quantifiers are in the language. We list some wff’s and their intended informal meaning. (1) P(a, a)

— “ 0 is strictly less than 0 .”

(2) ∀x. P(x, a)

—

“Everything is strictly less than 0 .”

(3) ∃x. P(x, a)

—

“Something is strictly less than 0 .”

(4) ∀x. P(a, x)

—

“ 0 is strictly less than everything.”

(5) ∃x. P(a, x)

—

“ 0 is strictly less than something.”

(6) ∀x ∀y. P(x, y)

—

“Everything is strictly less than everything.”

(7) ∃x ∃y. P(x, y)

—

“Something is strictly less than something.”

(8) ∀x ∃y. P(x, y)

—

“Everything is strictly less than something.”

(9) ∃x ∀y. P(x, y)

—

“Something is strictly less than everything.”

None of these wff’s is logically valid. If we suppose that the quantifiers can range over some concrete set of numbers, for instance, N or Z is the domain of interpretation, then we could consider whether the sentences are true or false. This would clearly separate some of the wff’s that are alike except that their quantifiers are different: (3) is true and (2) is false if the domain is Z . The last two English sentences are ambiguous, though they have a preferred reading, which is what is expressed by the wff next to which they are placed.


228


The usual convention in the interpretation of first-order wff’s is that syntactically distinct variables such as x and y may but need not be interpreted as denoting the same individual object. Thus in order to express that two argument places of one predicate or several predicates should denote the same object can be achieved by reusing a variable. (10) and (11) are not equivalent to any of (1)–(9). For example, (3) and (7) are true if the domain of the interpretation is N , but the alike (11) is false. (10) ∀x. P(x, x)

—

“Everything is strictly less than itself.”

(11) ∃x. P(x, x)

—

“Something is strictly less than itself.”

In Λ , bound variables can be renamed. The renaming of bound variables yields α -equality, which is part of β -reduction and all the other relations on Λ -terms that are supersets of β -reduction. α -equality is well motivated by the idea that λ is an abstraction operator; if Λ allows (as it is usual) unrestricted function application, then α -equality (in some form) is an inevitable part of Λ . Renaming of bound variables is permitted in first-order logic too — despite the fact that the quantifiers do not create functions from expressions. The above list of wff’s might seem “systematic,” however, we could have used wff’s with other variables. For example, (10) could have been ∀z. P(z, z) . The latter wff and the one that actually appears in (10) are distinct wff’s, however, they are logically equivalent. Some wff’s are logically valid or they are theorems, provided that we have a suitable formalization. In a philosophical tradition, where logic is considered a unique and fully general framework of correct reasoning, theorems of logic are viewed as formulas that have a very special status among all the wff’s. The wff ∀x. x = x expresses that all objects are self-identical; so does the wff ∀y. y = y . This shows that bound variables are auxiliary to the logical form of formulas, in general, but also of theorems, in particular. The logical form of formulas would be made explicit, if the bound variables would be absent from the wff. But of course, simply omitting the bound variables will not work. If the variables are “freed” by dropping the quantifiers, then the meaning of the formula is changed (together with the formula itself); if the variables themselves are omitted (too), then the wff turns into an expression that is no longer a wellformed formula. Even if we would create a new category of expressions specifically to express the logical form of wff’s by combinations of predicates, connectives and quantifiers, we would still run into a problem. Example 8.2.2. Let us assume that we have two one-place predicates N and Z , plus a binary predicate G . The formula ∀x. Z(x) ⊃ ∃y. N(y) ∧ G(y, x) can be easily given an interpretation. For instance, with a suitable interpretation of the predicates and having a domain comprising the real numbers, the wff could mean that for any integer there is greater natural number. If we omit the quantifiers, then we get Z(x) ⊃ (N(y) ∧ G(y, x)) . A somewhat artificial translation of this wff is “If this is an integer, then that is a greater natural


Chapter 8.


229

number.” The designation of x as “this” and of y as “that” is quite arbitrary. The expressive capability of English is limited when it comes to rendering open formulas as natural language statements. If we omit only the variable occurrences that are bound, then we get ∀ . Z( ) ⊃ ∃ . N( ) ∧ G( , ) . This expression with “holes” in it is clearly not a wff. A more acute problem is that the expression is ambiguous — exactly, because the variables no longer show the binding relationships. Classical logic is teeming with interdefinabilities, which allows easy definitions of normal forms. There are conjunctive, disjunctive and prenex normal forms (among others). The bound variables could be eliminated without altering or diminishing the meaning of a formula, if a suitable normal form like equivalent of a formula could be found. Schönfinkel solved this normalization sort of problem by introducing the combinators and the N EXTAND operator. We first explain what the new operator is, then we turn to the way the combinators are applied in the language of first-order logic to achieve the elimination of bound variables. In section A.8, we outlined functional completeness for classical sentential logic. Either of the two connectives † and | are alone expressive enough for sentential logic — as lemma A.8.6 states. However, even if all the connectives are replaced by their definitions using, let us say † , there is still a need for at least one quantifier. This would mean that the set of logical constants is at least a doubleton. The logical essence of a first-order formula can be expressed by a single operator which binds a variable and is binary (i.e., it forms a formula from two formulas). The new operator is denoted by | , and the variable that is bound by | will appear in the superscript, for instance, as |x . The presence of | means that beyond atomic formulas, that is, formulas that contain a predicate symbol with their arguments filled out by terms, we need only the following rule (6 0 ) to form formulas. If wff’s are defined as in A.8.1, then (6) and (7) may be replaced by (6 0 ). (6 0 ) If x is a variable, and A and B are wff’s, then (A |x B) is a wff. Quantification in first-order logic is more often than not defined without the requirement that the variable immediately following the quantifier occurs free in the formula which is the scope of the quantifier. | is completely similar in this respect: (6 0 ) does not require or imply that A or B contain x free, however, if either does, then we consider all the free occurrences of x in A and B to be bound in (A |x B) . The name N EXTAND intends to suggest that the intended interpretation of | is “it is not the case that there is an x such that both A and B .” This can be captured by a formula: ¬∃x (A ∧ B) . The latter is equivalent in first-order logic to the formula ∀x ¬(A ∧ B) . The symbol | has been used for NAND; hence, yet another way to write the same formulas is as ∀x (A | B) , which may explain the |x notation. A special case of ∀x ¬(A ∧ B) is when A and B are one-place predicates with x in their argument place. The formula expresses that the extensions of the two predicates are disjoint. A likely more often used wff to express this is ¬∃x (A(x) ∧ B(x)) ; or even ∀x (A(x) ⊃ ¬B(x)) . Among the so-called categorical statements from


230


syllogistic, this is the “universal negative” statement, often abbreviated as E . Such statements correspond to natural language sentences such as “No apples are bananas” or “There are no venomous tuataras.” Of course, A and B may be complex formulas, and they may contain predicates of arbitrary arity. For instance, “No Apple computer ships with a Windows operating system” could be formalized by a wff with a more complex structure to reflect the complexity of the natural language sentence. Schönfinkel has shown that the | operator itself can express all the connectives and quantifiers of a first-order language. It is well-known nowadays that | (the sentential connective) by itself can express all the truth-functional connectives of classical logic. The | operator can be shown to express ¬ and ∧ similarly, once we will have noted that binding a variable that has no occurrences in the component formulas is harmless. L EMMA 8.2.3. (N EXTAND SUFFICES ) Let A be a formula in a first-order language. There is a formula A0 that is logically equivalent to A and contains no connectives or quantifiers except the | operator. Proof: We show that if the first-order language contains | as defined using ∀ , ¬ and ∧ , then there is a formula A0 as specified for any formula A . Strictly speaking, we consider a definitional extension of the first-order language in which A is given. However, considering a richer language is unproblematic, and indeed, the usual way to prove claims concerning expressibility. We divide the proof into three steps: one for each of ¬ , ∧ and ∀ . Since it is well-known that any first-order formula can be expressed using only these connectives and quantifier, then it will be immediate that | itself is similarly sufficient. 1. Let A be of the form ¬B . Without loss of generality, we may assume that x∈ / fv(A) .5 ¬B is logically equivalent to ¬(B ∧ B) by the idempotence of ∧ . If x∈ / fv(A) , then x ∈ / fv(B) and x ∈ / fv(¬(B ∧ B)) either. Then ¬(B ∧ B) is logically equivalent to ∀x ¬(B ∧ B) . The latter is equivalent, by the definition of | , to B |x B . 2. Let us assume that A is B ∧ C . B ∧ C is logically equivalent to its double negation ¬¬(B ∧C) . Once again, there is a variable that has no free occurrences in the latter wff. We do not have any specific assumptions about B or C containing occurrences of some variables; hence, we may assume that x ∈ / fv(B ∧C) . Provided this assumption, we know that ¬(B ∧C) is equivalent to ∀x ¬(B ∧C) . In the context of ¬ , we can replace — according to the replacement theorem — ¬(B ∧ C) by ∀x ¬(B ∧ C) . Then ¬¬(B ∧ C) is equivalent to ¬(B |x C) . This wff is of the form like A in case 1. We could select x again as the variable that is not free in B |x C , since the formula contains one bound occurrence of that variable only. However, to make the structure of the whole formula clearer, we assume that y ∈ / fv(B∧C) . There are always infinitely many suitable variables to choose from. Then finally, B ∧C is logically equivalent to (B |x C) |y (B |x C) . 3. Lastly, let A be ∀x. B , where x may be a free variable of B . Otherwise, the universal quantifier may be omitted, because it is vacuous. B is logically equivalent 5 We

use the notation fv for formulas now with a similar meaning as for Λ -terms. The definition of the set of free variables for a formula is straightforward; hence, we omit its details.


Chapter 8.


231

to ¬(¬B ∧ ¬B) by double negation and a De Morgan law. Then A is equivalent to (¬B |x ¬B) . As in the previous cases, we can choose a variable that is not free in B , let us say, y ∈ / fv(B) . By case 1, A is further equivalent to (B |y B) |x (B |y B) . This completes the proof. qed Exercise 8.2.1. Work out the definitions of some other logical constants such as ∨ ,

⊃ , ≡ and ∃ . Exercise 8.2.2. Define the two binary connectives | and † using the N EXTAND oper-

ator. (Hint: | should be obvious at this point.) There has been a certain interest in combining connectives and quantifiers. Universally quantified statements are often conditionals. For instance, the sentence “All topological spaces over a set X contain the set X as an element of the set of opens” will straightforwardly formalize into a formula that is universally quantified, and the main connective in the scope of the quantifier will be a ⊃ . Probably, this observation motivated the integration of ⊃ with one or more ∀ ’s.6 Schönfinkel chose to combine the connective | with ∀ . However, it is possible to combine either of † and | with either of ∀ and ∃ . Exercise 8.2.3. Define an operator based on † with existential quantification. Is this

operator sufficient like N EXTAND? (Hint: Either give a proof of sufficiency, or provide a counterexample that shows inexpressibility.) It is obvious that there are infinitely many truth functions. It is fairly well-known that there are no zeroary or unary, and there are exactly two binary connectives that can express all the truth functions. A less well-known fact is that there are 56 ternary connectives, and of course, infinitely many connectives of higher arity having this property. Every connective that gives rise to a functionally complete singleton set of connectives can be combined with either ∀ or ∃ and the resulting operator is by itself sufficient. Exercise∗ 8.2.4. Find a ternary operator that is sufficient to express all wff’s of first-

order logic, and prove that it is indeed sufficient. We do not go deeper into the exploration of problems of functional completeness and sufficiency of operations.7 Rather, we pose a somewhat open-ended question in the following exercise. Exercise∗ 8.2.5. Schönfinkel’s idea of eliminating the bound variables could be based

on a different operator that is sufficient by itself. Is there an operator the use of which is advantageous? (Hint: Some applications of first-order logic in computer science or translations of natural and meta-language sentences may lead — typically or exclusively — to a limited class of wff’s. Then questions about the length of the resulting expressions and efficiency can arise.) 6 See,

for example, Curry and Feys [, p. 86] and Church [, §28, §30]. issues have been investigated in [].

7 These


232


Schönfinkel introduced the operator | , which clearly reduces the number of logical constants, but does not allow the elimination of bound variables. Definitions A.8.1 and A.8.2 stipulated a denumerable set of individual variables. However, we may as well assume that the variables are ordered by their index set N . This suggest that we consider wff’s that contain a full initial segment of the list of variables. For instance, if x is the first variable, and y is the second one, then no formula can have y as a bound variable unless they have occurrences of the variable x too. Given that the renaming of bound variables is permitted in first-order logic, the requirement that bound variables occur in a certain order is not a real restriction on the set of formulas from which variables are eliminated. In other words, for every formula of first-order logic, there is a wff that is logically equivalent to the former and satisfies the sequentiality requirement on its bound variables. We can go yet another step further, and we may assume that no variables can occur both free and bound. Having two denumerable sets of variables, one of which supplies only free, the other of which provides only bound variables may complicate certain definitions such as substitution, but it is theoretically unproblematic. This could guarantee that bound variables are eliminable from a class of wff’s in a normal form, and the reconstruction of the formula with variable bindings is unique.8 To reproduce the “essence” or formal structure of wff’s we will not limit our consideration to strings of symbols that are wff’s. Indeed, this should be expected given that combinators are added into formulas of a first-order language. Schönfinkel introduced a new constant U , which then may be viewed from two standpoints. First of all, UPQ expresses the disjointness of the extensions of two unary predicates P and Q . For instance, the sentence “No primes are even” (which is, of course, false) may be formalized over the domain of natural numbers by ¬∃x. Px ∧ Ex , where P and E are one-place predicates, respectively. Then Px |x Ex is an equivalent formalization in which P and E are followed by x only. UPE expresses the same — except that the variables have been eliminated. The previous way of thinking about U is illuminating, however, it is not general enough to provide for the elimination of all bound variables. It may happen that the two wff’s in the scope of a | have different arities, and one may have x as its last argument, whereas the other has y . The upshot is that we want to treat formulas as syntactic objects, in particular, almost like CL-terms. Let us assume that X and Y are expressions that may contain predicates, variables, the operator | , combinators and U . We know that variables bound by | can be renamed just as the variables bound by ∀ (or by λ ). Thus we can simplify the requirement that x is not free in X to x does not occur in X ; similarly, x may not occur in Y . Then Xx |x Y x is rewritten as UXY .

8 To

simplify the presentation and to make it more closely resembling [], from now on, we omit the parentheses and commas from atomic formulas. These auxiliary symbols could be left in the wff’s, but the expressions that result after the elimination of bound variables would be longer. No ambiguity results from this simplification when distinct letters are used for different categories of symbols.


Chapter 8.


233

Example 8.2.4. Let us consider the sentence “Everybody in Bloomington knows somebody from Nebraska.” In order to keep the structure of the formula and the resulting expression simple, we use B and N as one-place predicates, and K as a two-place one. (The previous two stand for “in Bloomington” and “in Nebraska,” whereas K is “knows.”) The sentence can be formalized in a usual first-order language as ∀x (Bx ⊃ ∃y (Ny ∧ Kxy)). This is equivalent to ∀x ¬(Bx ∧ ∀y ¬(Ny ∧ Kxy)) , and then to (Bx |x (Ny |y Kxy)) . The second part of the wff can be written as UN(Kx) , because y does not occur in N or in Kx . U , N , etc., are treated as atomic terms, which means that B(UN)Kx reduces to the previous UN(Kx) . Now both expressions in the argument places of |x end with x — with no other occurrences of x elsewhere. Thus we can use U again: UB(B(UN)K) is the resulting expression, which has no bound variables at all. It is completely accidental that we did not need to utilize many combinators in this example, because the variables happened to be in the right positions. B was needed only to disassociate a predicate and its first argument. Example 8.2.5. For a more complicated example, let us consider the sentence “Each bike has an owner or a rider.” We may formalize this sentence, which is on the surface only slightly more complicated than the previous one, by using the unary predicates B , R and O , together with the binary predicate H . (The three former stand for “bike,” “rider” and “owner,” whereas the latter stands for “has” with the arguments in the same order as in the natural language sentence.) The wff in usual notation looks like: ∀x (Bx ⊃ ∃y ((Ry ∨ Oy) ∧ Hxy)). This wff can be turned into a wff with | only: Bx |x (((Ry |v Ry) |z (Oy |w Oy)) |y Hxy) . To eliminate v from Ry |v Ry , we have to introduce v twice, which leads to K(Ry)v |v K(Ry)v . Then we get U(K(Ry))(K(Ry)) . Similarly, U(K(Oy))(K(Oy)) results from K(Oy)w |w K(Oy)w . To eliminate z , we need to add z to both expressions: K(U(K(Ry))(K(Ry)))z and K(U(K(Oy))(K(Oy)))z . We have at this point Bx |x (U(K(U(K(Ry))(K(Ry))))(K(U(K(Oy))(K(Oy)))) |y Hxy). This expression shows the need for combinators beyond B and K , because multiple occurrences of y have to be collapsed into one. Unless we want to stipulate an infinite number of primitive combinators, we will need not only duplicators, but also permutators to move separate occurrences of a variable next to each other. Exercise∗ 8.2.6. Find an expression that eliminates all the bound variables from the preceding example. (Hint: It may be useful to turn K(U(K(Ry))(K(Ry))) into an

expression of the form Xy with y ∈ / fv(X) as the first step; then the same combinator will work for K(U(K(Oy))(K(Oy))) too.) The role of the combinators is crystal clear from the example: they allow expressions — starting with formulas — to be brought into a form where U can be applied.


234


The only logical constant is | and the definition of wff’s implies that if the wff is not atomic, then it contains at least one subformula of the form Py1 . . . yn |x Qz1 . . . zm . This provides a paradigmatic case to illustrate the role of the combinators more abstractly. 1. It may happen that yn and zm are both x , and none of the other variables are x . Then no combinators are inserted, and the subformula is replaced by U(Py1 . . . yn−1 ) (Qz1 . . . zm−1 ) . 2. If one of the two variables yn and zm is x , but the other is not, then x needs to be added where it is missing. (We also assume that the other y ’s and z ’s are not x either.) For the sake of definiteness, let us assume that yn is x . Then Qz1 . . . zm is replaced by K(Qz1 . . . zm )x — just like in the bracket abstraction algorithm, when the variable that is being abstracted does not occur in the term.9 3. Now it may be that one or more of the y ’s and z ’s is x . Then Py1 . . . yn may be viewed as the CL-term in the combinatorial completeness lemma (i.e., lemma 1.3.9). Since we have the expression that is the end result, we would have a certain freedom to choose the order of the arguments, in general; but if we are at the stage where x is being eliminated, then x has to be positioned as the last argument of function. The whole structure of the starting wff will guide the abstraction procedure, because the goal is not simply to find an arbitrary expression but one that allows replacement of |x by U . A great insight and discovery of Schönfinkel is that all the possible expressions that fall under case 3 or emerge as a result of repeated introduction of U ’s into the expression can be dealt with by using finitely many — really, a handful of — combinators. The fact that occurrences of variables must be added, shifted around, and possibly contracted shows some of the same complications that arise in an application of the substitution operation. The problem of the elimination of bound variables is really the same problem as the problem of substitution. This explains that while both Schönfinkel and Curry worked on CL, they drew their motivation from (seemingly) different questions. The idea that manipulations on atomic formulas may allow those formulas to be brought into a standard form from which variable binding may be eliminated is directly reflected by versions of Quine’s predicate functor approach.10 The predicates and their arguments are treated as different kinds of expressions, which leads to the apparent simplification that an atomic formula is a string with no parentheses or grouping. Unfortunately, the lack of structure in strings excludes the possibility of selecting finitely many operations to turn atomic formulas into a suitable form. For the sake of comparison, we briefly recall one concrete system that closely resembles one of Quine’s. This will make clear that Schönfinkel’s combinatory approach is superior to predicate functors. The set of connectives { ¬, ∧ } is functionally complete, and every formula of first-order logic is equivalent to a formula in which only these two connectives and 9 See

the proof of lemma 1.3.9 and section 4.3 for descriptions of bracket abstraction algorithms. [], [] and [] for various implementations of essentially the same ideas.

10 See


Chapter 8.

235


∃ occur. Negation can be dealt with one predicate functor. The elimination of bound variables is accomplished by a new operator, which is denoted by ‫ נ‬. The insertion of a new variable is the result of padding, which is denoted by . Collapsing two occurrences of a variable at the beginning of a sequence is achieved by the functor ‫ ו‬. The other functors that allow the manipulation of finite sequences of variables come in multiples. F and G stand for possibly complex predicates, which are atomic predicates or constructed from such by applications of predicate functors. Their arity is indicated in the superscript. The list of predicate functors is: ‫נ‬

(1) −F x1 . . . xn is ¬(F n x1 . . . xn ) ; (2) ‫ נ‬F x2 . . . xn is ∃x1 . F n x1 . . . xn ; (3) F x0 x1 . . . xn is F n x1 . . . xn ; ‫נ‬

(4) ‫ו‬F x1 x2 . . . xn−1 is F n x1 x1 x2 . . . xn−1 ; (5) F ∩ G x1 . . . xmax(m,n) is F m x1 . . . xm ∧ G x1 . . . xn ; (6) Pn F x2 . . . xn x1 is F n x1 . . . xn ; (7) pn F x2 x1 x3 . . . xn is F n x1 . . . xn . (1) simply changes the location of the negation from a formula to a predicate. ‫נ‬ eliminates the first variable, when that is existentially quantified; the resulting complex predicate has arity one less. functions like a cancellator, in particular, it adds a new first element to a sequence of variables. ‫ ו‬acts like the duplicator M , because it collapses two occurrences of a variable in the first and second argument places into one. ‫ ו‬reduces the arity of a predicate by one. ∩ merges two sequences of variables where they are either the same or one is the initial segment of the other. The arity of the new complex predicate is max(m, n) . The two sorts of permutations in (6) and (7) are the operations that are most apparently must come in multiples. Neither Pn nor pn changes the arity of the predicate, but both change the order of variables in the sequence that follows the predicate. ‫נ‬

Example 8.2.6. In order to give a flavor of how the bound variables are eliminated in this setting, we consider the sentence from example 8.2.4 again. That is, our sentence is “Everybody in Bloomington knows somebody from Nebraska,” which is formalized as ∀x (Bx ⊃ ∃y (Ny ∧ Kxy)). This time we need an equivalent formula with ∃ , ¬ and ∧ only. We can get ¬∃x (Bx ∧ ¬∃y (Ny ∧ Kxy)) . We first have to deal with the subformula Ny ∧ Kxy . We may either pad Ny or permute x and y in Kxy . The narrowest scope of a quantifier is that of ∃y ; therefore, we permute the arguments of Kxy . Then Ny ∧ P2 Kyx can be turned into N ∩ P2 K yx . From ∃y. (N ∩ P2 K yx) , we get ‫( נ‬N ∩ P2 K) x . The


236


negation turns into − , which is applied to ‫(נ‬N ∩ P2 K) . ‫ נ‬has decreased the arity of the complex predicate N ∩ P2 K , thus ∩ is applicable without any obstacles at this point. We get ¬∃x (B ∩ − ‫( נ‬N ∩ P2 K) x) ; and by two further steps, we obtain a complex predicate as the results of the elimination of bound variables from the above displayed formula. − ‫(נ‬B ∩ − ‫(נ‬N ∩ P2 K)).


Chapter 9 Typed combinatory logic

CL proved to be quite powerful in itself, as we have already seen in chapters 2 and 3. The original motivations to develop CL were not primarily the goal to capture

the notion of computable functions, but to eliminate bound variables and to provide a framework for the foundations of mathematics. Curry and his students created illative combinatory logic, that we briefly outlined in chapter 8. Schönfinkel had not had a chance to expand the elimination of bound variables to higher-order logics, or to investigate the consequences of the addition to CL of sentential or predicate logic. However, the early systems that were proposed to provide a general framework for the foundations of mathematics proved to be inconsistent. Still, some of the ideas behind the theory of functionality, that was invented by Curry in this context, proved very fruitful both theoretically and in applications. The present chapter is concerned with some typed calculi for CL; thus we will use the terms type-free CL or untyped CL when we wish to refer specifically to CL without types, that is, to some variant of CL that we considered so far (except in section 6.5). A question that is unanswered in type-free CL, is the characterization of the class of terms that strongly normalize, or further, terms that normalize. Recall that a term strongly normalizes when all the reduction sequences starting with that term are finite. The Church–Rosser theorem ensures that the order in which redexes are reduced does not matter, and strong normalization guarantees that the term not only has an nf, but the order of reductions cannot prevent us from getting to the nf. Simple types and intersection types provide an answer to these questions in an elegant way.

9.1

Simply typed combinatory logic

CL and the λ -calculi are not the only formalisms that take functions as some (or all) of the objects that there are. Set theory and category theory also deal with functions. A striking difference between functions in CL (or in λ -calculi) and in the two other theories is that in set theory and in category theory functions always come with a domain and a codomain. All functions in all categories have a pair of objects associated to them, which are thought of as the domain and codomain of the function. In fact, objects cannot


238


exist without functions, because each object has an identity function on it. The role of the objects as (co)domains becomes clear when the composition of functions is f

g

considered: A → B and B → C compose into f ◦ g with the pair of objects hA,Ci , however, g ◦ f need not exist, because A and C are not supposed to be the same object. In set theory, functions are sets of ordered pairs. We consider for the sake of simplicity unary functions — nothing essential depends on this choice. If we think, for a moment, only about total functions, then the set of the first elements in the pairs is the domain of the function, and the function is not applicable to anything that is not in that set. Similarly, the codomain (or image) of a function is determined by the second elements of the pairs. Sometimes it is more convenient to consider functions as partial and to allow the domain and codomain of a function to be supersets of the narrowest sets that could be taken as the domain and codomain. For instance, it is common to talk about division as a function on the set rational numbers, that is, to take / : Q × Q −→ Q (or / : Q −→ QQ ), rather than to be “more precise” and to specify the least sets that can be taken: Q × (Q − { 0 }) −→ Q . However, an important point in either case is that the division function cannot become an argument of itself. This is quite obvious notationally, because /3 is not even a well-formed 3 . As another expression without further variables or numbers as, for instance, in x/y quick example, let us consider a connective from sentential logic. As long as ∨ (disjunction) is a connective, ∨ cannot take numbers as its arguments. This is so despite the temptation induced by the apparent structure of an English sentence such as “ x equals to 0 or 1 .” The string x = (0 ∨ 1) is not well-formed formula; neither is ∨∨ . Type-free CL does not place any restriction on the applicability of a function to an object, and since all functions are objects, a function can be applied to itself too. This does not mean that all strings in the language of CL are well-formed terms, however, the exceptions are due only to misplaced occurrences of the auxiliary symbols that indicate grouping. )x((KK is not a CL-term, but not because K cannot be applied to K , but because the parentheses are not well-balanced and they do not surround complex terms, which is the only permitted way for them to appear in a term. Typed CL introduces a completely new category of expressions: types. The expressions of primary concern are neither CL-terms, nor types on their own, but their pairs. D EFINITION 9.1.1. (S IMPLE TYPES ) Let P be the set of basic types. ( P = 0/ is not an interesting case, hence we stipulate that card(P) ≥ 1 .) The type constructor is → , which is a binary function on types. The set of simple types is inductively defined by (1) and (2). (1) If α ∈ P , then α is a type; (2) if τ and σ are types, then (τ → σ) is a type. As a notational convention, we may omit the outside parentheses from types together with parentheses from right-associated types.


Chapter 9.

Typed combinatory logic

239

The last notational convention might seem to be a typo; however, it is not. Once we put types and terms together, it will be clear that omitting parentheses from leftassociated terms and from right-associated types concur with each other. Exercise 9.1.1. Restore the parentheses in the following types. (a) (α → β) → (α → β → γ) → α → γ , (b) (δ → γ) → (γ → α) → δ → α , (c) ((γ → γ) → (α → ε) → δ) → (α → ε) → (γ → γ) → δ . Exercise 9.1.2. Omit as many parentheses as possible from the types in (a)–(c) —

without introducing ambiguity. (a) (α → ((α → β) → β)) , (b) ((β → (δ → ε)) → ((γ → β) → (γ → (δ → ε)))) , (c) ((((α → (ε → δ)) → ((δ → ε) → (ε → α))) → (α → (ε → δ))) → (α → (ε → δ))) . The types may be thought of along the lines outlined above, that is, indicating the range of inputs and the range of outputs for a function. This interpretation is important for functional programming languages. Another interpretation is obtained by considering types as formulas, which is suggested by the use of the (short) → symbol. The formulas-as-types approach has proved to be productive not only from the point of view of CL, but also from the point of view of implicational logics. There are two ways to combine CL-terms and types, which are often called Church typing (or explicit typing) and Curry typing (or implicit typing). In the former approach, terms are typed by a type giving rise to a new set of objects: typed terms. The second approach takes a slightly more flexible view in that some terms can be assigned a set of types rather than a single type, and the set may be neither the empty set, nor a singleton. This explains why the two kinds of typing are sometimes called explicit and implicit typing. The Church-types can be seen to restore for functions (i.e., CL-terms) their domains and codomains similarly to the set theoretic view of total functions. But it may be thought that this leads to a too detailed typing in which a higher level of abstraction gets lost. Although the identity functions on Z+ and on Z− are not the same, they are both restrictions of the identity function on Z . Moreover, they both can be characterized as the set of all pairs of the form hx, xi , with the only difference being the set over which the variable x ranges. One could even contend that all the functions that are called identity functions — from set theory to universal algebra and category theory — have something in common, and that is exactly what is captured by I in CL. We arrive at a similar conclusion if we recall that bound variables are merely placeholders and indicators of binding relationships within expressions. Of course, CL does not contain bound variables at all. However, the elimination of bound variables, that led to the invention of CL, was really inspired by this observation concerning, in particular, first-order logic. In other words, bound variables can always be renamed using fresh variables. This step is called α -equality in λ -calculi. In CL, the combinators are constants with no internal structure; but in the λ -calculi, the combinators are closed λ -terms, which could suggest that the types associated to the variables that occur in the closed λ -term should not affect (or somehow should affect less seriously) the type associated to the closed term.


240


The set of CL-terms is defined as before. (See definition 1.1.1.) Now we introduce a new class of well-formed expressions comprising a term and a type. D EFINITION 9.1.2. The set of typed terms is inductively defined as follows. (1) If M is an atomic term (i.e., a variable or a combinatory constant) and τ is a type, then M : τ is a typed term; (2) if M : τ → σ and N : τ are typed terms, then (M : τ → σ N : τ) : σ is a typed term. As a notational convention, we will write MN : σ for (M : τ → σ N : τ) : σ when the types of M and N can be reconstructed from the given derivation or from the surrounding text. Typed terms are often denoted by placing the type into the superscript on the term (e.g., M τ ) instead of the notation given above. The notation for types and typed terms, as well as for type assignments (that we introduce below), varies greatly. To mention only one variation, Curry used F in place of → in a prefix-style notation. Rather than try to give an exhaustive list of typing notations appearing in the (older) literature or in programming languages, we merely note that there is no uniform notation and care has to be taken in each case to determine what the intended interpretation of some notation involving functions, terms, types, etc., is. The above definition plays a role similar to that of the definition of well-formed formulas in first-order logic. However, that is only the initial step, which is followed by some characterization of provable formulas or logically valid formulas. The typing systems in CL are often presented as natural deduction calculi. Natural deduction systems include introduction and elimination rules for logical constants, and they may include axioms too.1 For example, if conjunction, ∧ , is a logical connective, then in a natural deduction system, there is a rule that specifies how a formula A ∧ B may be introduced when one or both of the wff’s A and B are somehow already in the derivation. Another rule specifies how a conjunction can be used to conclude A or B . The rules of a natural deduction calculus may be displayed by vertically or by horizontally arranging the premises and the conclusions. We will use the latter style of picturing the rules of typed CL, and so we give as an example the rules for ∧ presented horizontally. ∆À ∆`B ∆ ` A∧B

I∧

∆ ` A∧B ∆À

E∧

∆ ` A∧B ∆`B

E∧

Capital Greek letters stand for sets of wff’s, ` indicates derivability, and I and E are labels that, respectively, stand for introduction and elimination. An informal rendering of the I∧ rule is that, if A and B are both derivable from a set of wff’s ∆ , 1 Natural

deduction systems (for classical and intuitionistic logics) were introduced by Gentzen [] with the idea that these systems closely resemble the way how people reason from assumptions to conclusions.


Chapter 9.

241


then A ∧ B is derivable from the same set of formulas. The elimination rules exhibit two — very similar — ways to use a formula that is a conjunction in a derivation: if A ∧ B is derivable from ∆ , then the same set of wff’s ∆ suffices for the derivation of either conjunct A and B . The rules for conjunction are, probably, the easiest to understand from among the natural deduction rules, which is one of the reasons we use them here as examples. Also, these rules will reappear in an adapted form in the next section. Returning to simple types, we note that the only type constructor is → . The natural deduction rules for → in classical logic are: ∆, A ` B ∆À→B

I→

∆À→B ΓÀ ∆, Γ ` B

E→.

The expressions ∆, A and ∆, Γ indicate sets of formulas too, namely, ∆ ∪ { A } and ∆ ∪ Γ . The two rules for → can be viewed as inference steps that correspond to the deduction theorem and the rule modus ponens in an axiomatic formulation of classical logic. The natural deduction systems NK (for classical logic) and NJ (for intuitionistic logic) from Gentzen [] do not contain any axioms. However, if we are aiming at adding CL-terms to rules like I → and E → , then we have to consider the meaning of the types (i.e., wff’s) in relation to the terms. As we already mentioned, the informal idea behind associating A → B to a function was that the type describes the domain and codomain of the function, which is the interpretation of the term. Then the I → rule should be amended by terms so that from terms with types A and B , a term with type A → B is formed. This can be done without difficulty in λ -calculus where λ is an operator that creates a function. However, CL does not contain a λ -operator as a primitive, rather the effect of the λ -operator can be simulated by bracket abstraction. As a result, a natural deduction system for typed CL does not have a I → rule; rather it contains axioms for all those combinators that are taken to be undefined. We use lowercase Greek letters α, β, . . . as variables for basic simple types, and we use lowercase Greek letters τ, σ, . . . as variables for simple types, as in definition 9.1.1. Now — unlike in the sample natural deduction rules from classical logic — we use uppercase Greek letters Γ, ∆, . . . for sets of typed terms, where each term is a variable. ∆, Γ is the union of the two sets ∆ and Γ , moreover, we call a set of typed terms univalent whenever each variable that occurs in the set (as a typed term) has a unique type.2 D EFINITION 9.1.3. (S IMPLY- TYPED CL, CL → ) The axioms and the rules of CL → , the simply-typed CL, are the following. We assume that the undefined combinators are S and K , and that all assumption sets are univalent.

2 Sometimes

such sets are called consistent; however, “consistent” is an overused term, which would be also misleading here in view of the intersection type system introduced in the next section.


242


∆ ` x : τ if x : τ ∈ ∆ ∆ ` S : (α → β → γ) → (α → β) → α → γ ∆ ` M: τ → σ Γ ` N: τ ∆, Γ ` MN : σ

E→

`S

id

∆ ` K: α → β → α

∆ ` M: τ [αi /σi ]i∈I ∆ ` M : [αi /σi ]i∈I τ

`K

sub

The first axiom is an artifact of the horizontal presentation of the natural deduction system: any assumption is, of course, derivable from the assumption set in which it occurs. The two other axioms give types to the combinators S and K . Notice that the types for the combinators in these axioms are specified using basic types. The rule on the left looks somewhat similar to the formation clause in definition 9.1.2, as well as to the implication elimination rule in NK . (The latter similarity explains its label.) But E → adds here an important condition for applicability, namely, that M : τ → σ and N : τ are provable from some sets of assumptions. The last rule is the rule of substitution. Since the types for the two combinators S and K in the axioms include the basic types α, β and γ explicitly, we need a substitution rule if we intend to give types to complex combinators. In general, the rule of substitution allows us to obtain typed terms from typed terms, in which the terms look the same as before and the types are alike too but they are (typically) more complex. We adapt the substitution notation for sets of type assignments: [αi /σi ]∆ means that for each x : τ ∈ ∆ the substitution is performed on the type, as in x : [αi /σi ]τ . We kept terms and types as disjoint sets of expression in CL → , hence no confusion will arise from the extension of the scope of the substitution operation, because a type cannot be substituted in a term (or vice versa). As we already mentioned a requirement on the assumption sets in the axioms and rules is that they are all univalent. This creates a condition for applicability in one case, because ∆, Γ cannot contain any x with τ and σ , if those types are not the same. Typically, one would like to find derivations of typed terms with as small an assumption set as possible. For instance, 0/ ` S : (α → β → γ) → (α → β) → α → γ clearly includes the minimal assumption set. (The 0/ symbol is usually omitted in lieu of a little space on the left-hand side of ` , and we will occasionally omit 0/ .) There is a parallel here with classical logic, which allows, for instance, the derivation of (A ∧ B) ∨ (A ∧ C) from { A, B ∨ C, E ∧ ¬E } , but a more economical premise set (without the plain contradiction E ∧ ¬E ) produces a more interesting claim about derivability in classical logic. The notion of a proof in CL → is quite standard. A proof is a tree, in which each node is of the form ∆ ` M : τ (with some ∆, M and τ ), the leaves of the tree are instances of the axioms, and all other nodes are justified by an application of one of the two rules. If ∆ ` M : τ is the root of a tree that is a proof, then this can be phrased as “given the set of typed variables ∆ , the CL-term M is typed by the simple type τ .” Example 9.1.4. Let us consider the terms x and y . If we type them, respectively, as


Chapter 9.


243

α → β and α , then we may get the derivation: {x: α → β} ` x: α → β {y: α} ` y: α . { x : α → β, y : α } ` xy : β This sample proof includes a small binary tree with three nodes. Notice that the axioms are merely repetitions of an assumption — of the only assumption in the singleton sets. It is usually taken to be self-evident in natural deduction systems that an assumption set implies each of its elements, though in some formulations a reiteration rule may be needed too. We use the ` symbol to separate the premises from their consequences, which necessitates the inclusion of the identity axiom. The derivation could be started with nonminimal sets of typed terms with the same end result. { x : α → β, y : α } ` x : α → β { x : α → β, y : α } ` y : α { x : α → β, y : α } ` xy : β Even larger sets of typed variables could be taken, because neither the axioms, nor the rules require that all the variables on the left of the ` occur on the right too. Alternatively, we could modify the combinatory axioms ` S and ` K by setting ∆ = 0/ , and the id axiom assigning a type to a variable by setting ∆ = { x : τ } . With the original rules, { x : α → β, y : α, z : β } ` xy : β is provable; however, it would no longer be provable in the modified natural deduction system. The equivalence of the two systems could be restored by adding a monotonicity (or weakening) rule like ∆ ` M: τ , ∆, Γ ` M : τ where ∆, Γ is required to be univalent as in the other rules. Exercise 9.1.3. Prove that the modified natural deduction system with the monotonicity rule added is equivalent to CL → from definition 9.1.3.

The types that we assigned to S and K are well-known formulas in logic.3 (A → B → C) → (A → B) → A → C (with Roman letters standing for wff’s) is known as the self-distribution of implication on the major. The wff A → B → A is called positive paradox, because of the counterintuitive meaning of this wff, when the connective → is interpreted as implication. It may be a good idea to take some familiar formulas as types for combinators, but that is surely not a sufficient reason to select these two wff’s (rather than some other wff’s) as types for S and K . Let us recall that the axiom of K is Kxy B x . If x is to be typed by α , then the type of Kxy should be α too. Using the E → rule, which, in effect, says that application in a term is detachment in the type, we can see that K should have a type that has two antecedents (i.e., the consequent of the whole wff should be a type with 3 Of

course, we assume a little squinting to help us to see expressions in two languages as similar or the same.


244


→ ), the first of which is α . Since we do not have any information about the type of y , we may assume that that is β (i.e., a type possibly different from α ). These pieces completely determine what the type of K is: α → β → α . In the case of Church typing, K has many typed “alter egos,” and the one with type α → α → α is a different typed term than the K in the axiom for K . So is the one with type β → γ → β — despite the fact that (the untyped) K is a component of each of these typed terms. Here is a derivation that shows how we get α for the compound term Kxy . ` K: α → β → α {x: α} ` x: α { x : α } ` Kx : β → α {y: β} ` y: β { x : α, y : β } ` Kxy : α Exercise 9.1.4. Write out the derivation of Sxyz : γ step by step. What is the (smallest

possible) assumption set for this typed term? We gave types for only two combinatory constants. Since all the combinators are definable from S and K , their typed versions should be derivable by choosing these combinators with suitable types, and then deriving the types of the complex combinators according to their definition. Exercise 9.1.5. Try to discover the type of B from its axiom Bxyz B x(yz) . Is the type the same as the type obtained from the definition of B and using CL → ? (Hint: Recall that B is definable as S(KS)K .) Exercise 9.1.6. Try to find suitable types for the combinators C , W and J . (Hint:

Their axioms are listed in section 1.2.) Having seen some examples, now we take a look at what happens if we have, for example, K : α → β → α and we (attempt to) apply this typed term to itself. (We mention the basic types α and β explicitly to keep the example uncomplicated.) The type α → β → α should be detached from itself, that is, from α → β → α . This is, obviously, impossible, because no implicational wff can be detached from itself. If the type is atomic, then the nonapplicability of detachment is even more conspicuous. Indeed, the Church typing system does not allow a typed term to be applied to itself, which is vividly illustrated by the case of a variable.4 {x: δ → ε} ` x: δ → ε {x: δ → ε} ` x: δ → ε { x : δ → ε } ` xx : ??? L EMMA 9.1.5. Some CL-terms cannot be typed in the Church typing system CL → . However, by definition, the type of a typed term (if there is one) is unique. Proof: The proof is by the preceding attempted derivation together with the observation that the substitution rule cannot remedy the situation, because the substitution is applied to all the typed terms in the set of assumptions as well as to the typed term on the right-hand side of the ` . qed 4 Of

course, ??? is not a type; we inserted the question marks to emphasize that there is no suitable simple type for this CL-term.


Chapter 9.

245


D EFINITION 9.1.6. The CL-term M is called typable by the type τ iff there is a derivation in CL → ending with ∆ ` M : τ . The above lemma then says that not all CL-terms are typable. This is an important claim, and it is also important to realize that not only terms of the form MM are untypable. The rule of substitution affects the typed terms on both sides of the turnstile, but on the left-hand side, we can have only variables. Thus even using the Church-style typing we can have the derivation: ` K: α → β → α ` K : (α → β → α) → γ → α → β → α ` KK: γ → α → β → α

` K: α → β → α

.

The two occurrences of K in KK are not the same typed terms. Reversing the notational convention that we introduced above, the bottom line in the derivation is ` (K : α → β → α K : (α → β → α) → γ → α → β → α) : γ → α → β → α, which makes obvious that the two K ’s are not the same typed terms. There are no variables involved in the derivation, which underscores that combinators should be characterizable by the structure of the type they can be given rather than by the concrete types their arguments can take (or the concrete types that would occur as types of the term when combinators are viewed as closed λ -terms). If we could “forget” or “overlook” the fact that the two occurrences of K have different types, then it seems that we could type — at least some instances of — terms that are self-applications. Curry-style type systems differ from the Church-style type systems in how combinators are typed. It is usual to read M : τ as a type assignment statement rather than the statement that M has the type τ . We introduced this notation for the typed terms already in order to make a smooth transition to the type assignment systems, which we will focus on from now on. Variables can be assigned arbitrary types as before, and x : τ is read as “ τ is a type assigned to the variable x .” A univalent assumption set ∆ may not contain both x : σ and x : τ provided that σ 6= τ . Combinators and terms that contain combinators are now viewed as sets of types with no assumption of univalence (or that the set is a singleton). That is, the derivation of a particular type assignment M : τ means only that τ is one of the types that can be assigned to M (possibly, depending on a set of assumptions). If Z is a combinator, then a derivation may contain Z : τ and Z : σ , while τ 6= σ . To make the change in the meaning of M : τ official, we give the next definition (that supersedes definition 9.1.2). D EFINITION 9.1.7. Let τ be a type and let M be a term. Then M : τ is a type assignment in a Curry-style typing system.


246


If we compare definitions 9.1.2 and 9.1.7, then we see that the latter one is simpler. The former definition paralleled the definition of terms (cf. definition 1.1.1) with an additional condition concerning types, which now emerges from proofs (only). The definition of the natural deduction system for type-assignment is the earlier definition 9.1.3. Notice that in virtue of the notational convention concerning the hiding of the types of subterms, all the axioms and rules can be easily viewed now as type assignments. Old terminology in logic, especially in syllogistics, included a distinction between subjects and predicates. Some of the literature on typed CL inherited and retained this terminology (with modified content): the term is called the subject and the type is called the predicate. We do not use this terminology, because it would add unnecessary complication without any gain in the understanding of typed terms or type assignments. However, some lemmas and theorems are commonly labeled with reference to this terminology, and we use those labels for an easy identification of results. L EMMA 9.1.8. (S UBJECT CONSTRUCTION ) Let D be a derivation of the type assignment ∆ ` M : τ . Let D0 be a tree that is obtained by omitting each premise set from the left-hand side of each ` together with ` itself. Further, all the type assignments (i.e., the : τ ’s) are omitted after each term. Lastly, if there is an application of the substitution rule, then one of the two nodes of the tree is omitted too. D0 is the formation tree of the term M . Proof: The proof is by structural induction. 1. If D is ∆ ` M : τ , then it is an instance of one of the axioms. For example, the root may be ∆ ` K : α → β → α . Then ∆ , ` , : and α → β → α are omitted. K is the formation tree of the combinator K . The two other axioms are similar. 2. Let us assume that D ’s height is greater than 1 . One possibility is that the last step in the derivation is of the form ∆ ` M: τ → σ Γ`N: τ . ∆, Γ ` MN : σ By the inductive hypothesis, D01 and D02 obtained from the subtrees rooted by the two premises of the rule are formation trees of M and of N , respectively. The transformation adds a new root with binary branching incorporating the two trees D01 and D02 , and the new root is MN . Then D0 is indeed the formation tree of the latter term. Now let us assume that the last step in D is an application of the substitution rule. The last but one line in D is ∆ ` M : σ , and the transformation gives D01 which, by the hypothesis of induction, is the formation tree of M . However, the last line in D contains the same term M , and one of the two occurrences of M is omitted from D0 . Thus the claim is clearly true. qed The previous lemma means that in a derivation all the subterms of a term appear as terms. Moreover, each subterm appears in the leaves as many times as it occurs


Chapter 9.


247

in the term at the root. The next lemma can be proved using the previous lemma together with the fact that each node in a derivation contains a type assignment on the right-hand side of the ` .5 L EMMA 9.1.9. If ∆ ` M : τ is derivable in CL → , then every subterm of the term M is typable. For the sake of emphasis, it is useful to re-state the theorem in a contraposed form. C OROLLARY 9.1.9.1. If M is not typable, then no term N , of which M is a subterm, is typable in CL → . The application operation is the basic syntactic operation on terms. Given provable type assignments, it parallels modus ponens performed on types. However, the possibility of forming terms from terms is not the only and not the most interesting relation on the set of CL-terms. The paramount relation on CL-terms is weak reduction. It is remarkable that types are preserved under this relation, but before we can state and prove that theorem we need the following lemma. L EMMA 9.1.10. Let D be a derivation of ∆ ` M : τ , and let N be a subterm of M such that there is a D0 , which is a subtree of D , and D0 ends in ∆0 ` N : σ . If ∆0 ` P : σ is provable, then ∆ ` [N/P]M : τ is provable as well, where [N/P]M is the result of the replacement of the subterm N , which corresponds to the occurrence of the term N in D0 , by P . Proof: The claim of the lemma can be rephrased to say that the replacement of a subterm with a term does not affect typability as long as the new term can be typed with the same type given the same set of type assignment assumptions. The derivation of ∆ ` M : τ contains a subtree with a root ∆0 ` N : σ , where this N is the occurrence of the subterm that is replaced, by lemma 9.1.8. P : σ has a derivation with the same assumption set ∆0 . We only have to ensure that the replacement of the subtree of N with the tree of P results in a derivation of ∆ ` M : τ . If N is M , then the claim is trivially true, because ∆ ` P : σ is a derivation by the hypothesis of the lemma. Otherwise, one of the two rules, E → and sub, has been applied to ∆0 ` N : σ in D . The substitution rule does not affect N , and ∆0 as well as σ are the same in ∆0 ` N : σ and in ∆0 ` P : σ . If the rule that was applied to N is the E → rule, then there are two subcases to consider. The part of the derivation .. .. in focus might look like . . ∆00 ` Q : σ → χ ∆0 ` N : σ . ∆00 , ∆0 ` QN : χ Clearly, the following is a derivation too. .. .. . . ∆00 ` Q : σ → χ ∆0 ` P : σ ∆00 , ∆0 ` QP : χ 5 The

notion of typability is literally the same as before — see definition 9.1.6 — but CL → is the Currystyle type assignment system now.


248


The other subcase, when ∆0 ` N : σ is the left premise, is similar and we omit its details. qed The above lemma does not allow us to simply replace a subterm by a term — unlike the replacement in type-free CL. P must be typable, moreover, it must be typable with the same σ as N , given the same set of type assignments for variables. We have informally suggested that types should be preserved under Bw , when we motivated the particular type appearing in axiom ` K . The following theorem shows that the system CL → is designed so that this invariance holds for all terms. T HEOREM 9.1.11. (S UBJECT REDUCTION ) N . Then ∆ ` N : τ in CL → .

Let ∆ ` M : τ in CL → , and let M Bw

Proof: The two combinators that we included are S and K . They are both proper; that is, they cannot introduce new variables or constants. If M Bw N , then there is a finite chain of one-step reductions that starts with M and leads to N . Accordingly, the proof is by induction on the length of the sequence of B1 steps. 1. If M and N are the same terms, which is possible due to the reflexivity of Bw , then the claim is obvious. 2. Let us suppose that the claim is true for a sequence of B1 steps of length n ≥ 1 . We may assume, for the sake of concreteness, that M Bw N 0 B1 N , and that N 0 contains a redex of the form KQ1 Q2 . Then N 0 is [KQ1 Q2 /Q1 ]N . By lemma 9.1.8, a derivation of ∆ ` M : τ contains a subtree rooted with ∆0 ` KQ1 Q2 : σ , that is, KQ1 Q2 is typable, and so are Q1 and Q2 . The typability of M by τ given ∆ may not determine uniquely the type of Q1 and Q2 , but we may suppose that K , Q1 and Q2 , respectively, can be assigned the types σ → χ → σ , σ and χ in accordance with the derivation. KQ1 Q2 Bw Q1 , and clearly the reduct has the same type as KQ1 Q2 has. Since Q1 and Q2 are subterms of KQ1 Q2 , if ∆0 ` KQ1 Q2 : σ , then ∆0 ` Q1 : σ and ∆0 ` Q2 : χ must be provable. σ → χ → σ can be assigned to K , since this is a substitution instance of the type in K ’s axiom. This establishes that there is a derivation of ∆0 ` KQ1 Q2 : σ with Q1 and Q2 having the stipulated types, and having the assumption set ∆0 . First, we replace the subtree ∆0 ` KQ1 Q2 : σ in the derivation of ∆ ` M : τ by the (potentially new) subtree ending in ∆0 ` KQ1 Q2 : σ . The new derivation of ∆ ` M : τ is clearly a derivation, because the roots of the subtrees are the same, namely, ∆0 ` KQ1 Q2 : σ . Now we apply lemma 9.1.10. The new derivation of ∆ ` M : τ contains a subtree with root ∆0 ` Q1 : σ , and now we replace the subtree rooted in ∆0 ` KQ1 Q2 : σ with this subtree. The resulting tree is a derivation of ∆ ` [Q1 /KQ1 Q2 ]M : τ . We leave the case when the head of the redex is S as an exercise. qed Exercise 9.1.7. Consider the other possible case of a one-step reduction in the above proof, that is, when the redex is headed by S . Write out the details of the case. Exercise∗ 9.1.8. In the proof of the last theorem, we mentioned that it may not be

possible to recover the types of all subterms uniquely from ∆ ` M : τ itself. Construct a pair of derivations that illustrates this phenomenon.


Chapter 9.


249

It is useful to state (a special instance of) the claim of the previous theorem in contraposed form. C OROLLARY 9.1.11.1. If the term M is not typable and M is the result of a onestep reduction of N , then N is not typable either. In other words, a term obtained by one-step expansion from a nontypable term is not typable either. In contrast with this corollary, we might wonder whether a subject expansion theorem could be proved. To put it differently, the question is whether typability is preserved in both directions along the B1 relation. L EMMA 9.1.12. There is a term M , which is not typable but obtained from a typable term N by expansion. In other words, there is a nontypable term M , such that M Bw N and N is typable. Proof: We would like to have a simple CL-term to prove this lemma. The term KxM is not typable, if M is not typable, but KxM Bw x , and x is clearly typable both in itself, and also as a subterm of Kxy , for example. Thus we only have to find a nontypable term (possibly, without an occurrence of x ). The prototypical term that is not typable by simple types is WI , that is, M . Exercise 9.1.6 asked you to try to discover types for three combinators — including W . The type of I is nearly obvious: τ → τ , and later we will see that SKK : α → α is provable in CL → . The identity combinator takes a term as its argument and returns the same term as its value. If x : τ , then we want to have Ix : τ ; therefore, I should have self-implication as its type. The type of W is the formula that is usually called contraction: (σ → σ → τ) → σ → τ . In order to type WI , we have to detach an instance of τ → τ from the type of W . This means that σ and σ → χ must be unified; that is, we need to instantiate these types so that they become the same type. A bit more precisely, substitutions have to be found for σ and χ such that once they are applied to both σ and σ → χ the resulting types coincide. We could try substituting σ → χ for σ . This would turn σ into σ → χ , which is the other type — before the substitution. However, the same substitution has to be applied to σ → τ too, and [σ/σ → χ]σ → χ is (σ → χ) → χ . Of course, we could try other substitutions, for instance, we could substitute σ for χ . But the problem really is that σ is a proper subformula of σ → χ ; hence, there is no substitution that can turn the two formulas into the same formula. This fact is often phrased as “an implication is not unifiable with its antecedent.” To see that M is not typable without appealing to its definition as WI , we might look at the reduct of Mx , that is, at xx . The latter term is not typable, thus Mx is not typable either, by corollary 9.1.11.1. A variable can be assigned an arbitrary type, hence if Mx is not typable, then M must be the subterm that is not typable. We can now put together the untypable term that reduces to a typable one. We have Kx(My) B1 x . qed The proof used the informal procedure of assigning types to terms that we introduced before exercise 9.1.4. In CL → , we have two combinatory axioms, and the procedure’s result for K and S coincide with the types in the axioms ` K and ` S .


250


Indeed, using a definition of W (from { S, K } ), and then performing detachments between minimally suitable instances of the types of S and K , we would get the same type for W as the one mentioned above (modulo relabeling the type letter by letter). Although the procedure always works in the case of proper combinators (if the combinator is typable), in general, there is no guarantee that the types assigned to a term in this fashion yield a type assignment that is derivable in CL → . The fixed point combinator Y is definable from certain combinatory bases, even from bases that are not combinatorially complete. However, we can take Y to be a primitive combinator in CL with the axiom Yx B x(Yx) . Let us apply the strategy that we demonstrated before exercise 9.1.4 to see whether we can assign some implicational type to Y . We may assign any type to x , thus let us say, x : σ and Y : σ → τ . Then the term on the left-hand side of B has type τ . We would like to assign the same type to the reduct of Yx , and so we want to make the type of x implicational, because the reduct is of the form xM . Let us then modify the previous types by taking σ to be σ1 → σ2 . Then M , that is, Yx must have type σ1 . That is not a problem, because we can adjust further the types stipulated so far: we simply identify σ1 and σ2 . The resulting type on the right-hand side of B will be σ , hence we identify τ and σ too. To summarize what we have gotten about assigning a simple type to Y at this point, we list all the subterms and their assigned types (using only one type χ to avoid confusion with the types above). x : χ → χ , Y : (χ → χ) → χ , Yx : χ and x(Yx) : χ . It appears that we succeeded in assigning a type to Y , but there is an arbitrary choice we made — unlike in the case when we applied this procedure to K . We could have started with Yx Bw x(x(Yx)) . This is not the axiom for Y , however, given theorem 9.1.11, we wish to have x(x(Yx)) : χ as well. According to the type assignments, we have now, x : χ → χ and x(Yx) : χ . This gives x(x(Yx)) : χ as we wanted to have. By induction on the structure of the reducts of Yx , we can prove that each of them gets the same type χ . It would seem that we can add the axiom Y : (α → α) → α to CL → . A problem is that this type for Y is not derivable from its definition from { S, K } in CL → — unlike the types for W , I and B , for example. Another objection to adding such an axiom will emerge when we will see that all terms that are typable in CL → have an nf, but Yx has no nf. Nonetheless, sometimes, this type is added in typed functional programming languages, where often there are other type constructors beyond → .6 To be more precise, a typing rule might be added that allows forming the fixed point of a function. ∆ ` M: τ → τ ∆ ` YM : τ The result of an addition of a rule like the one above is nearly the same as including an axiom for Y , except that the type assignment ` Y : (α → α) → α is not provable.

6 See,

for example, Pierce [, p. 144], where fix is introduced.


Chapter 9.


251

Exercise 9.1.9. Find and list all the subterms together with their types (if any) of the following two terms each of which defines Y. (a) BM(CBM) , (b) BWI(BWB) . (Hint:

In exercises 9.1.5 and 9.1.6, some of the combinators that you were asked to find types for were B , C and W .) Exercise 9.1.10. We claim that the term W(BB(B(BW))BC)(BWB) is not typable either. What does this term do? Why is this term not typable? (Hint: Find the subterms in this term that are not typable.)

Lastly, we may also notice that (α → α) → α is not a theorem of classical logic, let alone of intuitionistic logic. Let α be false, then α → α is true, but (α → α) → α is obviously false according to the truth matrix for → in classical logic. This strongly suggests that we should not include ` Y : (α → α) → α as a new axiom into CL → , and we will not consider this extension of the type assignment system CL → here. L EMMA 9.1.13. All the simple types that can be assigned to a combinator in CL → are theorems of H→ , that is, of the implicational fragment of intuitionistic logic. Proof: The statement actually follows from the Curry–Howard isomorphism, which concerns proofs in H→ (not only theorems), and we will prove that theorem later. However, it is useful to record this result now. The formulas A → B → A and (A → B → C) → (A → B) → A → C are axiom (schemas) of H→ , and A → B and A imply B is the (only) rule of inference. Substitution is either a primitive rule or it is an admissible rule as a result of the calculus comprising schemas rather than concrete axioms. A combinator does not contain any variables, hence we may choose all the ∆ ’s to be void in the CL → derivation (without destroying the derivation itself). By the subject construction theorem, if ` Z : τ is provable, then the proof is a tree, in which the leaves are instances of the combinatory axioms. The types in those axioms are instances of the axioms in H→ , and applications of E → and sub, the two rules of CL → , are instances of applications of the two rules in H→ , when the CL-terms are omitted (or disregarded). qed Now we return to CL → (without axioms for Y or for similar combinators) and to the issue of typability and type preservation under expansions. It is not very surprising that dropping a nontypable term utilizing a cancellator produces a counterexample to preservation of typability under expansion. There is a, perhaps, less obvious way to obtain a typable term from a nontypable one via one-step reduction. Example 9.1.14. We have elaborated on xx not having a simple type. However, we emphasized that in a Curry-style typing system, certain combinators that are selfapplications of a combinator are typable. II is typable, for instance, by τ → τ , because the left I can be assigned the type (τ → τ) → τ → τ , and the right I can be assigned the same type τ → τ as the type for II . Clearly, no combinator Zxx can have a type that has xx in its reduct, because xx is not typable. If there is a subterm xx in the reduct of Zxx , then Zxx is a duplicator.


252


However, it might happen that the reduct of a redex headed by Zxx is typable, for example, because I occurs in the place of the argument x . (Of course, putting I ’s in place of the x ’s may not be sufficient in itself for the typability of the reduct. There might be a y for which Zxx is a duplicator too, etc.) Example 9.1.15. WI K is not typable, however, WI K B1 I KK , and the latter term is typable as the next (segment of a) derivation makes it transparent. On the top line, we abbreviate α → β → α by π (in order to fit the derivation onto the page). .. .. . . ` I : (π → γ → π) → π → γ → π ` K: π → γ → π ` I K : (α → β → α) → γ → α → β → α ` K: α → β → α ` IKK: γ → α → β → α The type we assigned to I K K here is the same that we assigned earlier to K K . We could hope that if expansion is limited to combinators that are not cancellators or duplicators then the type, and therefore, typability is preserved. Of course, an immediate problem with such a theorem is that it is not applicable to CL → as it is, because S is a duplicator and K is a cancellator. In other words, the theorem would be vacuously true, since it would not cover any expansion steps. Lemma 9.1.12 showed why K has to be excluded from expansion. In example 9.1.15, we used WI and emphasized the presence of a subterm xx ; thus it might appear the exclusion of S is overly zealous, since the reduct of Sxyz does not contain an occurrence of xx . Notice, however, that SII defines M just as WI does. The moral is that not all expansion steps introducing K and S lead to a nontypable term given a typable one, but we have no way, in general, to characterize and separate those that do and those that do not. To ensure that both the subject reduction and subject expansion theorems are provable and applicable, we may start with a different combinatory basis that does not include a cancellator or a duplicator. (Of course, no such basis is combinatorially complete.) D EFINITION 9.1.16. The type assignment calculus CL (B, C, I)→ is defined by the following four axioms and two rules. (Again, all the assumption sets are stipulated to be univalent.) ∆ ` x: α

if x : α ∈ ∆

∆ ` B : (α → β) → (γ → α) → γ → β

id

∆ ` C : (α → β → γ) → β → α → γ ∆ ` M: τ → σ Γ`N: τ ∆, Γ ` MN : σ

E→

`C

Ì

∆ ` M: τ [αi /σi ]i∈I ∆ ` M : [αi /σi ]i∈I τ

The notions of derivability and typability are as before.


∆ ` I: α → α

`B

sub

Chapter 9.


253

T HEOREM 9.1.17. (S UBJECT EXPANSION ) Let M and N be terms over the combinatory basis { B, C, I } . If M Bw N and ∆ ` N : τ is provable in CL (B, C, I)→ , then so is ∆ ` M : τ . Proof: The set of terms over { B, C, I } (with a denumerable set of variables) is called the set of linear terms. All terms in this set have the property that if M Bw N then fv(M) = fv(N) ; therefore, it is straightforward to establish a 1–1 correspondence between occurrences of the variables in M and N even if a variable occurs more than once in both M and N . Of course, occurrences of combinators need not be preserved in a similar way, for the obvious reason that a combinator might be the head of a redex. The subject construction lemma (i.e., lemma 9.1.8) and the replacement lemma (i.e., lemma 9.1.10) are true for CL (B, C, I)→ as well. Let us assume that there is a derivation of ∆ ` N : τ in CL (B, C, I)→ . Because of the linearity of the term N , all the variables in M (if there are any) are in N , and all the variables that occur in N are in ∆ too. Therefore, ∆ ` N : τ has a derivation in which at each node, a variable is assigned a type in the assumption set iff the variable occurs in the term on the right-hand side of the ` . Also, the substitution steps (if there are any in the particular derivation of ∆ ` N : τ ) may be replaced by substitution steps on axioms. Then there is a derivation D of ∆ ` N : τ such that all the assumption sets except for instances of the id axiom are ∆ ’s.7 The rest of the proof is by induction on the length of Bw , that is, on the number of one-step expansions that comprise the converse of Bw linking N and M . If the length is 0 , then the claim is obviously true. We assume that the claim is true for expansions of length n , and we show that it is true when one more step is added. There are three cases to consider, depending on the combinator that is the head of the newly introduced redex. Let us assume that I is the head, and P is a subterm of N that is replaced by I P. P is typable, and in fact, ∆0 ` P : σ (where ∆0 6= ∆ only if P is a variable) is a subtree of the derivation D of ∆ ` N : τ (where all the assumption sets have been harmonized). We only have to show that I P can be typed by σ . .. ∆ ` I: α → α . ∆ ` I: σ → σ ∆ ` P: σ ∆ ` IP: σ .. . ∆ ` [P/I P]N : τ The above section of a tree is a derivation provided the subtree above the ellipsis is replacing the subtree that has as its root ∆0 ` P : σ in the original derivation D . The next case is C . Let us assume that the particular subterm that is expanded is P1 P2 P3 , which becomes C P1 P3 P2 after the expansion. Then there is derivation 7 See

lemmas 9.1.19 and 9.1.20 below, in which similar claims for CL → are proved.


254


of ∆ ` P1 P2 P3 : σ , which is a subtree of the derivation D of ∆ ` N : τ , due to the subject construction lemma. Then there are derivations of ∆ ` P1 P2 : τ1 → σ and ∆01 ` P3 : τ1 , as well as of ∆02 ` P1 : τ2 → τ1 → σ and ∆03 ` P2 : τ2 . (In the three latter cases, if ∆0i 6= ∆ , then Pi is a variable. However, ∆0i = ∆ if Pi is not a variable, and the assumption sets may be identical even in some cases when Pi is a variable.) We have to show that, given all these subderivations, ∆ ` CP1 P3 P2 : σ is derivable. Let us consider the following segment of a derivation. π1 and π2 , respectively, abbreviate (α → β → γ) → β → α → γ and (τ1 → τ2 → σ) → τ2 → τ1 → σ . ∆ ` C : π1 ∆ ` C : π2 ∆02 ` P1 : τ2 → τ1 → σ ∆01 ` P3 : τ1 ∆ ` C P1 : τ1 → τ2 → σ ∆ ` C P1 P3 : τ2 → σ ∆ ` C P1 P3 P2 : σ

∆03 ` P2 : τ2

The above tree is a derivation, and if we replace the subtree with the root ∆ ` P1 P2 P3 : σ by the tree above, then we get a derivation of ∆ ` [P1 P2 P3 /C P1 P3 P2 ]N : τ . The last case is left as exercise 9.1.12. qed Exercise 9.1.11. Verify that lemma 9.1.8 and lemma 9.1.10 are true for CL (B, C, I)→

as claimed in the proof of the above theorem. Exercise 9.1.12. Complete the proof of the subject expansion theorem by writing out the details of the case when the head of the newly introduced redex is B .

The type assignments that we introduced in CL (B, C, I)→ for the combinators B, C and I are provable in CL → . Thus we could have taken the approach of extending CL → by these axioms. In virtue of the replacement lemma, such an expansion would not lead to any new typable terms when B, C and I are replaced by their definitions obtainable from S and K . L EMMA 9.1.18. The axioms for B, C and I from CL (B, C, I)→ are provable in CL → with arbitrary assumption sets, including ∆ = 0/ . Exercise 9.1.13. Prove this lemma. (Hint: Choose a definition for each of the three combinators, e.g., SKK for I , etc., and reconstruct the proof tree from the root up-

ward. Alternatively, you can construct the tree top-down, possibly, relabeling some types in the whole tree so that the types in the root match the types in the corresponding axioms.) Concerning the extension of CL → with the axioms for B, C and I , we note that we can select one of the definitions of these combinators in terms of S and K , perhaps, requiring that the terms are in weak nf, and we can think about the axioms as if B, C and I were replaced by those terms. Then the next claim is obviously true, by lemma 9.1.10 (replacement), and by lemma 9.1.18.


Chapter 9.


255

C OROLLARY 9.1.18.1. The addition of the axioms for B, C and I from CL (B, C, I)→ to CL → is conservative; that is, no new type assignments result for terms over the combinatory basis { S, K } . Linear terms get their name from linear logic, which was introduced by J.-Y. Girard in []. The implicational fragment of linear logic is what has been called BCI→ logic, which was introduced by C. A. Meredith and A. Prior in the early 1960s in []. The proof-theoretic interest in BCI→ logic stems from at least two remarkable properties. If the types of these combinators are taken as axioms with propositional variables, then a severely restricted form of the rule of detachment, called condensed detachment, almost suffices in place of detachment and substitution. In fact, the introduction of the rule of condensed detachment led to the invention of BCI→ logic, though substitution and detachment can be replaced by this rule in certain “weaker” logics too. We will return to this rule later in this section. Another attractive feature of a logic with the types of B, C and I being theorems is that, in its sequent calculus formulation, sequents may be viewed as strings of formulas (due to the associativity of the sequent-forming operation). Associativity can be linked to B and C . Furthermore, the order of the formulas is immaterial too because of the commutativity of that operation. (The commutativity is the result of the presence of C and I .) These properties lead to quite simple sequent calculi about which meta-theorems are provable without much difficulty. The possibility to use large assumption sets makes some considerations of provable type assignments easy. However, it is also useful to be able to narrow down that set when necessary. L EMMA 9.1.19. Let M be a term with fv(M) = X . If M is typable by τ , then there is a proof in CL → with root ∆ ` M : τ , where ∆ does not assign types to any variables other that those in X . Therefore, x : σ ∈ ∆ , with some σ , iff x ∈ fv(M) . Proof: For the right-to-left direction, let us assume that x ∈ fv(M) . By lemma 9.1.8, every occurrence of x in M corresponds to a leaf in a proof D of ∆0 ` M : τ , where ∆0 is some assumption set. The existence of a proof D follows from the hypothesis of the lemma that M is typable by τ . In a derivation, the only operation on assumption sets is union, therefore, x is assigned a type by ∆0 , whatever ∆0 is. The conditional from left to right may be proved by, first, assuming (to the contrary) that y : σ is included in ∆ , though y ∈ / fv(M) . Again, by the subject construction lemma, no leaf of the derivation is an axiom of the form ∆00 ` y : χ . All leaves that are instances of the combinatory axioms remain instances of the same axioms with 0/ on the left-hand side of the ` . All instances of the id axiom with x : σ on the right-hand side of the ` can be changed to contain only the type assignment x : σ in ∆ . The two rules, E → and sub, do not have side conditions, therefore, the previous applications of these rules are applications of the same rules now. In sum, for any axiom ∆0 ` N : χ , ∆00 ` N : χ is an axiom, where x : σ ∈ ∆00 only if x ∈ fv(N) . Given that the premises of the rules have this property, the conclusion has the same property, either because the term is the same in the premise and in the conclusion, or because if x ∈ fv(N) , then x ∈ fv(NP) = fv(PN) . Thus, indeed, if M


256


is typable by τ , then there is a derivation with root ∆ ` M : τ , where ∆ assigns types only to the free variables of M . qed The rule of substitution is very handy when we are constructing a proof. We can start with some axioms, and in order to be able to apply detachment, we can substitute in the types. Substitution is sufficient for the application of that rule, because any pair of terms M and N can be put together into MN . In other words, the conditions for the applicability of the E → rule are the univalence of the union of the assumption sets and finding substitutions for the types of the premises so that they turn out to be of the form σ → τ and σ . The combination of detachment with just enough substitution allowed is the rule of condensed detachment that we already mentioned. On the other hand, it would be easier to think about derivations if the application of the substitution would be eliminated or at least restricted. L EMMA 9.1.20. If there is a derivation of ∆ ` M : τ possibly with applications of the substitution rule, then there is a derivation with the same root, in which the substitution rule is applied to axioms only. Proof: The proof is by induction on the structure of the derivation. By lemma 9.1.19, we should not be concerned about those elements of ∆ in which there is a variable x that is not free in M . The type assignments to these variables do not affect in an essential way the derivation of ∆ ` M : τ . At the same time, a variable may be assigned any type, hence any substitution on any disenfranchised variable turns a derivation into a derivation. The derivation is either an axiom, and then the claim is trivially true, or the last step in the derivation is an application of one of the two rules. If the last step is an application of the rule of substitution, then the derivation looks like .. . ∆ ` M: σ . [αi /χi ]∆ ` M : [αi /χi ]σ By inductive hypothesis, there is a derivation of ∆ ` M : σ such that all the substitution steps come right after instances of the axioms. Substitutions compose (by function composition) into a substitution, hence the substitution step in the last step of the derivation may be incorporated into the substitutions after the leaves of the tree.8 The other case is when the last step is an application of detachment and the derivation looks like .. .. . . ∆1 ` M : σ → τ ∆2 ` N : σ . ∆1 , ∆2 ` MN : τ We may assume that, if x ∈ / fv(MN) , then x does not occur in ∆1 ∪ ∆2 at all, or that it is in ∆1 only. If there is an occurrence of a variable both in ∆1 and ∆2 , then 8A

substitution is a total function from P into the set of types. The bracket-and-slashes notation displays only a restriction of the substitution function to a (finite) subset of P .


Chapter 9.

257


the two occurrences carry the same type assignment in virtue of the requirement of univalence, which is a condition for the applicability of the rule. By inductive hypothesis, there are derivations with the stipulated property ending in ∆1 ` M : σ → τ and ∆2 ` N : σ . The application of the rule E → puts together two trees in each of which the applications of substitution (if there are any) are on the leaves, by the hypothesis of the induction. This completes the proof. qed Example 9.1.21. Occasionally, a type may completely disappear by the time the final type assignment is reached. The following segment of a derivation illustrates this situation together with some of the potential complications from the proof of the previous lemma. .. . { x : γ, y : β } ` SK : (β → γ → β) → β → β { x : β, z : α } ` K : α → β → α { x : β, y : α } ` SK : (α → β → α) → α → α { x : β, y : α, z : α } ` SKK : α → α In the left branch of the tree, a substitution has been carried out; that is, { x : β, y : α } ` SK : (α → β → α) → α → α is the result of the substitution [γ/β, β/α]{ x : γ, y : β } ` SK : [γ/β, β/α](β → γ → β) → β → β . Clearly, fv(SKK) = 0/ , and so the assignments to x, y and z can be omitted. We can similarly reconstruct the missing part of the derivation — provided we aim at having a tree as flat as possible, that is, a tree of minimal height. ` S : (α → β → γ) → (α → β) → α → γ ` S : (β → (γ → β) → β) → (β → γ → β) → β → β ` SK : (β → γ → β) → β → β

` K: α → β → α ` K : β → (γ → β) → β

The substitutions may be composed to obtain a derivation of { x : β, y : α } ` SK : (α → β → α) → α → α . ∆ = { x : β, y : α } is not minimal, and we can pick types for x and y independently. Indeed, assigning to these disenfranchised variables basic types that do not occur anywhere else in the derivation clarifies the whole derivation. (Again, we abbreviate some of the types to keep the size of the derivation manageable: π stands for α → (β → α) → α , and τ is α → β → γ .) { x : δ, y : ε } ` S : τ → (α → β) → α → γ { x : β, y : α } ` S : π → (α → β → α) → α → α { y : α } ` K : π { x : β, y : α } ` SK : (α → β → α) → α → α Let us summarize the potential modifications we can make to CL → . We can trim the set of assumptions to contain only type assignments for those variables that are free (i.e., occur) in the term on the right-hand side of the ` . We can also replace the axioms for combinators by schemas and drop the substitution rule. Lastly, if desired we might want to add a rule of weakening (or monotonicity) for the assumption set.


258


The reformulated CL → looks like as follows. {x: τ} ` x: τ ` K: π → σ → π

`K

id

` S : (π → σ → χ) → (π → σ) → π → χ

∆1 ` M : σ → τ ∆2 ` N : σ ∆1 , ∆2 ` MN : τ

E→

∆1 ` M : τ ∆1 , ∆2 ` M : τ

`S

mon

As before, all the assumption sets are required to be univalent. L EMMA 9.1.22. There are combinators that can be assigned more that one type, and there are types that can be assigned to more that one combinator. There are combinators that cannot be assigned a type, and there are types that cannot be assigned to a combinator. Proof: The first claim is obvious, for example, K can be assigned the type α → β → α , α → α → α as well as (α → β) → β → α → β , etc. These types are distinct, though they are similar to one another to a certain extent. To prove the second claim, let us consider SKK and SKK(SKK) . The first can be assigned the type α → α , hence also the type (α → α) → α → α . Then α → α is a type both for SKK and SKK(SKK) . (Cf. example 9.1.14 that contains similar terms and types.) For the third statement, let us consider SII (where I is, of course, SKK ). If we identify π with σ → χ in the axiom of S , then the rest of the type after a detachment is ((σ → χ) → σ) → (σ → χ) → χ . This is a type for SI , and to get a type for SII , we would need to turn (σ → χ) → σ into π → π or into an instance of π → π . However, no implication can be unified with its antecedent (or its consequent), independently of how complex the subtypes (e.g., σ and χ ) are. Lastly, the type we already mentioned in connection to Y , (α → α) → α is not a theorem of intuitionistic logic. Therefore, by lemma 9.1.13, (α → α) → α cannot be assigned as a type to a combinator. qed The axiom schemas for combinators mean that all the types that can be assigned to S and K are substitution instances of those schemas. D EFINITION 9.1.23. A type τ is a principal type for a term M iff all the types that can be assigned to M are substitution instances of τ . A principal type of M is denoted by pt(M) . We assumed an infinite sequence of atomic types, thus the next claim is immediate. L EMMA 9.1.24. A term has either no or infinitely many principal types. Exercise 9.1.14. Write out the proof of the lemma. (Hint: Types are defined to have a

finite length.)


Chapter 9.


259

A variable can be assigned any type. Thus any variable has a principal type α . Type assignments to variables are far more permissive than the principal types for the combinators S and K in their axioms, which makes the principal types for variables somewhat uninteresting. Sometimes the notion of principal types is generalized to principal pairs, which is the principal type of a term containing free variables with respect to a set of type assignment assumptions about those variables. We focus here on closed terms only. A closed term in CL → can contain occurrences of S and K only; that is, it is a combinator. We may ask then if a combinator, which is not necessarily atomic, has or does not have a principal type. L EMMA 9.1.25. For every typable combinator Z , there is a type σ such that ` Z : σ is provable in CL → , and for any τ , if ` Z : τ is provable in CL → , then τ is a substitution instance of σ . That is, every typable combinator has a principal type. Proof: If a term is typable, then there is a derivation of ` Z : τ in CL → . By lemma 9.1.8, all the leaves of the derivation tree are instances of the combinatory axioms, because each leaf in the formation tree of Z is S or K . Now we will show that there is a derivation of ` Z : σ , where σ is the principal type for Z . (Of course, σ may be τ itself or a relabeling of τ .) The core idea is to use at each detachment step instances of types that are as general as possible. In other words, we apply condensed detachment with respect to the terms. The most general instances of the axioms are the axioms themselves. If ` Z1 : χ1 → χ2 and ` Z2 : χ3 at some step in the new derivation, then we create substitution instances of χ1 → χ2 and χ3 , let us say, ξ → χ02 and ξ to obtain ` Z1 Z2 : χ02 . Informally, our strategy is that we identify types or substitute a type of higher degree only if that is necessary for the instances of χ1 and χ3 to turn out the same. Formally, we require that for any pair of substitutions s1 and s2 such that s1 (χ1 ) = s2 (χ3 ) , there is an s3 with the property that s3 (ξ) = s1 (χ1 ) . That is, any other type that could be taken in place of ξ , can be obtained by substitution from ξ . The step of finding ξ is unification, because ξ is an instance of both χ1 and χ3 . The search for ξ can be described algorithmically, that is, it is computable. Furthermore, it is decidable whether a pair of terms can be unified. Sometimes ξ is called the most general unifier (mgu) — instead of the most general common instance — of χ1 and χ3 . We assumed (as a hypothesis of the lemma) that Z is typable, and we started with a derivation that results in a type assignment to Z , which guarantees typability. The typability of Z implies that Z1 and Z2 , as well as Z1 Z2 are typable; therefore, it follows that χ1 and χ3 have a common instance. Let us assume that ξ0 (distinct from ξ ) is also an mgci for χ1 and χ3 . Then s3 (ξ) = ξ0 and s4 (ξ0 ) = ξ . Then ξ and ξ0 are each other’s relabelings, because no implication has an atomic type as its instance and no substitution can distinguish two occurrences of a type variable. The fact that two mgci’s are necessarily each other’s reletterings justifies the use of the definite article in talking about mgci’s. Having found ξ , we can proceed in two ways to construct the derivation of the principal type schema for Z . If we suppose the earlier formulation of CL → , then


260


we can add substitution steps into the derivation. If we have type schemas in the combinatory axioms, then we can apply the substitutions s1 and s2 to the types in the subtrees ending in ` Z1 : χ1 → χ2 and in ` Z2 : χ3 , respectively. Either way we have a derivation of ` Z1 Z2 : χ02 . Since ξ is an mgci, χ02 is at least as general as the type of Z1 Z2 in the original derivation. qed By the previous lemma, we know that if Z can be assigned a type at all, then there are infinitely many types that can be assigned to Z . However, there is a type τ such that all those types are instances of τ , which justifies talking about the principal type schema of a combinator. Given a pair of formulas, the most general common instance is unique up to renaming atomic types, and the principal type schema of all the combinators — save S and K — are most general common instances of a pair of types. The close connection between these two notions explains that they are both unique (if exist) up to relettering. Example 9.1.26. Let us consider the term SS . We might have a derivation that shows that the term is typable. Let π1 and π2 abbreviate (α → α → β) → (α → α) → α → β and ((α → α → β) → α → α) → (α → α → β) → α → β , respectively. ` S : π1 → π2 ` S : π1 ` SS : ((α → α → β) → α → α) → (α → α → β) → α → β This derivation shows that the term SS is typable. However, π2 is not the principal type schema of this term. Now let us take (χ1 → χ2 → χ3 ) → (χ1 → χ2 ) → χ1 → χ3 and (σ1 → σ2 → σ3 ) → (σ1 → σ2 ) → σ1 → σ3 as instances of the type schema for S . In order to detach the second one from the first, χ1 should be σ1 → σ2 → σ3 , χ2 should be σ1 → σ2 and χ3 should be σ1 → σ3 . These conditions can be thought of as equations expressing constraints. The three conditions (taken together) do not force us to identify, for instance, σ1 and σ2 . Thus the principal type schema that we get for SS is ((σ1 → σ2 → σ3 ) → σ1 → σ2 ) → (σ1 → σ2 → σ3 ) → σ1 → σ3 , where the σ ’s may be pairwise distinct. An instance of the pt(SS) is the type ((σ1 → σ2 → σ4 → σ4 ) → σ1 → σ2 ) → (σ1 → σ2 → σ4 → σ4 ) → σ1 → σ4 → σ4 . This type schema contains three variables, just like the previous one, however, the substitution of σ4 → σ4 for σ3 is not warranted by the unification of the two types of S (with χ ’s and with σ ’s). L EMMA 9.1.27. Given a combinator over the basis { S, K } , it is decidable if the term is typable. Proof: From lemma 9.1.8, we know that if the term is typable (hence, there is a derivation of a type assignment for that term), then the formation tree of the term is isomorphic to the derivation tree of the type assignment (in the substitution-free version of CL → ). Performing unification at each step (if possible), as in the proof of


Chapter 9.


261

the previous lemma, yields the principal type schema of the combinator, therefore, demonstrates typability. On the other hand, if unification fails at a step, then that demonstrates the untypability of the combinator. qed The next claim is a straightforward consequence of the two preceding lemmas; nonetheless, it is useful to state it explicitly. C OROLLARY 9.1.27.1. Given a term M and a type τ , it is decidable if τ = pt(M) . Finding types for terms, perhaps types with special properties, is one of the concerns we have. Often, especially when we think of the types as formulas, we are interested in looking at the type assignment relationship from the other direction, so to speak, that is, whether the type can be assigned to a combinator. D EFINITION 9.1.28. If there is a combinator M , such that ` M : τ , then M inhabits the type τ . The { S, K } basis is very well behaved, because it is not only combinatorially complete and typability is decidable, but inhabitation is decidable too. T HEOREM 9.1.29. Given a type τ , it is decidable whether τ is inhabited by a combinator over the base { S, K } . Proof: We have seen in lemma 9.1.13 that all the types that can be assigned to a combinator in CL → are theorems of H→ . The term-free part of CL → is in fact the natural deduction calculus for H→ (without the I → rule), which is, in turn, equivalent to the implicational fragments of Gentzen’s LJ and Curry’s LAm (O) .9 Both calculi are decidable, hence so is H→ . The decision procedures essentially depend on the existence of an upper bound for the search space for proofs that follows from the sufficiency of reduced sequents. qed A combinator Z that inhabits a type τ can be viewed as a blueprint for a proof of the type (as a formula) in H→ . The implicational fragment of intuitionistic logic can be presented as an axiom system by taking the two type schemas that appear in the axioms for S and K together with the rule of detachment. The definition of a proof in an axiomatic calculus is rather flexible, and we use that flexibility to restrict the class of proofs. D EFINITION 9.1.30. The implicational fragment of intuitionistic logic, H→ , comprises (A1)–(A2) and (R1). (A1) A → B → A (A2) (A → B → C) → (A → B) → A → C (R1) A → B, A ⇒ B 9 See

Gentzen [, pp. 204–205] and Curry [, p. 235].


262


A finite (nonempty) sequence of wff’s is a proof iff each wff is either an instance of (A1) or (A2), or is obtained from preceding wff’s in the sequence by (R1). Note that inserting finitely many instances of axioms into a proof creates another proof. Also, typically, some wff’s in a proof may be permuted, because (R1) does not stipulate — perhaps, despite appearances — that A → B must come before A . In what follows, proofs are considered as sequences of wff’s arranged vertically with one wff on each line. This is a usual way to write out proofs, and it will make easier for us to describe proofs without introducing ambiguity or imprecision. D EFINITION 9.1.31. We define recursively a proof of τ in H→ , given a derivation of ` Z : τ in CL → (with axiom schemas for S and K ).10 (1) If the node is a leaf in the derivation tree, then we insert the type (as a formula) onto the next line of the proof (which is justified as an instance of an axiom schema). (2) If the node is not a leaf, then the node is the result of an application of the E → rule, and we insert the lines obtained from the subtree rooted in the left premise, followed by the lines obtained from the subtree rooted in the right premise, followed by the type in the conclusion. (3) No other formulas are included into the proof. Notice that the sequence of wff’s resulting from this definition is a proof in H→ , because wff’s by (1) are instances of axioms, and wff’s by (2) are preceded by their premises in detachment. (3) guarantees that no loose wff’s are inserted into the sequence. The latter condition is stronger than what is absolutely necessary to ensure that the sequence is a proof, as we will see below. Example 9.1.32. Let us consider the derivation of a type for S(KS)K . We start with the tree ` S : π1

` K : [α/ pt(S), β/β → γ] pt(K) ` S : pt(S) ` KS : (β → γ) → pt(S) ` S(KS) : π2 ` K : (β → γ) → α → β → γ , ` S(KS)K : (β → γ) → (α → β) → α → γ

where π1 is shorthand notation for ((β → γ) → pt(S)) → ((β → γ) → α → β → γ) → (β → γ) → (α → β) → α → γ, and π2 abbreviates the type ((β → γ) → α → β → γ) → (β → γ) → (α → β) → α → γ, 10 We

use the second formulation of CL → , where we have type schemas in ` K and ` S , and there is no rule of substitution.


Chapter 9.


263

and further, pt(S) stands for the principal type schema of S with α, β and γ , similarly, pt(K) is the principal type schema of K with α and β , and the substitution notation indicates modifications to these particular instances of the pt ’s, for the sake of concreteness. Let us denote by pr(τ) the proof of τ in H→ obtained from the above definition. Starting at the root, we get by (1) and (2): 1–5. pr(π2 ) 6. pr((β → γ) → α → β → γ) 7. (β → γ) → (α → β) → α → γ (The line numbers are not known at this point; however, for the sake of transparency, we already use here the line numbers that we will have in the final proof. The line numbers mainly reinforce that the vertical series of wff’s is a finite sequence.) pr((β → γ) → α → β → γ) is the formula itself by (1), because the corresponding node is a leaf, but pr(π2 ) has to be expanded further. We obtain 1. pr(π1 ) 2–4. pr((β → γ) → pt(S)) 5. π2 6. (β → γ) → α → β → γ 7. (β → γ) → (α → β) → α → γ After a couple of other steps, we get the following completed proof in H→ , which we annotate both with combinatory terms and the usual justifications often appended to proofs in axiom systems. 1. π1

[ S ; (A2)]

2. pt(S) → (β → γ) → pt(S) 3. pt(S)

[ S ; (A2)]

4. (β → γ) → pt(S) 5. π2

[ K ; (A1)]

[ SK ; (R1) 2, 3]

[ S(KS) ; (R1) 1, 4]

6. (β → γ) → α → β → γ

[ K ; (A1)]

7. (β → γ) → (α → β) → α → γ

[ S(KS)K ; (R1) 5, 6]

The above proof is of a rather special shape. A major premise for an application of detachment precedes the minor premise, and if the minor premise itself is obtained via detachment, then the major premise precedes all the lines that constitute the minor premise. There are no shortcuts in the proof in the sense of using a formula as a premise for two applications of detachment. Also, there are no spurious formulas in this proof either: if a formula is not used in obtaining the bottom most wff, then it is not inserted into the proof despite the formula being an instance of an axiom.


264


D EFINITION 9.1.33. A proof in H→ is special iff the proof can be annotated to satisfy (1)–(3). (1) Each wff preceding the last wff is used in obtaining the last wff. (2) Each wff preceding the last wff is used in no more that one application of (R1). (3) If the wff on line n is by (R1), then there is an i ( i < n ) such that the wff’s on lines 1 – (i − 1) and on lines i – (n − 1) form special proofs of the major and minor premises, respectively. L EMMA 9.1.34. Every theorem of H→ has a special proof. Proof: Every theorem has a proof, by the definition of what a theorem is. A proof is a finite object, and we may assume that an annotation with line numbers is assigned to the formulas. Working from the bottom to the top, the annotation permits us to find wff’s in the proof that are not used; deleting those formulas does not destroy the proof. If there is a wff in the proof that is cited more than once as a premise of (R1), then we copy that wff (together with its proof) sufficiently many times to achieve single citations, and then we readjust the annotation. After this step, we can clearly perform sufficiently many permutations (if needed at all), to ensure that each major premise precedes the whole derivation of a minor premise. The flexibility of the usual definition of a proof in an axiomatic system ensures that switching the minor and major premises preserves the property of being a proof. qed L EMMA 9.1.35. (C URRY–H OWARD ISOMORPHISM ) There is a 1–1 correspondence between special proofs of theorems in H→ and proofs of type assignments in CL → . Proof: Definition 9.1.31 associates a (unique) proof in H→ to each proof in CL → . It is easy to see that by definition 9.1.33 these proofs are special. On the other hand, given a special proof, the construction of the CL → proof is straightforward: axioms are axioms, and applications of (R1) are applications of E → , lastly, the tree structure of the CL → derivation is built-in into condition (3) in the definition of special proofs. It is also true that for any H→ proof, there is a proof of the same formula as a type for a combinator in CL → ; however, from lemma 9.1.34, it is obvious that several proofs in H→ may lead — via conversion into special proofs — to one and the same CL → proof. qed The Curry–Howard isomorphism can be extended to other logics and other combinatory bases. Nonclassical logics have been introduced independently from combinatory logic and λ -calculi. An intriguing coincidence though is that the implicational fragment of the logic of relevant implication R→ was introduced by Church in [], who gave a certain preference to the λI -calculus over the λK -calculus (both of which were invented by him).


Chapter 9.

265


We mention four implicational logics: R→ , E→ , T→ and BCI→ . R is the logic of relevant implication, E is the logic of entailment, T is the logic of ticket entailment and BCI→ is the implicational fragment of linear logic.11 D EFINITION 9.1.36. The rule of detachment (R1), together with a selection of axiom schemas from the following list, defines the implicational logics mentioned. (I) A → A (B) (A → B) → (C → A) → C → B (C) (A → B → C) → B → A → C (B 0 ) (A → B) → (B → C) → A → C (2) (A → (B → D) → C) → (B → D) → A → C (W) (A → A → B) → A → B (R1) A → B, A ⇒ B BCI→

T→

E→

R→

(B), (C), (I)

(B), (B 0 ), (I), (W)

(B), (2), (I), (W)

(B), (C), (I), (W)

Except (2), all the other wff’s are principal type schemas of proper combinators. There is no axiomatization for E→ using principal types of proper combinators only. E→ is located between T→ and R→ . BCI→ does not include contraction, and it is included only in R→ . On the other hand, E→ and T→ are not included in BCI→ , because (C) is not a theorem of either of those logics. For a stronger version of the Curry–Howard isomorphism, we now define rule D. D EFINITION 9.1.37. The rule of condensed detachment, denoted by D, allows the conclusion of s1 (B) from A → B and C , when (i)–(iii) hold. (i) there are substitutions s1 and s2 such that s1 (A) = s2 (C) , (ii) the number of propositional variables in s1 (B) is minimal (among all the substitutions s1 satisfying (i)), (iii) the number of distinct propositional variables in s1 (B) is maximal (among all the substitutions s1 satisfying (ii)). 11 For

detailed treatments of these logics and for further information about them, see [], [], [], [],

[] and []. (See also section A.9.)


266


Condition (i) stipulates that the wff’s A and C have to be unified. The two other conditions make precise the idea that the unification is carried out so as to produce an mgci of A and C , hence to yield a B as general as possible. That is, substitutions introduce more complex formulas and identify variables only if that is necessary in order to find a common instance of A and C . It is immediate that a logic that is defined by axiom schemas and detachment (or by axioms, modus ponens and substitution) admits rule D. However, it is not obvious (and for some logics it is false) that axioms together with rule D suffice. D EFINITION 9.1.38. A condensed logic is a formalization of a logic that contains axioms and the rule D. Of course, the idea is that the axioms are closely related to the axiom schemas that formalize a logic. For example, if the propositional variables are p, q, r, . . . , then axiom (I) looks like p → p , or if we use basic types, then (I) is α → α . For the sake of definiteness, we can stipulate that the meta-variables A, B,C, . . . are replaced by p, q, r, . . . in the axiom schemas for a logic, and detachment is replaced by condensed detachment yielding a condensed version of a logic. We will denote the condensed version of a logic by prefixing D to its label. Then, we can ask whether the two calculi have the same set of theorems. T HEOREM 9.1.39. The logics DT→ , DE→ and DR→ each has the same set of theorems, respectively, as T→ , E→ and R→ does, that is, each of these logics is Dcomplete. Proof: The proof for T→ is due to Meyer (see []), and an adaptation may be found in [] too. The core ideas behind the proof are as follows. (1) Self-implication is a theorem of the condensed logic. (2) Generalized instances of prefixing and suffixing are also theorems. (3) If a wff is a theorem, then the identification of any two propositional variables occurring once is a theorem too. (4) The result of a substitution in a theorem is a theorem. The truth of the claim for E→ and R→ follows from the D-completeness of T→ together with p → p being a theorem. qed L EMMA 9.1.40. DBCI→ is D-incomplete. Proof: The wff (p → q → r) → (p → s → t) → p → p → (r → s) → q → t is a theorem of BCI→ logic, however, it is not a theorem of D BCI→ . The proof of the formula is not difficult in a natural deduction calculus for BCI→ . To prove that D BCI→ cannot have this wff as a theorem, it is useful to prove that all theorems of the condensed version of BCI→ have exactly two occurrences of each propositional variable. (Informally, the absence of contraction or of self-distribution of implication means that variables cannot be identified via an application of rule D.) qed


Chapter 9.


267

Exercise 9.1.15. Consider a natural deduction system for BCI→ with E → and I →

in which premises may be permuted and all premises must be used exactly once. Prove that the wff displayed above is provable. Exercise∗ 9.1.16. Prove that if A is a theorem of D BCI→ , and p occurs in A , then p occurs exactly twice in A .

Rule D was invented to streamline proofs in propositional logic by delimiting potential proof steps. Thus we should not be surprised that a logic (thought of as a set of theorems) may have more than one condensed version, depending on the set of axiom schemas from which the axioms are lifted. A condensed version of a logic may not be equivalent to the original logic (like in the case of BCI→ ). Moreover, two condensed versions of one and the same logic may not be equivalent either. L EMMA 9.1.41. The condensed logic comprising axioms (1)–(4) and rule D is equivalent to the BCI→ logic. (1) p → p (2) (p → q) → (r → p) → r → q (3) (p → q → r) → q → p → r (4) (p → p → q) → p → p → q Proof: The proof follows the proof of the D-completeness of D T→ with the modification that one has to first derive in the condensed logic the wff’s that are used in that proof. Clearly, axiom (4), which is an instance of pt(I) with the antecedent of the pt(W) , is the crucial addition that make the proof possible.12 qed T HEOREM 9.1.42. (S TRENGTHENED C URRY–H OWARD ISOMORPHISM ) Every theorem of H→ is the principal type of a combinator over the basis { S, K } . Proof: The truth of the claim follows from the D-completeness of T→ , once we note that H→ contains (under that identity translation) all the theorems of T→ , including p → p . qed The theorem means that there is a tight connection between the typable combinators built from S and K , and the theorems of H→ . The combinators encode proofs in a precise sense.

12 For

details of the proof, see [].


268

9.2


Intersection types for combinators

Simple types reflect the idea that a function has a domain and a codomain. However, simple types are not the only types that have been considered in typing CLterms. A function taking functions as its argument can be “uncurried,” which makes it seem plausible to introduce a type constructor × for Cartesian product. Then projections on pairs might be naturally considered and so forth. In typed functional programming languages, a wide range of type constructors have been introduced, typically closely matching the programming constructs. In view of these sources and developments in typing, typing with simple types only may seem impoverished; however, typing with → has its own advantages. Simple typed terms strongly normalize. This means that a term that is typable has a nf, moreover, every reduction sequence is finite, but strong normalization may seem too strong. If a term normalizes (at all), then it is possible to define a strategy that will guarantee that the nf of the term is actually reached. In other words, weak normalization can be thought of as sufficiently safe or reliable from a certain point of view of computation. The set of terms in which all reduction sequences are finite is an important set. However, the set of terms, which have an nf, is also interesting, and it is desirable to have a characterization of this set too. Last but not least, the Curry–Howard isomorphism entices us to think about type constructors beyond → . Logics often, perhaps even typically, include multiple connectives, even if the implication connective and the implicational fragment of a logic take a central place in the study of that logic. Classical sentential logic — the simplest logic — cannot be fully captured or described by implication alone or by its implicational fragment. Of course, we know from the Curry–Howard isomorphism that classical logic is not sufficiently sophisticated to provide the simple types; however, the previous remark about classical logic is a fortiori true concerning intuitionistic logic. Intersection types have been introduced and investigated for both λ -calculi and CL. Because of their theoretical significance and their connection to nonclassical logics, we focus on this ramification of typing here. D EFINITION 9.2.1. Let P be a nonempty set of type variables. Let ω be a type constant, and let → and ∧ be two binary type constructors. The set of intersection types (i-types, for short) is inductively defined by (1)–(3). (1) If α ∈ P , then α is an i-type; (2) ω is an i-type; (3) if π and σ are i-types, then so are (π → σ) and (π ∧ σ) . Our notational convention for omitting parentheses will be the one for simple types — with the addition that ∧ binds stronger than → . The informal interpretation of α ∧ β as a type for a term M is that M is of both types α and β . This way of


Chapter 9.

269


thinking about ∧ is in parallel with the meaning of x ∈ A ∩ B as x ∈ A and x ∈ B . That is, M : α ∧ β is like saying that x ∈ A ∩ B .13 Example 9.2.2. Recall that M does not have a simple type, even though Mx has an nf, xx (which is, of course, not typable with simple types either). However, if x could be assigned the types α → β and α at the same time, then xx could be assigned the type β , and we would have M : (α → β) ∧ α → β . Of course, allowing a term to have an arbitrary type in addition to its simple type would result in a too broad (and most likely useless) system. Therefore, type assignments in an intersection type assignment system will be governed by axioms and rules — like those in the simply typed calculi — together with separate rules for type inference. The latter kind of rules will be connected with the rest of the type assignment system via a rule that allows changing the type assigned to a term without a separate derivation of that type assignment. The type inference axioms and rules amount to the logic that is known as the implication–conjunction fragment of the relevance logic B with the constant T (for truth), that is, the relevance logic BT∧ . (See, for example, Meyer [].) D EFINITION 9.2.3. The natural deduction-style calculus for the intersection type assignment system for combinatory logic, denoted by CL ∧ , contains the type inference axioms and rules: τ≤τ

τ≤ω

τ ≤ τ∧τ

ω≤ω→ω

τ∧σ ≤ τ

τ∧σ ≤ σ

(τ → σ) ∧ (τ → χ) ≤ τ → σ ∧ χ τ1 ≤ τ2 σ1 ≤ σ2 τ1 ∧ σ1 ≤ τ2 ∧ σ2

τ≤σ σ≤χ τ≤χ

τ1 ≤ τ2 σ1 ≤ σ2 . τ2 → σ1 ≤ τ1 → σ2

The type assignment axioms and rules are the following ones. (All the assumption sets are required to be univalent.) ` S : (τ1 → τ2 → τ3 ) → (τ4 → τ2 ) → τ1 ∧ τ4 → τ3 ` I: τ → τ

x: τ ` x: τ

Ì

` M: ω

id

∆1 ` M : σ → τ ∆2 ` N : σ ∆1 , ∆2 ` MN : τ ∆ ` M: τ ∆ ` M: σ ∆ ` M: τ∧σ 13 We

I∧

∆ ` M: τ∧σ ∆ ` M: τ

` K : τ1 → τ2 → τ1

`S

E∧

`K

`ω

E→

∆ ` M: τ∧σ ∆ ` M: σ

E∧

use ∧ to emphasize the connection to certain nonclassical logics; however, ∩ is also used in the literature, for instance, in [].


270


The following two rules ensure monotonicity and connect type inferences to type assignments, respectively. ∆1 ` M : τ ∆1 , ∆2 ` M : τ

mon

∆ ` M: τ τ≤χ ∆ ` M: χ

up

In the case of simple types, we required that the assumption sets were univalent. The idea of intersection types is to allow terms to have more than one type simultaneously as we hinted at in example 9.2.2. That is, not only combinators, but also other terms too can have multiple types within one derivation. Thus it might seem that the requirement of the univalence of the set of assumptions should be, perhaps, removed. However, if multiple type assignments to variables would be allowed, then we would lose control over the relationship of those types to each other. Therefore, the requirement of univalence stays in place. The notion of a derivation is as before. The axioms and rules for type inference may be divided into two parts. The axioms and rules that do not contain → define a meet semilattice with a top element. The rest of the axioms and rules characterize the interaction between the type constructor → and the semilattice. ω ≤ ω → ω expresses that → applied to ω behaves classically. The rule introducing → ’s expresses that implication is monotone (covariant) in its second and antitone (contravariant) in its first argument place. By the other axiom for → , → distributes over ∧ in its second argument place. (The other inequality, i.e., τ → σ ∧ χ ≤ (τ → σ) ∧ (τ → χ) follows from → ’s tonicity and ∧ ’s being inf (greatest lower bound).) Example 9.2.4. Recall that M is definable as SII . The next derivation shows that given this definition, M : (α → β) ∧ α → β is provable. (We abbreviate β → γ by π to shorten some types.) ` S : (π → π) → (β → β) → π ∧ β → γ ` I: π → π ` SI : (β → β) → π ∧ β → γ ` SII : (β → γ) ∧ β → γ

` I: β → β

Given that now we can type a combinator that was not typable by simple types, we should be curious how we get (if we get) the type assignment ` xx : γ when Mx : γ . Of course, the application of M should work with any term, and so we will consider a slightly more complicated term that x . Example 9.2.5. In the (Church- or Curry-style) simple type theory no self-application of a variable (or of a term comprising variables only) is typable. Here is a derivation showing that xy(xy) is typable by i-types. (We abbreviate σ → (τ1 → τ2 ) ∧ τ1 by χ in some of the type assignments to save space.) {x: χ} ` x: χ {y: σ} ` y: σ {x: χ} ` x: χ {y: σ} ` y: σ { x : χ, y : σ } ` xy : (τ1 → τ2 ) ∧ τ1 { x : χ, y : σ } ` xy : (τ1 → τ2 ) ∧ τ1 { x : χ, y : σ } ` xy : τ1 → τ2 { x : χ, y : σ } ` xy : τ1 { x : σ → (τ1 → τ2 ) ∧ τ1 , y : σ } ` xy(xy) : τ2


Chapter 9.


271

The example shows that the effect of having two types for a term (that has no occurrences of combinators) is achieved by starting with a term that contains a conjunction in its type, which is then eliminated. Exercise 9.2.1. Find suitable assumption sets to type xx and xxx , then write out the derivations that show that these terms are typable by i-types. Exercise∗ 9.2.2. Recall that I is definable as SKK . We included an axiom into CL ∧ for I . Can the type given in the ` I axiom be derived from the types for S and K in CL ∧ ?

The following claim is almost trivial still it is worth to make it explicit. (We do not change the notion of typability from definition 9.1.6 except that CL → is replaced by CL ∧ .) L EMMA 9.2.6. If M is a CL-term, then M is typable in CL ∧ . Proof: An arbitrary term can be typed by ω .

qed

L EMMA 9.2.7. For every term M and for every type τ , if ∆ ` M : τ in CL → , where ∆ assigns a type to x iff x ∈ fv(M) , then ∆ ` M : τ in CL ∧ . Proof: The type of K is the same in CL → and CL ∧ . The type of I is the type that can be derived in CL → for SKK , which defines I . The detachment rule is the same in both calculi. Thus we have to show only that pt(S) in CL → is derivable in CL ∧ . τ ∧ τ = τ , since τ ≤ τ ∧ τ and τ ∧ σ ≤ τ (with arbitrary σ including τ ).14 Then τ1 ∧ τ1 → τ3 = τ1 → τ3 , by one of the type inference rules. After applying the same rule two more times, we get two further equations. The inequality that we need is (τ1 → τ2 → τ3 ) → (τ1 → τ2 ) → τ1 ∧ τ1 → τ3 ≤ (τ1 → τ2 → τ3 ) → (τ1 → τ2 ) → τ1 → τ3 , and it is half of the second equations. (Let us abbreviate by π1 and π2 the types on the left- and on the right-hand sides of the ≤ .) We have that ` S : π1 π1 ≤ π2 . ` S : π2 Clearly, any derivation of a type assignment in CL → can be reproduced in CL ∧ by replacing a leaf that is an instance of the S axiom by a suitable instance of the tree described above. qed The notion of principal types does not carry over from the simply typed system to i-types. For example, it is easy to see — given the above lemma — that the simple type of S is not a substitution instance of its intersection type, and S’s i-type is not a substitution instance of its simple type. However, it is possible to define principal types for the i-type system together with operations on types that ensure that the principal types play a similar role as in the case of simple types.15 14 The

equality sign is not in our official language; however, we use it only to express two inequalities at once. This usage is unproblematic. 15 See [] for a detailed exposition of the new notion of principal types for the i-typed λ -calculus.


272


The i-types allow us to delimit the set of normalizable terms. We use the notion of a λ -translation of a CL-term, which is defined in chapter 4. L EMMA 9.2.8. If ∆ ` M : τ is provable in CL ∧ and there is no occurrence of ω in τ or in the types assigned to variables in ∆ , then M has a weak nf. If Mλ is in β nf, then there is a proof of ∆ ` M : τ in CL ∧ such that ω does not occur in τ or in the types assigned to variables in ∆ . We will not prove this lemma here. A proof may be constructed from the similar result for the i-typed λ -calculus (where in both cases β nf’s and the i-typed λ calculus appear in the statement of the claim) together with properties of the λ translation of CL-terms. We recall from chapter 4 that if Mλ is in β nf, then M is in wnf, but not necessarily the other way around. Exercise∗∗ 9.2.3. Prove the previous lemma. (Hint: You might find it useful to consult [], [], [] and [] for proofs of similar results.)

We mentioned in the previous section that all terms typable in CL → strongly normalize. In CL ∧ — with a small restriction on derivations — we get a characterization of the set of strongly normalizable terms. It is trivially decidable if a derivation contains any types that have an occurrence of ω , because a derivation is finite and it can be directly inspected. Therefore, we could consider a slightly restricted version of CL ∧ in which ω is not an i-type, hence the two type inference axioms concerning ω and the ` ω axiom in the type assignment system are omitted. (Of course, none of the other axioms or rules are allowed to be instantiated with a type containing ω either, since that is not an i-type now.) Let us denote this modification of CL ∧ by CL −ω ∧ . L EMMA 9.2.9. If ∆ ` M : τ is a provable in CL −ω ∧ , then M has no infinite reduction sequences. If Mλ strongly normalizes, then there is a derivation of ∆ ` M : τ in CL −ω ∧ with some ∆ and τ . Proof: We sketch the proof here.16 As we saw in chapter 6, type-free combinatory logic has various kinds of models — including term models. A motivation for the type assignment systems is that a combinator may have many types, as for example, I can be typed by α → α as well as by (α → β) → α → β . This idea can be realized in a model where combinators are sets of wff’s. In a “dual manner,” it is also possible to interpret types as sets of terms. In order to interpret a type assignment M : τ , both M and τ have to be interpreted together with a relation between those two objects. It is natural to interpret a term as a term, and then take : to be ∈ . With the interpretation of τ defined suitably, we can have that ` M : τ implies [M] ∈ I(τ) (where [ ] and I are the components of the interpretation for terms and for types, respectively). 16 For

detailed expositions of the proof, see [, §4.3] or [, 11J].


Chapter 9.


273

A basic type α is interpreted by I as the set of strongly normalizable terms, and I is extended to σ → π recursively by I(σ → π) = { M : ∀N. N ∈ I(σ) ⇒ MN ∈ I(τ) }. Next, we can prove that this interpretation assigns to a simple type a subset of strongly normalizable terms. (This step may be carried out via the notion of saturated sets of terms or strongly computable terms.) It remains to show that the function I can be complemented by a valuation function v on variables, which ensures that the natural deduction calculus CL → is sound. For example, v(x) = x is a suitable valuation. Informally, the valuation function can be thought of as a substitution function, because a term is interpreted as itself modulo the application of v , which is the substitution of v(x) for x in all occurrences of x . The proof of soundness shows, by induction on the structure of derivations, that if for each x : τ in the assumption set ∆ , v(x) ∈ I(τ) , then if ∆ ` M : χ is provable in −→ ∈ I(χ) . The set of terms I(χ) is a subset of the set of strongly CL → , then [~x/− v(x)]M normalizable terms, therefore, M strongly normalizes too. qed Exercise∗∗ 9.2.4. The two references ([] and []) in the proof deal with simply typed λ -calculus and simply typed CL, whereas the lemma above concerns CL ∧ . Adapt those proofs to CL ∧ , and write out in detail the proof of the lemma.

The i-type assignment system leads to further models of CL. Terms can be interpreted as sets of types, and in the presence of conjunction ∧ , a desirable property of those sets means closure under conjunction. Together with upward closure (with respect to the ≤ relation on types), the sets of types that are suitable for the interpretation of terms are filters on the set of types. (See section 6.5 for the details of this model.) In the terminology of section 6.2, this kind of interpretation gives an operational semantics both for typed and type-free CL. The set of type constructors may be further extended. In the design and study of programming languages, type systems for functional languages often contain a whole range of type constructors — some of which we have mentioned above. Given intersection types, it is straightforward to look for union types. The connection between CL ∧ and BT∧ also suggests that the effect of adding disjunction as a binary type constructor may be useful. Disjunction is denoted by ∨ , and we assume that the set of types is inductively defined from a set of type variables and ω with an extra clause for ∨ . That is, definition 9.2.1 may be extended by (4) — with the obvious modification that the set that is defined now is called “union types” (or u-types). (4) If π and σ are u-types, then so is (π ∨ σ) . This extension adds new rules to the intersection type assignment system CL ∧ (which is in definition 9.2.3).


274


D EFINITION 9.2.10. The type assignment system CL + is defined by the axioms and rules of CL ∧ together with the following type assignment rules. ∆ ` M: A ∆ ` M: A∨B

I∨

∆ ` M: B ∆ ` M: A∨B

I∨

∆ ` M: A∨B A ≤C ∆ ` M: C

B ≤C

E∨

The set of axioms for type inference is expanded by the following four axioms. τ ≤ τ∨σ

τ ≤ σ∨τ

(τ → σ) ∧ (χ → σ) ≤ τ ∨ χ → σ

τ ∧ (σ ∨ χ) ≤ (τ ∧ σ) ∨ (τ ∧ χ) An informal interpretation of union types is that a term that is assigned type A ∨ B is assigned the type A or the type B . The set of typable terms, obviously, cannot change by the extension of the type assignment system: CL ∧ is completely included in CL + , thus the set of typable terms cannot shrink. CL ∧ already allowed all CL-terms to be typed, thus the set of typable terms cannot grow. The addition of ∨ has at least two advantages. First, the connection between the minimal relevance logic B and CL (or the λ -calculus) is reinforced by this addition. Second, more elaborate models of CL and typed CL can be defined based on u-types.17 The latter enhances our understanding of CL.

17 Such

a model is described at the end of section 6.5.


Appendix

Combinatory logic originated from philosophical concerns about classical first-order logic. Logicians and mathematicians developed CL with the idea of creating a framework for the whole of mathematics. Later on, with the appearance of computers and then of computer science, CL came to be seen primarily as a formalization of the notion of computable functions. With its many ties and aspects, CL assumes familiarity with a wide variety of abstract notions and ideas. The aim of this appendix is to provide a brief summary of some of the concepts that are introduced informally or used without a definition in the preceding chapters. Some of these concepts are quite elementary, and repeating them here mainly serves the purpose of fixing notation. Some of the concepts are less well-known, and their inclusion here is intended to help to make the book more self-contained. There are also claims, lemmas and theorems here; however, we typically do not give a proof for them.1 The proofs are often easy, or may be found in multiple sources. The appendix is organized into sections paralleling the structure of the book. Considered separately, the appendix might look like jumping around between various subject areas. We do not intend to and cannot provide a systematic development of all the topics touched upon here, if for no other reason, because these topics are subsidiary to the main subject of the book. The present arrangement is hopefully practical and helpful in using the book together with the list of symbols and the index.

A.1

Elements of combinatory logic

Classes of objects are often defined using induction. The natural numbers may be defined inductively as the least set generated from the singleton set { 0 } by the “ +1 ” (i.e., the successor) function. An “official” definition of N (the set of natural numbers) may look like: (1) { 0 } ⊆ N ; (2) if x ∈ N then x + 1 ∈ N ;

1 Some

exceptions are claims A.1.1 and A.1.2 that are included as examples of proofs by induction.


276


(3) N is the least set generated by clauses (1) and (2).2 To prove that all the elements of an inductively defined set possess some property, we use a proof technique that is also called induction. To prove that the sum of the natural numbers up to n is n(n+1)/2 , we can use weak mathematical induction. We give a detailed proof of this claim to illustrate the structure of proofs by mathematical induction. C LAIM A.1.1. The sum of the natural numbers from 0 to n is n

∑i=

i=0

n(n+1) 2

, that is,

n(n + 1) . 2

Proof: The proof is by induction on n . Base case. If n = 0 , then ∑0i=0 i = 0 . Also, 0(0 + 1)/2 = 0 . 0 = 0 , that is the claim holds when n = 0 . Inductive case. The inductive hypothesis (IH) is that the claim is true for n . We will show that — given the hypothesis — the claim is true for n + 1 . n(n+1) n+1 n + (n + 1) , which further ∑n+1 i=0 i = (∑i=0 i) + (n + 1) . By (IH), ∑i=0 i = 2 equals to

n2 +n+2n+2 2

. On the other hand, if we substitute n + 1 into the fraction on

, and then the right in the claim, then we get (n+1)(n+2) 2 (n+1)(n+2) , which shows that the claim holds for n + 1 . 2

n2 +3n+2 2

. Thus ∑n+1 i=0 i =

qed

The set of natural numbers exhibits a very special structure. Other sets of objects may be defined by induction too, but starting with more that one object, and generating objects in several ways. Here we take as an example the inductive definition of well-formed formulas (wff’s, for short). Informally, P = { p0 , p1 , p2 , . . . } is the set of propositional variables, and the connectives are ∼ , ∧ , ∨ and → . (1) P ⊆ wff ; (2) if A ∈ wff , then ∼A ∈ wff ; (3) if A, B ∈ wff , then (A ∧ B), (A ∨ B), (A → B) ∈ wff . Note that we suppressed the “least set” clause. The definition may be rendered in English by saying that a propositional variable is a formula, and the negation of a formula, as well as the conjunction, the disjunction and the implication of a pair of formulas is a formula. Furthermore, nothing else is a formula. Obviously, card(wff) = ℵ0 when card(P) = ℵ0 , that is, there are denumerably many well-formed formulas — just like natural numbers. However, there is no “ +1 ”-like operation that generates all the wff’s from some wff; rather there are several operations ( ∼ , ∧ , ∨ and → ) and some of them take two arguments. The 2 The

closure clause (3) is often omitted when the definition has been specified to be inductive.


277

Appendix A.1

proof method that accompanies an inductive definition like that of wff’s is called structural induction. To illustrate this way of proving that a property holds of all the objects in the inductively defined set, we prove a (very simple) claim in detail. C LAIM A.1.2. Every well-formed formula contains an equal number of ( ’s and ) ’s. Proof: The proof is by induction on the structure of formulas. Base case. The base set in the definition is P by clause (1). If the formula is a propositional variable, that is, pi for some i , then it has 0 ( ’s and 0 ) ’s. Therefore, the claim is obviously true. Inductive case. We consider separately those formulas in which the main connective is negation, and those formulas in which the main connective is binary. 1. The hypothesis of the induction is that the number of ( ’s and ) ’s equals in A . The symbol ∼ is not a parenthesis, and ∼A , which is generated according to (2), contains exactly the ( ’s and ) ’s that A does. Therefore, by the (IH), the claim holds for ∼A . 2. The hypothesis of the induction is that A has as many ( ’s as ) ’s, and B has as many ( ’s as ) ’s. Let us say these numbers are, respectively, m and n . (A ∧ B) contains the ( at the beginning of the wff, and the ( ’s from A and from B , that amounts to 1 + m + n . The number of ) ’s is m + n + 1 — counting from left to right again. 1 + m + n = m + n + 1 , hence the claim is true for (A ∧ B) . The subcases for (A ∨ B) and (A → B) are similar (hence, omitted). qed KKKKK f LLLL e KKKK d LLLLL D EFINITION A.1.3. (L EFT- ASSOCIATED TERMS ) is inductively defined by (1)–(3).

The set of left-associated terms

(1) If x is a variable, then x is a left-associated term; (2) if Z is a constant, then x is a left-associated term; (3) if M is a left-associated term, then (Mx) and (M Z) are left-associated terms, where x is a variable and Z is a constant. Left-associated terms appear in the axioms of combinators on the left-hand side of the B . The dual notion is the set of right-associated terms, which appear in the axioms of dual combinators in chapter 7. D EFINITION A.1.4. (R IGHT- ASSOCIATED TERMS ) terms is inductively defined by (1)–(3).

The set of right-associated

(1) If x is a variable, then x is a right-associated term; (2) if Z is a constant, then x is a right-associated term; (3) if M is a right-associated term, then (xM) and (ZM) are right-associated terms, where x is a variable and Z is a constant.


278


Not all terms are left- or right-associated, though some CL-terms are both. Leftand right-associated terms are singled out because it is easy to specify their shape and they are linked to axioms (though some other CL-terms fall into one of these two categories too). Also, by convention, parentheses may be omitted from leftassociated terms. CL-terms may contain grouping, that is, there might be ( ’s and ) ’s in a term. The structure of a CL-term is naturally depicted as a tree (rather than a sequence of symbols). Nonetheless, it is useful to be able to assign a number to a term, which shows how many atomic terms (more precisely, term occurrences) make up the term. D EFINITION A.1.5. (L ENGTH OF A TERM ) The length of a CL-term is a positive integer. The length function, denoted by ` , assigns a number to a term according to (1)–(3). (1) `(x) = 1 , when x is a variable; (2) `(Z) = 1 , when Z is a constant; (3) `(MN) = m + n , when `(M) = m and `(N) = n . ` is well-defined, that is, ` is a function from the set of CL-terms into Z+ (the set of positive integers), because each CL-term matches the shape of exactly one term from (1)–(3). Obviously, ` is surjective, but not injective. Terms may be depicted as trees, more precisely, as nonempty ordered trees with branching factor two.3 The leaves of the tree are the atomic terms, and the branchings correspond to the binary application operation. The root of the tree is the term itself, and the interior nodes are proper subterms of that term. The latter foreshadows that in the case of leaves and interior nodes it is more accurate to talk about occurrences of subterms than subterms per se. Example A.1.6. The terms x , x(y(zv)) , SKKx and C(Ix)(y(KK)) are depicted by the trees below. x(y(zv)) .. .• ... .....

. ... ...

• x

•. x

SKKx

.... .... .... . ..•.. y(zv) ... ....... . .... .. . . .... .. . zv • ...•...... ... ... y . . .... .. . . . .. •. •

z

v

. ...•..... ... ... ... ... .. ... • SKK.....•..... . . ... x .. . . . .... .. • SK.....•....... . ... . . K ... ... . •. •

S

K

. ...•.....C(Ix)(y(KK)) ... ... ... ... ... ... . . ... .. . ... . .. ... . . ... ... . . C(Ix)...•.... ....•.. y(KK) . ..... . .... ..... . .... Ix .. ... ... . . . . . . .... .. .. .. . . • • ...•... KK ...•.... ... .... ... ........ . y . . . ... C . .... . .. ... .. ...

• I

• x

•

•

K

K

In the first two terms, each subterm has just one occurrence. In the latter two terms, K has two occurrences. Complex subterms may have multiple occurrences too, though there is no such subterm in these particular examples. Given a term and its formation tree, we may uniquely identify the occurrences of subterms. 3 The

formation trees of CL-terms are not the so-called Böhm-trees for λ -terms; that is, the two kinds of trees for a term are not isomorphic.


Appendix A.1

279

D EFINITION A.1.7. Given a term M , the occurrences of subterms in M are identified by assigning an index to them inductively by (1) starting with M0 . (1) If Mi is (NP) , then the subterm occurrences are (N0i P1i ) . Example A.1.8. We continue with the terms displayed above. The indices we get are: x0 ; (x00 (y010 (z0110 v1110 )110 )10 )0 ; (((S0000 K1000 )000 K100 )00 x10 )0 ; and lastly, ((C000 (I0100 x1100 )100 )00 (y010 (K0110 K1110 )110 )10 )0 . (We have restored all the parentheses for the placement of the indices.) Admittedly, with all the parentheses included and all the indices added, the terms became rather bulky. Still, it should be clear that each subterm occurrence has a unique index, hence distinct occurrences of a subterm have distinct indices. For example, the K ’s in the third term have indices 1000 and 100 ; in the fourth term their indices are 0110 and 1110 . D EFINITION A.1.9. A term M has an occurrence in the term N iff M is a subterm of N as defined in 1.1.4. A particular occurrence of M in N is Mi , where i is the index assigned to an M in N0 by definition A.1.7. With each subterm occurrence uniquely indexed, the replacement of an occurrence can be viewed as follows. D EFINITION A.1.10. (R EPLACEMENT OF A SUBTERM ) If Mi is an occurrence of M in N , then [Pi /Mi ]N is the replacement of that occurrence of M by P . If P is a complex term, then the subterms of P are assigned indices by (1) in definition A.1.7 starting with Pi . Visually, the replacement of a subterm occurrence is the replacement of a subtree of the formation tree of the whole term with another subtree (which is itself the formation tree of a term). A replacement of an occurrence of a subterm does not affect the indices of occurrences of subterms that are not subterm occurrences within the replaced occurrence of a subterm.4 Variables are one kind of atomic terms in CL. D EFINITION A.1.11. (VARIABLE OCCURRENCES ) A variable x has an occurrence in M iff x is a subterm of N . A particular occurrence of a variable x in M is xi , where i is the index that occurrence gets in M0 . All occurrences of variables in all CL-terms are free. Replacement and substitution are different ways to alter terms, and they play different roles in theories. However, in CL, the substitution of a term M for the variable x in the term N may be viewed — equivalently — as the replacement of all the occurrences of x in N by M . It is usual to define the sets of free and bound variables in λ -calculi (and in logics with quantifiers or other variable binding operators). (See definitions A.4.1 and A.4.2 in section A.4.) The definitions of those sets take a much simpler form in CL. 4 The

clumsiness of this sentence, and the bulkiness of the indexed terms are the reasons to opt for a slightly more sloppy way of talking about CL-terms — once it has been understood that the sloppiness can be eliminated if necessary, and when there is no danger of confusion.


280


D EFINITION A.1.12. (F REE AND BOUND VARIABLES OF A CL- TERM ) The set of free variables of M is denoted by fv(M) , similarly, the set of bound variables is bv(M) . x ∈ fv(M) iff x is a subterm of M , and bv(M) = 0/ . Sometimes we want to emphasize that a term is a subterm of a term, but not identical to it. The two clauses (1) and (2) in the next definition give the same notion. D EFINITION A.1.13. (P ROPER SUBTERMS ) (1) M is a proper subterm of N iff M is a subterm of N and M is not the same term as N . (2) M is a proper subterm of N iff Mi is an occurrence of M in N0 and i 6= 0 . Substitutions are total maps from the set of variables into the set of CL-terms with (typically) only finitely many variables changed. It is customary, however, to start with a notion of substitution as a one-point modification of the identity function. In chapter 1, we used the notation MxN for the substitution of the CL-term N for all the (free) occurrences of the variable x in the CL-term M . D EFINITION A.1.14. (S IMULTANEOUS SUBSTITUTION ) Let x1 , . . . , xn be n variables and let N1 , . . . , Nn be CL-terms. The simultaneous substitution of N1 , . . . , Nn for x1 , . . . , xn in the CL-term M , that is, [x1 /N1 , . . . , xn /Nn ]M , is recursively defined by (1)–(4). (1) If M is xi , where 1 ≤ i ≤ n , then [x1 /N1 , . . . , xn /Nn ]xi is Ni ; (2) if M is y , where y is a variable distinct from each of x1 , . . . , xn , then [x1 /N1 , . . . , xn /Nn ]y is y ; (3) if M is Z , a constant, then [x1 /N1 , . . . , xn /Nn ]Z is Z ; (4) if M is (P1 P2 ) , then [x1 /N1 , . . . , xn /Nn ](P1 P2 ) is ([x1 /N1 , . . . , xn /Nn ]P1 [x1 /N1 , . . . , xn /Nn ]P2 ) . This definition is very similar to definition 1.2.2. A difference is that clause (1) in the above definition can be viewed as a variable is “selecting” the term that is to be substituted for that variable. Note that we have not stipulated that the N1 , . . . , Nn are distinct from each other or from the variables x1 , . . . , xn . Example A.1.15. For comparison, let us consider x in place of the CL-term in which we substitute. [z/x][y/z][x/y]x indicates three successive substitutions. [x/y]x yields y , the next substitution results in z , and lastly, [z/x]z is x . [z/x, y/z, x/y]x indicates a simultaneous substitution for three variables, including a substitution (for z ) of the same variable x as the term in which the substitution is performed. Since x is atomic, and it is a variable, only one application of clause (1) from definition A.1.14 is possible. The result of [z/x, y/z, x/y]x is y , the same term that would result from [x/y]x .


Appendix A.1

281

P ROPOSITION A.1.16. (E QUIVALENCE OF SUBSTITUTIONS ) Every simultaneous substitution can be simulated by finitely many single substitutions. Single and simultaneous substitutions are essentially equivalent. A single substitution is a simultaneous one (with n = 1 ). The above example shows that a simultaneous substitution is not necessarily equivalent to a series of single substitutions where the simultaneous substitution is chopped up into single steps. However, sequentializing works with a bit of refinement. P ROPOSITION A.1.17. Let [x1 /N1 , . . . , xn /Nn ]M be a simultaneous substitution, and let y1 , . . . , yn−1 be variables distinct from each other and from the xi ’s, as well as from each variable in fv(N1 . . . Nn M) . For each Ni (where 1 < i ≤ n ), let Ni0 be [x1 /y1 , . . . , xi−1 /yi−1 ]Ni . Then the effect of the simultaneous substitution [x1 /N1 , . . . , xn /Nn ]M can be obtained by 2n − 1 consecutive single substitutions: [y1 /x1 ] . . . [yn−1 /xn−1 ][x1 /N10 ] . . . [xn /Nn0 ]M. An eagle-eyed reader might object that we used simultaneous substitution in specifying the Ni0 ’s, and so there is a “circularity” in the proposition. However, all the xi ’s and yi ’s are distinct, hence [x1 /y1 , . . . , xi−1 /yi−1 ]Ni can always be emulated by [x1 /y1 ] . . . [xi−1 /yi−1 ]Ni . (Incidentally, there are always sufficiently many y ’s available for our purposes, because n ∈ N and each term has a finite length.) We prove the proposition (as we promised in chapter 1 and unlike we said we typically do in the introduction to the Appendix). Proof: We show by induction on n that if { x1 , . . . , xi−1 }∩fv(Ni ) = 0/ , then [x1 /N1 , . . . , xn−1 /Nn−1 , xn /Nn ]M is the same CL-term as [x1 /N1 ] . . . [xn−1 /Nn−1 ][xn /Nn ]M . If n = 2 , then we have [x1 /N1 , x2 /N2 ]M and x1 ∈ / fv(N2 ) , by assumption. Then the term [x2 /N2 ]M contains the same occurrences of x1 as M does. (They are the same in the sense of having the same numerical indices.) Thus the terms [x1 /N1 , x2 /N2 ]M and [x1 /N1 ][x2 /N2 ]M are the same. Let us assume that [x1 /N1 , . . . , xn−1 /Nn−1 , xn /Nn ]M (with any M ) satisfies the claim. Suppose additionally, that { x1 , . . . , xn } ∩ fv(Nn+1 ) = 0/ . Then all the occurrences of the variables x1 , . . . , xn in M coincide with those in [xn+1 /Nn+1 ]M . Thus [x1 /N1 , . . . , xn /Nn , xn+1 /Nn+1 ]M and [x1 /N1 , . . . , xn /Nn ][xn+1 /Nn+1 ]M are the same term, and then by the inductive hypothesis [x1 /N1 , . . . , xn /Nn , xn+1 /Nn+1 ]M is [x1 /N1 ] . . . [xn /Nn ][xn+1 /Nn+1 ]M . It only remains to observe that the local disidentifications of variables yielding the Ni0 ’s are reversed by the initial segment [y1 /x1 ] . . . [yn−1 /xn−1 ] in the sequence of substitutions in the term in the proposition. qed KKKKK f LLLL e KKKK d LLLLL CL-terms may be viewed as sequences of symbols. In formal language theory and in theoretical computer science, strings (also called words) and their sets, formal languages are the primary objects. We provide a brief comparison of strings and CL-terms.


282


D EFINITION A.1.18. (S TRINGS ) Let A be a (finite) set { a1 , . . . , an } , an alphabet.5 The set of nonempty strings over A is denoted by A+ , and inductively defined by (1) and (2). (1) A ⊆ A+ ; (2) if s1 ∈ A+ and s2 ∈ A+ , then so is s1 s2 . The set of strings over A is denoted by A∗ , and defined by (3) (given the definition of A+ ). (3) A∗ = A+ ∪ { ε } . Notice that no parentheses surround s1 s2 in clause (2), and this is not sloppiness. Juxtaposition in strings denotes a binary operation that is called concatenation. The lack of parentheses means that concatenation is associative. A∗ differs from A+ by exactly one string: ε is the empty string. ε is called empty, because it does not contain any letters (i.e., elements of the alphabet).6 L EMMA A.1.19. If card(A) ≤ ℵ0 , then card(A+ ) = ℵ0 . Strings can be thought of as finite sequences, or n -tuples. Accordingly, the identity of a pair of strings can be determined by comparing them letter by letter: s1 = s2 iff there is an ai ∈ A such that s1 = ai s01 and s2 = ai s02 , plus s01 = s02 , or both s1 and s2 are ε . For CL-terms we stipulated the existence of a denumerable set of variables. The latter set may be generated from a finite set via indexing, thus in sum each CL-term is a string over a finite alphabet. However, it is also interesting to consider a set of terms that can be generated from a finite set of starting terms. For example, when we are interested only in combinators, then we are interested in a set of CL-terms that can be generated from a combinatory basis alone. D EFINITION A.1.20. (T ERMS OVER T ) Let T be a (finite) set of starting elements {t1 , . . . ,tn } . The set of CL-terms over T is denoted by T⊕ , and inductively defined by (1) and (2). (1) T ⊆ T⊕ ; (2) if M1 ∈ T⊕ and M2 ∈ T⊕ , then so is (M1 M2 ) .7 We deliberately made this definition to look as similar as possible to definition A.1.18. Therefore, the differences should be salient. The juxtaposition is now thought of as function application and t1t2 is enclosed into a pair of parentheses. 5 Sometimes

it is useful to allow infinite sets as alphabets. empty string has been denoted by a wide variety of symbols from o , Φ , 0/ , to Λ . Nowadays, ε seems to be the most commonly used notation. 7 As always, we assume that the delimiters are not elements of the set T . 6 The


Appendix A.1

283

We do not have a counterpart to ε , that is, there is no empty CL-term (hence, the notation ⊕ ). If we allow T to be infinite, and stipulate that the set of variables and the set of constants together are T , then definition A.1.20 gives the same set of CL-terms as definition 1.1.1 does. For readers who are familiar with context-free grammars, we give two CFGs. Let A and T be as in definitions A.1.18 and A.1.20. The set of strings over the alphabet A is defined by the following CFG.8 W := a1 | . . . | an | WW | ε The set of CL-terms over T is defined by the following CFG. M := t1 | . . . | tn | (MM) Terms, obviously, can be viewed as strings (which is demonstrated by the second CFG). This aspect of CL-terms leads to considerations of the number of parentheses,

and if they are well-balanced. These issues are important for the determination of whether a string of symbols is a CL-term as well as for the convention of omitting parentheses. However, the parentheses never form a subterm by themselves; they are auxiliary symbols. Given n letters in an alphabet A , it is quite easy to calculate the number of strings of length m (where the length is simply the number of letter occurrences). The strings of length m comprise all the variations of n elements with repetitions: nm . An informal way to deduce this number is by considering the possible letters that can occupy a position in a series with m spots. There are n letters for the first, and for the second, for the third, etc., places — m times. If we have just one letter, then there is one string of length m , because m1 = m . However, CL-terms have more structure because function application is not an associative operation unlike concatenation is. The number of ways to parenthesize a string into a CL-term is given by the Catalan numbers. D EFINITION A.1.21. (C ATALAN NUMBERS ) The Catalan numbers are denoted by Cn , and they are defined, for n ∈ N , as µ ¶ 2n 1 . n+1 n The first seven Catalan numbers are C0 = 1, C1 = 1, C2 = 2, C3 = 5, C4 = 14, C5 = 42, C6 = 132. In general, the numbers of distinct CL-terms that consist of n occurrences of x (or of another atomic term) is Cn−1 . C LAIM A.1.22. The Catalan numbers can be equivalently defined, for n ≥ 1 , as µ ¶ µ ¶ 2n 2n − . n n−1 8 The

. . . indicate possible additional rewrite rules if there are more that two elements in A or T . Because of the lack of concrete alphabets, these sets of rules may be better viewed as meta-CFGs.


284

A.2


Main theorems

A subterm M of a term N may overlap with another subterm P . The notion of overlapping may be made rigorous using the identification of occurrences of subterms introduced in definition A.1.7. D EFINITION A.2.1. (OVERLAPPING OCCURRENCES ) If Mi is a subterm of a term N , then Pj , a subterm of N , overlaps with Mi iff either i is k j or j is li , where i and j are binary strings, and k or l may be the empty string. Example A.2.2. Let us consider the term xW(I(Bx)(yy)) . The fully indexed term is ((x000 W100 )00 ((I0010 (B01010 x11010 )1010 )010 (y0110 y1110 )110 )10 )0 . First of all, if Mi and Pj are identical, then Mi and Pj overlap. For instance, (xW)00 , overlaps with (xW)00 . If Mi is x11010 and N j is (I(Bx))010 , then i is 11 j , that is, the string 11 concatenated with the binary string j . Symmetrically, if Mi is (yy)110 , then both occurrences of y , y0110 and y1110 overlap with Mi . j is either 0i or 1i . On the other hand, the two occurrences of x in this term do not overlap. The indices of x000 and x11010 are such that neither is the final segment of the other. The indexing now may be seen also as a tool to turn questions about overlapping between subterms into questions of coincidence of final segments of binary strings. The indexing makes precise the notion of overlapping, and reinforces the visual idea. L EMMA A.2.3. Let Zn M1 . . . Mn be a redex in the term N0 . If (ZM1 . . . Mn )i and (ZM1 . . . Mn ) j are subterms of N , then the occurrences overlap iff i = j .9 In the definition of B p1 in chapter 2, we are interested in occurrences of redexes. However, the following more general statement is also true. L EMMA A.2.4. If Mi and M j are subterm occurrences of M in N0 , then Mi and M j are two disjoint (i.e., nonoverlapping) occurrences of M just in case i 6= j . Another way to generalize lemma A.2.3 — without requiring that the two redex occurrences are occurrences of one and the same redex — is the following lemma. L EMMA A.2.5. Let (Zn1 M1 . . . Mn )i and (Zm 2 N1 . . . Nm ) j be overlapping redex occurrences in P0 . If i 6= j , then either (Zn1 M1 . . . Mn )i is a subterm occurrence in Nk (where 1 ≤ k ≤ m ), or (Zm 2 N1 . . . Nm ) j is a subterm occurrence in Ml (where 1 ≤ l ≤ n ).10 9 The

indices of the M ’s are used in the usual way; only i , j and 0 are indices indicating subterm occurrences. 10 Only the three indices i , j and 0 identify subterm occurrences in this statement.


Appendix A.2

285

Example A.2.6. Let Z1 be the first S in the term S(SKKx)(Kyz)(S(SKKx)(Kyz)S) , which contains four distinct redexes and six redex occurrences. The whole term itself is a redex, and all the other redex occurrences are proper subterms of this term. The first occurrence of SKKx , which gets index 1000 , comprises the first argument of the first S (which is S0000 ). The second occurrence of the same subterm is (SKKx)10010 , and this is a proper subterm of the third argument of S0000 . If a redex is a proper subterm of another redex, then the former is completely confined to an argument of the latter. This result does not follow merely from the notions of subterms and occurrences. If we were not assuming that redexes are left-associated terms, then redexes with distinct heads could turn out to be just one occurrence of one subterm. We will see in chapter 7 that this can happen if dual and symmetric combinators are included, and then proper subterms of a term that form a redex are not confined inside of an argument. KKKKK f LLLL e KKKK d LLLLL Various operations on sets of objects fall under the concept of a closure operator. D EFINITION A.2.7. (C LOSURE OPERATOR ) Let c be of type c : P (X) −→ P (X) . c is a closure operator iff it satisfies (1)–(3) for all Y, Z ⊆ X . (1) Y ⊆ c(Y ) ; (2) Y ⊆ Z implies c(Y ) ⊆ c(Z) ; (3) c(c(Y )) ⊆ c(Y ) . It is obvious that c(c(Y )) = c(Y ) once (1) and (3) are combined. The idea of “closure” is expressed by (1).11 Property (2) is called monotonicity, and (3) is the idempotence of c . Concretely, we consider the reflexive, the transitive and the symmetric closure of binary relations. (Various properties of binary relations such as reflexivity and transitivity are defined in section A.6.) D EFINITION A.2.8. (R EFLEXIVE CLOSURE ) Let R be a binary relation on the set X . The reflexive closure of R , denoted by Rid , is R ∪ { hx, xi : x ∈ X } . The reflexive closure of R simply expands R to the least reflexive relation (which includes R ). It may be useful to note that the identity relation (i.e., { hx, xi : x ∈ X } ) does not depend on R itself, rather it depends on X , the set that is the range of the relation R . L EMMA A.2.9.

id

is a closure operator on binary relations.

D EFINITION A.2.10. (T RANSITIVE CLOSURE ) Let R be a binary relation on the set X . The transitive closure of R , denoted by R+ , is defined by (1)–(2). 11 In

topology, the closure of a set is the dual of the interior of a set. The closure may add points, whereas the interior may omit points, so to speak.


286


(1) R ⊆ R+ ; (2) R+ xz if there are y1 , . . . , yn ( n ∈ Z+ ) such that Rxy1 ∧ . . . ∧ Ryi yi+1 ∧ . . . ∧ Ryn z , where 1 ≤ i ≤ n − 1 . (1) makes salient that R is included in its transitive closure. (1) and (2) may be combined into (3). (3) R+ xz if there are y1 , . . . , yn ( n ∈ N ) such that Rxy1 ∧ . . . ∧ Ryi yi+1 ∧ . . . ∧ Ryn z , where 1 ≤ i ≤ n − 1 . The case n = 0 is understood as R+ xz if Rxz . In either formulation, (2) or (3), the transitive closure adds “shortcuts” between points that are connected by a finite number of R edges. L EMMA A.2.11.

+


D EFINITION A.2.12. Let R be a binary relation on the set X . The reflexive transitive closure of R , denoted by R∗ , is (R+ )id . It is not difficult to prove that these two closure operators commute. L EMMA A.2.13. For any binary relation R , (R+ )id = (Rid )+ . That is, the reflexive transitive closure of a relation coincides with its transitive reflexive closure. D EFINITION A.2.14. (S YMMETRIC CLOSURE ) Let R be a binary relation on the set X . The symmetric closure of R , denoted by R↔ , is R ∪ { hx, yi : hy, xi ∈ R } , that is, R ∪ R ∪ . The relation R ∪ is the converse of R , which contains the pairs in R with their order reversed. Thus R↔ depends on R itself, not merely on the range of R . L EMMA A.2.15.

↔


L EMMA A.2.16. For any binary relation R , (R↔ )id = (Rid )↔ . That is, the reflexive symmetric and the symmetric reflexive closures of a relation coincide. The smallest relation we considered on the set of CL-terms (i.e., B1 ) is neither reflexive, nor symmetric. However, we did not consider the reflexive and the symmetric closures in the absence of transitivity. L EMMA A.2.17. The closure operators ↔ and + do not commute. That is, there is a binary relation R such that (R+ )↔ 6= (R↔ )+ . However, (R+ )↔ ⊆ (R↔ )+ . Example A.2.18. Let us consider the terms K(Kxy)z and K(Kxv)w . K(Kxy)z B1 + Kxy B1 x and K(Kxv)w B1 Kxw B1 x . Of course, K(Kxy)z B+ 1 x and K(Kxv)w B1 x . + ↔ However, hK(Kxy)z, K(Kxv)wi ∈ / (B1 ) (indeed, hK(Kxy)z, K(Kxv)wi ∈ / (Bw )↔ ). ↔ ↔ But x B1 Kxw B1 K(Kxv)w , hence ↔ ↔ ↔ K(Kxy)z B↔ 1 Kxy B1 x B1 Kxw B1 K(Kxv)w, + which means that hK(Kxy)z, K(Kxv)wi ∈ (B↔ 1 ) .


287

Appendix A.2

KKKKK f LLLL e KKKK d LLLLL A function may have no, one, two, . . . , n ∈ N , or infinitely many fixed points. We gave some examples in the text; here are some further examples: f (x) = log2 x has no fixed points; f (x) = x3 has three fixed points, 0 , +1 and −1 ; f (x) = x/1 has as many fixed points as the cardinality of its domain, potentially including ℵ0 and 2ℵ0 . If we think about unary numerical functions, then it is easy to visualize the fixed points, because they are simply the points where the curve representing the function in the coordinate system intersects with the linear function f (x) = x . The numerical functions evaluate to a number, thus it is not clear (without further conventions or encoding) what the fixed point of a function of several arguments should be.12 CL-terms applied to CL-terms always result in a CL-term, which means that it makes sense to consider fixed points for any CL-term. KKKKK f LLLL e KKKK d LLLLL A lattice is a particular kind of algebra with two operations that are often called meet and join.13 D EFINITION A.2.19. A = hA, ∧, ∨i is a lattice iff equations (1)–(8) hold. ( a, b, c ∈ A , and the equations are — tacitly — universally quantified.) (1) (2) (3) (4)

a∧a = a a ∧ (b ∧ c) = (a ∧ b) ∧ c a∧b = b∧a a ∧ (b ∨ a) = a

(5) (6) (7) (8)

a∨a = a a ∨ (b ∨ c) = (a ∨ b) ∨ c a∨b = b∨a a ∨ (b ∧ a) = a

An alternative, but completely equivalent definition of lattices starts with partially ordered sets (i.e., posets). (Order relations are introduced in definition A.6.2 below.) D EFINITION A.2.20. (B OUNDS ) let Y ⊆ X .

Let X = hX, ≤i be a partially ordered set, and

(1) z ∈ X is an upper bound of Y iff for all y ∈ Y , y ≤ z . (2) z ∈ X is the least upper bound of Y , denoted as sup(Y ) or lub(Y ) , iff z is an upper bound of Y , and for any z0 that is an upper bound of Y , z ≤ z0 . (3) z ∈ X is a lower bound of Y iff for all y ∈ Y , z ≤ y . (4) z ∈ X is the greatest lower bound of Y , denoted as inf(Y ) or glb(Y ) , iff z is a lower bound of Y , and for any z0 that is a lower bound of Y , z0 ≤ z . 12 In

chapter 6, we will see that this difficulty can be overcome, and there is a model for CL comprising functions on natural numbers. 13 A classic compendium on lattice theory is Birkhoff [].


288


The upper bound of a subset need not be an element of that particular subset. Moreover, no upper bound has to exist, in general. (E.g., N has no upper bound with respect to ≤ , the usual ordering of N .) On the other hand, a subset may have several upper bounds, and there may be no least one among the upper bounds. However, if a poset has an upper bound, then that is the least upper bound of the set. Because of antisymmetry, the least upper bound is unique, which explains the definite article the. Similar remarks apply dually to lower bounds. D EFINITION A.2.21. Let A = hA, ≤i be a partially ordered set. (1) A is a lattice iff nonempty finite subsets of A have sup ’s and inf ’s. (2) A is a bounded lattice iff every finite subset of A has a sup and an inf . (3) A is a complete lattice iff every subset of A has a sup and an inf . The definitions of lattices in A.2.19 and A.2.21 are equivalent when we amend them, respectively, by a definition of a partial order and of two operations. Given a lattice A = hA, ∧, ∨i , a partial order ≤ may be defined by a ≤ b iff a ∧ b = a , or a ≤ b iff a ∨ b = b , and these two orders coincide. Given a lattice A = hA, ≤i , meet and join are defined as inf and sup , respectively, of subsets of cardinality 1 or 2 . / amounts to adding ⊥ to A as an algebra, whereas inf(0) / is tantaAdding sup(0) mount to adding > . Thus the equivalent algebraic formulation of (2) from definition A.2.21 is A = hA, ∧, ∨, ⊥, >i . According to the usual understanding of algebras as structures comprising finitary operations only, there is noWalgebra corresponding to V (3) from definition A.2.21. However, sometimes and are used inVplace W of inf and sup , which resemble ∧ and ∨ . If A is a complete V lattice, then and are W functions of type P (A) −→ A , which justifies viewing and as polyadic operations that might have infinitely many arguments. Thus a complete lattice is an algebra in a wider sense. D EFINITION A.2.22. Let A = hA, ∧, ∨, ~i be a lattice with a unary operation ~ on A . ~ is monotone (or increasing) when a ≤ b implies ~(a) ≤ ~(b) .

A.3


Turing machines, TMs are one of the most popular models of computation. (We give a brief description of them here.) They were originally introduced in Turing [] (reprinted in Davis []). TMs are abstract machines, but they radiate the feel of concreteness, which may be the reason why many variants of TMs have been developed. The class of TM-computable functions is the same as the class of partial recursive functions, but the values of functions are calculated via different steps in the two models.


Appendix A.3

289

D EFINITION A.3.1. A Turing machine T is a quadruple hQ, A, M, Pi , where the elements satisfy (1)–(4). (1) Q = { qi : i ∈ Z+ } is the set of internal states of T ;14 (2) A = { ai : i ∈ Z+ } is the set of symbols that can appear on the tape; (3) M = { L, R } is the set of allowed moves for the head of the TM; (4) P , the program of the TM, is a finite set of quadruples of the form hai , q j , ak , mi , where ai , ak ∈ A , q j ∈ Q and m ∈ M . If P is a function with respect to its first two arguments, then T is deterministic. If there can be two quadruples of the form hai , q j , ak , mi and hai , q j , a0k , m0 i , where ak 6= a0k or m 6= m0 , then T is nondeterministic. A TM should be imagined as a read-write head moving above a two-way infinite tape, which is divided into squares, each containing exactly one symbol. The head contains the program, and it is always in one of the possible internal states. A quadruple hai , q j , ak , mi in the program of T means that, when the head is in state q j over a square containing ai , then T replaces the symbol ai by ak , and moves one square to the left or to the right, depending on whether m is L or R . Natural numbers may be encoded in unary notation as sequences of a symbol, for instance, as sequences of a1 . Then a function f of one argument is TM-computable iff there is a TM such that started in q0 over the leftmost symbol of the sequence representing the number, the TM stops (after finitely many steps) over the leftmost symbol of the sequence representing the number that is the value of the function. (It is usually assumed that there is a symbol, called “blank,” which fills in the rest of the square on the tape at the start and at the end of the computation.) For n -ary functions, the inputs may be stipulated to be separated with exactly one blank. T HEOREM A.3.2. A function f on natural numbers is TM-computable iff f is partial recursive. We do not describe further models, rather we simply list them (together with our favorite expositions of them). Register machines are detailed in Boolos and Jeffrey [, Ch. 6], where they are called “abaci.” Markov algorithms are described in Curry [, Ch. 2, §E] and in Mendelson [, §5.5]. Post systems (and the closely related semi-Thue systems are detailed in Davis [, Ch. 6]. Some further models include Büchi machines, 0 -type grammars and abstract state machines. KKKKK f LLLL e KKKK d LLLLL In chapter 3, Exercises 3.1.1 and 3.1.2 concern multiplication and factorial. We assume that these two functions have been defined, and it is known that they are primitive recursive. The following is a short list of some other functions that are primitive recursive. We use the abbreviation pr( f1 , f2 ) when f1 and f2 are the two 14 Since

i is a positive integer, Q is a finite set.


290


functions that were denoted by f and g in definition 3.1.4. These two functions completely characterize primitive recursive equations. (1) exp = pr(◦(s, z), ◦(×, π31 , π33 )) (where × is multiplication); exp = λxy. xy , that is, exp is exponentiation; (2) pred = pr(0, π21 ) ; pred(0) = 0 and pred(s(x)) = x , that is, pred is the predecessor function; · y = x − y if x ≥ y , and 0 otherwise, that is, − · is · = pr(π1 , ◦(pred, π3 )) ; x − (3) − 1 3 total truncated subtraction. The following functions are also useful to have: · π1 , pred) is the sign function; that is, sg(0) = 0 and sg(s(x)) = 1 ; (1) sg = ◦(−, 1 · ◦(s, z), sg) is the inverted sign function; that is, sg(0) = 1 and (2) sg = ◦(−, sg(s(x)) = 0 ; · π2 , π2 )) is the absolute value of the difference; that is, · ◦(−, (3) | − | = ◦(+, −, 2 1 · · x otherwise; | x − y | = x − y is x ≥ y , and y − · π2 , −) · is the minimum function; that is, min(x, y) = x if x ≤ y , and (4) min = ◦(−, 1 y otherwise; · is the maximum function; that is, max(x, y) = x if x ≥ y , (5) max = ◦(+, π22 , −) and y otherwise. Notice that sg is like negation if 0 and 1 are thought of as the truth values “false” and “true.” Also, for all x , sg(sg(x)) = sg(x) . This means that conjunction and disjunction from classical logic may be defined by (6) and (7). (6) ∧ = ◦(×, ◦(sg, π21 ), ◦(sg, π22 )) is conjunction, that is, x ∧ y = 1 if x = 1 = y , and 0 otherwise; (7) ∨ = ◦(sg, ◦(sg, π21 ), ◦(sg, π22 )) is disjunction, that is, x ∨ y = 0 if x = 0 = y , and 1 otherwise. KKKKK f LLLL e KKKK d LLLLL The first-order theory of arithmetic is usually called Peano arithmetic, and abbreviated as PA. The language of PA is a first-order language that includes a name constant 0 , a unary function symbol s , as well as two binary function symbols + and × . Informally, 0 is the number zero, s is the successor function, and + and × are addition and multiplication. The axioms of PA are as follows.15 (A1) ∀x ∀y. s(x) = s(y) ⇒ x = y 15 By

saying that PA is a first-order theory, we mean that the axioms listed here are added to a (sound and complete) formalization of classical first-order logic with identity.


Appendix A.3

291

(A2) ∀x. ¬0 = s(x) (A3) ∀x. x + 0 = x (A4) ∀x ∀y. x + s(y) = s(x + y) (A5) ∀x. x × 0 = 0 (A6) ∀x ∀y. x × s(y) = (x × y) + x (A7) (A(0) ∧ ∀x. A(x) ⇒ A(s(x))) ⇒ ∀x. A(x) Axiom (A7) is the first-order induction axiom; that is, A is a one-place predicate expressible in the language of PA (rather than a tacitly quantified predicate variable). The axioms do not look very complicated, and so it may be unexpected that this first-order theory is remarkably complicated and powerful. The next two theorems, in effect, are Gödel’s theorems for PA.16 They are often labeled as “the first” and “the second” incompleteness theorems, respectively. T HEOREM A.3.3. (F IRST INCOMPLETENESS THEOREM ) There is a sentence in the language of PA such that neither the sentence nor its negation is provable in PA. The notion of incompleteness in this theorem is syntactic, though it is closely related to semantic incompleteness. T HEOREM A.3.4. (S EMANTIC INCOMPLETENESS ) Given any interpretation of PA, which makes all the theorems of PA true, there is a sentence that is true in that interpretation but unprovable in PA. Both theorems might seem to suggest that we simply need to find a “better” theory, let us say, PA 0 , that appropriately extends PA. In other words, this purported theory PA 0 should contain all the axioms of PA and more. T HEOREM A.3.5. (I NCOMPLETABILITY ) iomatizable, consistent and complete.

There is no extension of PA that is ax-

Axiomatizability means having a recursive (i.e., decidable) set of sentences. The semantic incompleteness theorem can then be phrased as “the set of true sentences in the language of PA is not recursive.” Gödel’s aim, in the spirit of the formalist program for the foundations of mathematics, was to prove consistency. PA is sufficiently expressive to be able to formalize its own consistency, for instance, in the form “ 0 = 1 is not provable.” T HEOREM A.3.6. (S ECOND INCOMPLETENESS THEOREM ) own consistency, provided that PA is consistent. 16 G¨ odel

[] is the original “incompleteness paper.”


PA cannot prove its

292


If PA is inconsistent, then it proves any formula in its language, including all the sentences expressing the consistency of PA — as well as those expressing the inconsistency of PA. In view of this, the theorem says that, if there is at least one formula that is not provable in PA, then a formula expressing the consistency of PA is not provable either.17 The second incompleteness theorem is not “absolute” in the sense that it does not state or imply that the consistency of PA cannot be proved at all. (See Gentzen [] for the first proof.) There are “stronger” formal systems, for example, ZF in which the consistency of PA can be proved. The latter means that PA is consistent relative to ZF. On the other hand, PA cannot prove the consistency of ZF; neither can ZF prove its own consistency.

A.4

Connections to λ-calculi

A complication in Λ is the λ operator which explicitly binds a variable. The next two definitions introduce the same notions for Λ that are introduced in definition A.1.12 for CL. D EFINITION A.4.1. The set of free variables of a term M is inductively defined by (1)–(3). (1) fv(x) = { x } ; (2) fv(MN) = fv(M) ∪ fv(N) ; (3) fv(λx. M) = fv(M) − { x } . fv(M) is always a proper subset of the set of variables. Since fv is a set, the number of occurrences of variables are not counted. If fv(M) = 0/ , then M is called a closed Λ -term. D EFINITION A.4.2. The set of bound variables of a term M is inductively defined by (1)–(3). (1) bv(x) = 0/ ; (2) bv(MN) = bv(M) ∪ bv(N) ; (3) bv(λx. M) = bv(M) ∪ { x } . 17 There

are detailed formal presentations of theorems of this sort for PA and for other systems like Q and ZF. See, for example, Boolos and Jeffrey [].


Appendix A.4

293

bv(M) is also a proper subset of the set of variables. In order to make the parsing of Λ -terms easier, it may be useful to use two different infinite sequences of variables. For instance, x ’s can be used for bound and v ’s for free variables. This practice yields Λ -terms that are easier to read, but it leads to more complicated definitions of Λ -terms, of substitution and of other related concepts. We do not adopt this convention here. Then, there are Λ -terms that contain a variable both as a bound and as a free variable, that is, fv(M) ∩ bv(M) 6= 0/ is not excluded. Example A.4.3. x(λxyz. yx)y is a Λ -term by definition 4.1.1. fv(x(λxyz. yx)y) = { x, y } and bv(x(λxyz. yx)y) = { x, y, z } . Notice that z ∈ / fv(yx) , but it follows a λ . Beyond the fact that λxyz. yx is a ternary function (because it is λx λy λz. yx ), it is necessary to list z in bv(λxyz. yx) when it comes to substituting Λ -terms for x or y . Definition A.1.7 gave a convenient way to identify occurrences of subterms in CLterms. The same indexing cannot be adopted for Λ -terms without changes, because of the possibility to form λ -abstracts. We do not extend the indexing for CL-terms to Λ -terms here (even though this can be done rigorously). Rather, we assume that in the few cases when we need, we can rely on the informal notion of occurrences. D EFINITION A.4.4. (F REE AND BOUND OCCURRENCES OF VARIABLES ) An occurrence of the variable x in M is free iff no subterm of M of the form λx. N contains that occurrence. Otherwise, the occurrence is bound. Each occurrence of a variable is free or bound, but never both. The occurrence of a variable that comes immediately after a λ , is always bound. A variable cannot be bound more that once, that is, by two or more distinct λ ’s. Thus it is important, for instance, for β -reduction to determine binding relationships between λ ’s and variables in Λ -terms. D EFINITION A.4.5. A variable occurrence x that is bound in M , but is not preceded by a λ , is bound by the λ in λx. N if the occurrence falls into N , which has no proper subterm λx. P containing that occurrence of x . More concisely, though a bit sloppily, a variable occurrence is bound by the λ (with a matching variable) that has the narrowest scope. KKKKK f LLLL e KKKK d LLLLL Famously, Church gave a preference to the λI -calculus over the λK -calculus. In the λK -calculus, a λ may bind just one occurrence of a variable, which is immediately after the λ . D EFINITION A.4.6. ( λI - TERMS )

The set of λI -terms is defined by (1)–(3).

(1) If x is a variable, then x is a λI -term; (2) if M and N are λI -terms, then (MN) is a λI -term; (3) if x is a variable and M is a term such that x ∈ fv(M) , then λx. M is a λI -term.


294


Clause (3) does not allow the possibility of forming a vacuous λ -abstraction. λI terms are connected to the logic of relevant implication. Linear λ -terms are named after linear logic, which is an extension of the implicational BCI logic. Linear λ -terms constitute a proper subset of the λI -terms. D EFINITION A.4.7. (L INEAR λ - TERMS ) (1)–(3).

The set of linear λ -terms is defined by

(1) If x is a variable, then x is a linear λ -term; (2) if M and N are linear λ -terms and fv(M) ∩ fv(N) = 0/ , then (MN) is a linear λ -term; (3) if x is a variable, and M is a linear λ -term such that x ∈ fv(M) , then λx. M is a linear λ -term.

A.5


Equations play an important role in defining classes of algebras. Equational and inequational logics were invented to axiomatize reasoning that is used in algebras that are defined by sets of equations or inequations. Let us assume that there is an indexed set of operations in an algebra, ~i∈I . We need to single out an argument place of each operation, and for this purpose we use the notation ~i (~a, [b] j ) to indicate that there are some a ’s that fill out the argument places of ~i save the j th place, which has b in it. ~a can be thought of as a sequence or vector of some elements. (We always assume that j is within the range of 1 to n if ~i is an n -ary operation.) Terms in an algebra are formed in the usual way from variables and operations; and formulas are always of the form t1 = t2 , where t1 and t2 are terms. The equational calculus comprises an axiom and rules. There are three rules that are not specific for the particular set of operations. For each operation ~i , there are as many rules as the arity of the operation. x=x x=y y=z x=z

tr

id

x=y y=x

sym

r=s [x1 /t1 , . . . , xn /tn ]r = [x1 /t1 , . . . , xn /tn ]s t =s ~i (~r, [t] j ) = ~i (~r, [s] j )


j

repi

sub

295

Appendix A.5

The axiom is called identity, and the next two rules make = transitive and symmetric. (See section A.6 for definitions of properties of binary relations.) The rule sub permits a substitution of terms, for instance, of t1 , . . . ,tn for variables, for instance, for x1 , . . . , xn in a pair of terms r and s with their identity being preserved. The last rule should be understood as a rule schema in the sense that for an n -ary ~i , it abbreviates n rules. That is, rep is a rule for each j , where 1 ≤ j ≤ n . The language of an algebra is always assumed to contain = as a binary predicate, but it may not contain ≤ as another binary predicate. Some algebras allow a partial order to be defined relying on the operations in the algebra. For instance, lattices and Boolean algebras have a partial order standardly associated to them. (See definitions A.2.19, A.2.21, A.9.7 and A.6.6.) An algebra may contain a partial order, denoted by ≤ , as a primitive — in addition to an indexed set of operations ~i∈I . Then ≤ can be used similarly to = as a binary predicate. The resulting formulas are called inequations or inequalities. D EFINITION A.5.1. (T ONICITY ) An operation ~ is monotone in its j th argument place iff for all ~a , and for all b and c , b ≤ c implies ~(~a, [b] j ) ≤ ~(~a, [c] j ) . An operation ~ is antitone in its j th argument place iff for all ~a , and for all b and c , b ≤ c implies ~(~a, [c] j ) ≤ ~(~a, [b] j ) . Example A.5.2. A Boolean algebra may be defined using only two operations, − and ∨ , which are complementation and join. a ≤ c implies a ∨ b ≤ a ∨ c as well as b ∨ a ≤ b ∨ c , that is, join is monotone in both argument places. Complementation, on the other hand, is antitone, because a ≤ b implies −b ≤ −a . The ineqational calculus contains an axiom and three general rules, together with a set of rules specific to the operations of the algebra. x≤x x≤y y≤z x≤z

tr

id

x≤y y≤x x=y

antisym

r≤s [x1 /t1 , . . . , xn /tn ]r ≤ [x1 /t1 , . . . , xn /tn ]s t ≤s ~i (~r, [t] j ) ≤ ~i (~r, [s] j ) t ≤s ~i (~r, [s]k ) ≤ ~i (~r, [t]k )

sub

j

monoi

antiki

The rules tr and sub are similar to those in the equational calculus. antisym ensures that ≤ is antisymmetric. The mono and anti rules are postulated for an operation and an argument place, depending on the tonicity of the operation in that argument place. Typically, an operation is not both monotone and antitone for an


296


argument place, and it even may not be either. That is, the mono and anti rules together give at most as many rules as rep gives in the equational calculus. In chapter 5, and then in chapter 7, we use extensions and modifications of the equational and inequational calculi given in this section. First of all, combinators are constants (or nullary operations), and they require the addition of axioms, in which the combinators interact with the function application operation, because the only non-zeroary operation in CL is function application. The inequational calculi that we use to axiomatize systems of CL do not contain the rule antisym , because Bw is not antisymmetric. Perhaps, another name such as “preequational calculi” would be more faithful to the preorder on CL-terms that is Bw . Instead of introducing the new term “pre-equation,” we opted for using “inequation” with a proviso.

A.6

Models

Binary relations appear in many areas; Bw and =w are the leading examples in CL. The following is a (fairly) standard list of properties and names for kinds of

binary relations. To suggest general applicability, the binary relation is denoted by R . The arguments are written without parentheses and commas (which is one of the commonly used notations). D EFINITION A.6.1. (P ROPERTIES OF RELATIONS ) a set X , that is, R ⊆ X × X .

Let R be a binary relation on

(1) R is reflexive iff for all x ∈ X , Rxx . (2) R is transitive iff for all x, y, z ∈ X , Rxy and Ryz imply Rxz . (3) R is symmetric iff for all x, y ∈ X , Rxy implies Ryx . (4) R is asymmetric iff for all x, y ∈ X , Rxy implies ¬Ryx , that is, Rxy implies that Ryx does not hold. (5) R is antisymmetric iff for all x, y ∈ X , Rxy and Ryx imply x = y . (6) R is connected iff for all x, y ∈ X , Rxy or Ryx . (7) R is the identity relation iff for all x, y ∈ X , Rxy just in case x = y . (8) R is the total relation iff for all x, y ∈ X , Rxy . D EFINITION A.6.2. (O RDER RELATIONS ) Let R be a binary relation on the set X . (1) R is a preorder (or quasi-order) iff R is reflexive and transitive. (2) R is a partial order iff R is an antisymmetric preorder.


Appendix A.6

297

(3) R is a strict partial order iff R is irreflexive and transitive. (4) R is a linear order iff R is a connected partial order. (5) R is a strict linear order iff R is a connected strict partial order. Sometimes the strict variants of these order relations are considered more fundamental, in which case (2) and (4) are called weak partial order and weak linear order, respectively. Linear orders have been called total orders as well as simple orders. Equivalence relations could also be considered among order relations, but it is perhaps, useful to separate them into their own group. D EFINITION A.6.3. (E QUIVALENCE RELATIONS AND EQUIVALENCE CLASSES ) Let R be a binary relation on the set X . (1) R is an equivalence relation iff R is a symmetric partial order. In other words, an equivalence relation is reflexive, transitive and symmetric. Let R be an equivalence relation on X . A subset Z of X is an equivalence class with respect to R just in case Z is [x] for some x ∈ X , where (2) [x] = { y ∈ X : Rxy } . Sets have subsets, and the collection of all the subsets of a set X is the power set of X . Certain other collections of subsets of a set have important features. D EFINITION A.6.4. (PARTITIONS ) Let X be a set, and Y = {Yi : i ∈ I ∧Yi ⊆ X } be a collection of nonempty subsets of X . Y is a partition of X when (1) and (2) hold. (1) ∀x ∈ X ∃Yi ∈ Y. x ∈ Yi ; (2) ∀x ∈ X. x ∈ Yi ⇒ Yi 6= Y j ⇒ x ∈ / Yj . Y is a partition of X when Y comprises nonempty subsets of X that are pairwise disjoint and together cover all the elements of X . Thus, alternatively, we may define Y to be a partition of X when (3) and (4) hold. (3) ∀i, j. i 6= j ⇒ Yi ∩Y j = 0/ ; (4)

S

i∈I Yi

=X.

Partitions are easy to visualize, and they are intimately linked to equivalence relations. L EMMA A.6.5. (E QUIVALENCE RELATIONS AND PARTITIONS ) Let E be the set of all equivalence relations on X and let P be the set of all partitions of X . There is a 1–1 correspondence between the elements of E and P .


298


The idea for a proof of this lemma is to use equivalence classes in place of the subsets figuring into a partition. (It is easy to show that each equivalence relation gives rise to a set of equivalence classes, and the other way around.) The coarsest partition of a set comprises just one subset, namely, the set itself. The set of singletons — where each element of a set is an element of a singleton — is the finest partition of a set. These two extreme partitions correspond to the total relation and the identity relation on the set, respectively. KKKKK f LLLL e KKKK d LLLLL Boolean algebras are very well understood and extremely important operational structures in universal algebra. D EFINITION A.6.6. (B OOLEAN ALGEBRAS ) The algebra B = hB, ∧, ∨, −, 0, 1i of similarity type h2, 2, 1, 0, 0i is a Boolean algebra when the following equations hold. a∧a = a (a ∧ b) ∧ c = a ∧ (b ∧ c) a∧b = b∧a a ∧ (a ∨ b) = a a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c) a ∧ −a = 0 a∧1 = a

a∨a = a (a ∨ b) ∨ c = a ∨ (b ∨ c) a∨b = b∨a a ∨ (a ∧ b) = a a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c) a ∨ −a = 1 a∨0 = a

The carrier set of an algebra (e.g., B above) is always assumed to be closed under the operations of the algebra.18 The similarity type of an algebra is a listing of the arity of its operations. (Zeroary operations are elements of the carrier set, and they are typically stipulated to satisfy some equations or conditions.) Algebras come with an identity relation, and replacement of identical elements is always permitted. Equations, like the ones above, are understood to be universally quantified. For example, a ∧ b = b ∧ a means that for all a ∈ B , and for all b ∈ B , the elements a ∧ b and b ∧ a are identical. The operations of B are sometimes called meet ( ∧ ), join ( ∨ ) and (Boolean or ortho-)complement ( − ). 0 and 1 are the bottom and top elements, respectively; alternatively, they are the identity elements for join and meet, and the null elements for meet and join. Boolean algebras may be specified by a set of equations (e.g., as above), hence they form a variety. Varieties have been extensively studied, and they possess properties — such as closure under homomorphic images — that makes them an easy topic for investigations. The smallest Boolean algebra is h{ a }, ∧, ∨, −, 1, 0i . All algebras with just one element are called trivial, and as it often happens to extremal elements, trivial algebras are excluded or included, depending on the aims of the investigations. We consider some nontrivial Boolean algebras as examples. 18 An

exception is when so-called partial algebras are considered too.


299

Appendix A.6

•

•

. .. ... ...1 .... ... ... .... ... .... . . ... .. . .... . . ... ... . . . . .... . ... ... ... −a a ...... . . .. ... . . .. ... ... ..... ... ...

•... 1 .. .. .. ... .. .. .. .

•

•0

−c

•

•

•

•

•

a•

•0

2

1........................................... −a ... . .... .... . ... .. . . .... .. .. ... .... .. .... −b ............... ... . . ... . .. ...... . . ... ............... . .. .. .. .. .. .. .. .. .. ... . .. .. .. . . . . . . . . . . . . . . . .. . .................... .. ... . . . . . .. . . ... c . ... . .. ........ b . .. ..... .. .... ..... .. .... ..................... ............... ......

•

•0

8

4

2 is theonly irreducible Boolean algebra, that is, it is not (isomorphic to) a product of Boolean algebras. 4 is 2 × 2 , and 8 is 4 × 2 . These Boolean algebras have 1 , 2 and 3 atoms, respectively (which are 1 ; a and −a ; and a , b and c ). Every finite Boolean algebra has 2n many elements when it has n atoms. A prototypical example of a Boolean algebra is the power set of a set. The above examples can be easily seen to be isomorphic to the power set algebras of a singleton, of a doubleton and of a three element set. Despite the importance of these kinds of Boolean algebras, not all Boolean algebras are isomorphic to a power set algebra. KKKKK f LLLL e KKKK d LLLLL Topologies are often useful to select a subset of the powerset of a set. D EFINITION A.6.7. (T OPOLOGY ) X when (1)–(3) hold.

Let X be a set. T = hX, Oi is a topology on

(1) X, 0/ ∈ O ; (2) O1 , O2 ∈ O imply O1 ∩ O2 ∈ O ; (3) Oi∈I ∈ O implies

S

i∈I Oi

∈ O.

The elements of O are called open sets. The powerset of a set is a topology, but often interesting collections of subsets are topologies without comprising all the subsets. Conditions (2) and (3) are closure conditions: O is closed under finite intersections and arbitrary unions. D EFINITION A.6.8. (BASIS AND SUBBASIS FOR A TOPOLOGY ) be a topology on X . B is a basis for T if (1)–(3) are true. (1) B ⊆ O ; (2) B1 , B2 ∈ B imply B1 ∩ B2 ∈ B ; (3) O ∈ O implies O =

S

C for some C ⊆ B .

S is a subbasis for T if (1)–(2) are true. (1) S ⊆ O ; (2) { B : B =

T

C ∧ C ⊆fin S } is a basis for T .


Let T = hX, Oi

300


A basis generates a topology. If only a basis B is given, then we denote the topology generated by the basis as τ(B) . A subbasis S also generates a topology, which is denoted by τ(S) . Given S , all sets obtainable by finite intersections yield a basis B , then arbitrary unions are formed, which results in O . D EFINITION A.6.9. (C ONTINUOUS FUNCTIONS ) Let T1 = hX1 , O1 i and T2 = hX2 , O2 i be topologies, and let f be a function of type X1 −→ X2 . f is continuous when for O ∈ O2 , f −1 [O] ∈ O1 . f −1 followed by [ ] is the type-raised inverse function of f . f −1 : P (X2 ) −→ P (X1 ) is the type of f −1 . f −1 [O] = { x : ∃y ∈ O. f (x) = y } , that is, the existential image operation of the inverse of f . The inverse of f may or may not be a function. However, f −1 collects into a subset some elements and always yields a function from the powerset of f ’s codomain into the powerset of f ’s domain. If f is injective (and onto), then f −1 [{ x }] = { y } , for all x ∈ cod( f ) . A function f is continuous in the topological sense iff the inverse image of f maps an open set into an open set. T HEOREM A.6.10. (C ONTINUOUS FUNCTIONS ARE CONTINUOUS ) A function f : P (N) −→ P (N) is continuous in the sense of definition 6.3.2 just in case f is continuous in the sense of definition A.6.9 when N is equipped with the Scott topology from definition 6.3.1. KKKKK f LLLL e KKKK d LLLLL Binary strings are finite sequences of characters each of which is a 0 or a 1 . In section A.1, we gave a definition of strings (or words) over an alphabet using a context-free grammar. For binary strings, the alphabet is { 0, 1 } . It is not difficult to see that there are ℵ0 -many binary strings. Natural numbers have a natural ordering, namely, ≤ . Binary strings may be viewed as natural numbers in base-two notation. Strings, in general, need not contain any digits (i.e., numerical characters), for instance, if the alphabet does not have any. A lexicographic order is a strict linear ordering on a set of strings induced by the linear ordering of the alphabet. The term “lexicographic ordering” is used — somewhat confusingly — to refer to two different orderings. D EFINITION A.6.11. (L EXICOGRAPHIC ORDERING , I) Let the linear ordering on the alphabet A = { a0 , . . . , an } be a0 < . . . < ai < . . . < a0i < . . . < an . The lexicographic ordering on A∗ is the least relation satisfying (1)–(2).19 (1) w1 < w2 if `(w1 ) < `(w2 ) ; (2) w1 < w2 if `(w1 ) = `(w2 ) and w1 = vai u1 and w2 = va0i u2 . 19 w ’s,

v ’s and u ’s range over strings. The length of a string w , denoted by `(w) , is the number of letters w contains.


Appendix A.6

301

Example A.6.12. According to the definition, ε precedes all the nonempty words, because ε is the shortest word of length 0 . Let a0 < a1 < a2 < a3 < a4 be the linear order on the alphabet. a1 a0 a2 a2 < a1 a0 a2 a4 , because `(a1 a0 a2 a2 ) = `(a1 a0 a2 a3 ) = 4 , and v in clause (2) of the definition may be taken to be a1 a0 a2 , whereas u1 = u2 = ε . a0 a0 a2 a2 < a0 a4 a1 a3 by clause (2) too. a0 < a4 in the linear ordering on A , and u1 = a2 a2 , whereas u2 = a1 a3 . If the set of strings S is a proper subset of A∗ , then the clauses from the above definition are still applicable, and the ordering generated by (1)–(2) is the same on S as 0 ; (2) w1 < w2 if w1 = vai u1 and w2 = va0i u2 ; (3) w1 < w2 if w2 = w1 ai . The strings that we considered in example A.6.12, will get the same ordering according to the second definition. However, in general, the orderings determined by the two definitions differ — because of the absence of any reference to the length of the strings in (2) in definition A.6.13. Example A.6.14. Assuming the same linear order for the alphabet as in the previous example, a1 a2 < a3 in the second lexicographic ordering — despite the fact that a3 is shorter than a1 a2 . If `(w1 ) = `(w2 ) , then w1 = a (5) ⊥ ∧ a = ⊥ If one of > or ⊥ is dropped (together with (4) or (5), as appropriate), then A is a meet semilattice with top or with bottom (only).


Appendix A.9

319

The meet operationVis the binary version of the greatest lower bound, which is denoted by glb , inf or . (See definition A.2.20 above.) The next definition parallels — and should be compared to — definition A.2.21. D EFINITION A.9.10. Let A = hA, ≤i be a partially ordered set. (1) A is a meet semilattice iff nonempty finite subsets of A have inf ’s. (2) A is a meet semilattice with top iff every finite subset of A has a inf . (3) A is a complete lattice, hence also a complete meet semilattice iff every subset of A has an inf . Some subsets of the carrier set of a (semi)lattice are of particular importance. D EFINITION A.9.11. (U PWARD - CLOSED SUBSETS ) Let A = hA, ∧i be a meet semilattice, and let B ⊆ A . B is an upward-closed subset of A iff (1) a ≤ b and a ∈ B imply b ∈ B . Upward closed sets reappear in many places, essentially, as soon as there is an order relation on a set. They have been labeled variously as cones, upsets and increasing sets. In chapter 6, definition 6.6.5 introduced downward-directed cones, which are special cones on arbitrary partially ordered sets. D EFINITION A.9.12. (D OWNWARD - DIRECTED SUBSETS ) Let A be a partially ordered set, and let B ⊆ A . B is a downward-directed subset of A when (1) and (2) are true. (1) B 6= 0/ ; (2) a, b ∈ B implies that there is a c ∈ B such that c ≤ a and c ≤ b . If A is the carrier set of a meet semilattice, then c ≤ a means that c ∧ a = c and c ≤ b means that c ∧ b = c . That is, B is a downward-directed subset of a meet semilattice whenever B is closed under meet. D EFINITION A.9.13. (F ILTERS ) (1)–(3) hold.

Let A be a meet semilattice. B ⊆ A is a filter iff

(1) B 6= 0/ ; (2) a ∈ B and a ∧ b = a imply b ∈ B ; (3) a, b ∈ B imply a ∧ b ∈ B . Filters are exactly the downward-directed cones, when the partially ordered set is a meet semilattice. We may note that occasionally 0/ , the empty set is counted as a filter — depending on the purpose of the definition — in which case filters are downward-directed cones or the empty set.


320


D EFINITION A.9.14. (P RINCIPAL CONES AND FILTERS ) Let A be a meet semilattice. The set [a) is defined as [a) = { b : a ≤ b } , and it is the principal cone generated by a . [a) is a filter too, and it is called the principal filter generated by a . Not all cones are filters, and not all cones are principal. In general, not all filters are principal, but in a finite meet semilattice, all (nonempty) filters are principal.


Bibliography

 . Roberto M. Amadio and Pierre-Louis Curien. Domains and Lambda-Calculi. Number 46 in Cambridge Tracts in Computer Science. Cambridge University Press, Cambridge, 1998.  . Alan R. Anderson. Entailment shorn of modality (abstract). Journal of Symbolic Logic, 25:388, 1960.  . Alan R. Anderson and Nuel D. Belnap. Entailment. The Logic of Relevance and Necessity, volume 1. Princeton University Press, Princeton, NJ, 1975.  . Alan R. Anderson, Nuel D. Belnap, and J. Michael Dunn. Entailment. The Logic of Relevance and Necessity, volume 2. Princeton University Press, Princeton, NJ, 1992.  . Franco Barbanera and Stefano Berardi. A symmetric lambda calculus for classical program extraction. Information and Computation, 125:103–117, 1996.  . Franco Barbanera, Mariangiola Dezani-Ciancaglini, and Ugo de’Liguoro. Intersection and union types: syntax and semantics. Information and Computation, 119:202–230, 1995.  . Franco Barbanera, Stefano Berardi, and Massimo Schivalocchi. “Classical” progSym ramming-with-proofs in λPA : an analysis of non-confluence. In Martin Abadi and Takayasu Ito, editors, Proceedings of the 3rd Symposium (TACS’97) held at Tohuku University, September 23–26, 1997, number 1281 in Lecture Notes in Computer Science, pages 365–390, Berlin, 1997. Springer.  . Henk Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science. Background: Computational Structures, volume 2, pages 117–309. Oxford University Press, New York, NY, 1992.  . Henk Barendregt, Mario Coppo, and Mariangiola Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48:931– 940, 1983.  . Henk P. Barendregt. The Lambda Calculus. Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1981.  . Nuel D. Belnap. Display logic. Journal of Philosophical Logic, 11:375–417, 1982.  . Nuel D. Belnap and John R. Wallace. A decision procedure for the system EI of entailment with negation. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik, 11:277–289, 1965.  . Katalin Bimbó. Investigation into combinatory systems with dual combinators. Studia


322

Bimbó: Combinatory Logic Logica, 66:285–296, 2000.

 . Katalin Bimbó. Semantics for structurally free logics LC+ . Logic Journal of IGPL, 9: 525–539, 2001.  . Katalin Bimbó. The Church-Rosser property in dual combinatory logic. Journal of Symbolic Logic, 68:132–152, 2003.  . Katalin Bimbó. Semantics for dual and symmetric combinatory calculi. Journal of Philosophical Logic, 33:125–153, 2004.  . Katalin Bimbó. The Church-Rosser property in symmetric combinatory logic. Journal of Symbolic Logic, 70:536–556, 2005.  . Katalin Bimbó. Types of I-free hereditary right maximal terms. Journal of Philosophical Logic, 34:607–620, 2005.  . Katalin Bimbó. Admissibility of cut in LC with fixed point combinator. Studia Logica, 81:399–423, 2005.  . Katalin Bimbó. Curry-type paradoxes. Logique et Analyse, 49:227–240, 2006.  . Katalin Bimbó. Relevance logics. In Dale Jacquette, editor, Philosophy of Logic, volume 5 of Handbook of the Philosophy of Science (D. Gabbay, P. Thagard and J. Woods, eds.), pages 723–789. Elsevier (North-Holland), Amsterdam, 2007. t , LR◦ , LK and cutfree proofs. Journal of Philosophical Logic,  . Katalin Bimbó. LE→ ∧ ∼ 36:557–570, 2007.

 . Katalin Bimbó. Combinatory logic. In E. Zalta, editor, Stanford Encyclopedia of Philosophy, pages 1–54. CSLI, Stanford, CA, URL: plato.stanford.edu/entries/ logic-combinatory, 2008.  . Katalin Bimbó. Schönfinkel-type operators for classical logic. Studia Logica, 95:355– 378, 2010.  . Katalin Bimbó and J. Michael Dunn. Generalized Galois Logics. Relational Semantics of Nonclassical Logical Calculi, volume 188 of CSLI Lecture Notes. CSLI Publications, Stanford, CA, 2008.  . Katalin Bimbó and J. Michael Dunn. Two extensions of the structurally free logic LC . Logic Journal of IGPL, 6:403–424, 1998.  . Garrett Birkhoff. Lattice Theory, volume 25 of AMS Colloquium Publications. American Mathematical Society, Providence, RI, 3rd edition, 1967.  . George S. Boolos and Richard C. Jeffrey. Computability and Logic. Cambridge University Press, Cambridge, UK, 3rd edition, 1992.  . Ross T. Brady, editor. Relevant Logics and Their Rivals. A Continuation of the Work of R. Sylvan, R. Meyer, V. Plumwood and R. Brady, volume II. Ashgate, Burlington, VT, 2003.  . Sabine Broda and Luis Damas. On principal types of combinators. Theoretical Computer Science, 247:277–290, 2000.  . Maarten Bunder. Set Theory Based on Combinatory Logic. PhD thesis, University of


Bibliography

323

Amsterdam, 1969.  . Martin Bunder. A weak absolute consistency proof for some systems of illative combinatory logic. Journal of Symbolic Logic, 48:771–776, 1983.  . Martin Bunder. A simplified form of condensed detachment. Journal of Logic, Language and Information, 4:169–173, 1995.  . Martin W. Bunder. Expedited Broda–Damas bracket abstraction. Journal of Symbolic Logic, 65:1850–1857, 2000.  . Martin W. Bunder. Proof finding algorithms for implicational logics. Theoretical Computer Science, 232:165–186, 2000.  . Martin W. Bunder. Intersection types for lambda-terms and combinators and their logics. Logic Journal of IGPL, 10:357–378, 2002.  . Martin W. Bunder. Intersection type systems and logics related to the Meyer–Routley system B + . Australasian Journal of Logic, 1:43–55, 2003.  . Martin W. Bunder. Corrections to some results for BCK logics and algebras. Logique et Analyse, 31:115–122, 1988.  . Martin W. Bunder. Combinatory logic and lambda calculus with classical types. Logique et Analyse, 137–138:69–79, 1992.  . Martin W. Bunder. Theorems in classical logic are instances of theorems in condensed BCI logic. In K. Doˇsen and Schroeder-Heister P., editors, Substructural Logics, pages 48–62. Clarendon, Oxford, UK, 1993.  . Martin W. Bunder. Lambda terms definable as combinators. Theoretical Computer Science, 169:3–21, 1996.  . Martin W. Bunder and Robert K. Meyer. A result for combinators, BCK logics and BCK algebras. Logique et Analyse, 28:33–40, 1985.  . Felice Cardone and J. Roger Hindley. History of lambda-calculus and combinatory logic. In Dov M. Gabbay and John Woods, editors, Logic from Russell to Church, volume 5 of Handbook of the History of Logic, pages 732–617. Elsevier, Amsterdam, 2009.  . Alonzo Church. The Calculi of Lambda-Conversion. Princeton University Press, Princeton, NJ, 1st edition, 1941.  . Alonzo Church. The weak theory of implication. In A. Menne, A. Wilhelmy, and H. Angsil, editors, Kontrolliertes Denken, Untersuchungen zum Logikkalkul und zur Logik der Einzelwissenschaften, pages 22–37. Komissions-Verlag Karl Alber, Munich, 1951.  . Alonzo Church. Introduction to Mathematical Logic. Princeton University Press, Princeton, NJ, revised and enlarged edition, 1996.  . Mario Coppo and Mariangiola Dezani-Ciancaglini. An extension of the basic functionality theory for the λ -calculus. Notre Dame Journal of Formal Logic, 21:685–693, 1980.


324


 . Mario Coppo, Mariangiola Dezani-Ciancaglini, and Betti Venneri. Principal type schemes and λ -calculus semantics. In J. R. Hindley and J. P. Seldin, editors, To H. B. Curry, pages 535–560. Academic Press, London, UK, 1980.  . Pierre-Louis Curien and Hugo Herberlin. The duality of computation. In ICFP’00 Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming, pages 1–11. ACM, 2000.  . Haskell B. Curry. Grundlagen der kombinatorischen Logik. American Journal of Mathematics, 52:509–536, 789–834, 1930.  . Haskell B. Curry. Basic verifiability in the combinatory theory of restricted generality. In Y. Bar-Hillel, E. T. J. Poznanski, M. O. Rabin, and A. Robinson, editors, Essays on the Foundations of Mathematics. Dedicated to A. A. Fraenkel on his seventieth anniversary, pages 165–189. Magnes Press, Hebrew University, Jerusalem, 1961.  . Haskell B. Curry. Foundations of Mathematical Logic. McGraw-Hill Book Company, New York, NY, 1963. (Dover, New York, NY, 1977).  . Haskell B. Curry and Robert Feys. Combinatory Logic, vol. 1. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1st edition, 1958.  . Haskell B. Curry, J. Roger Hindley, and Jonathan P. Seldin. Combinatory Logic, vol. 2. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1972.  . Brian A. Davey and Hilary A. Priestley. Introduction to Lattices and Order. Cambridge University Press, Cambridge, UK, 2nd edition, 2002.  . Martin Davis, editor. The Undecidable. Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Dover Publications, Mineola, NY, 2004.  . Martin Davis. Computability and Unsolvability. Dover Publications, New York, NY, enlarged edition, 1982.  . Klaus Denecke and Shelly L. Wismath. Universal Algebra and Applications in Theoretical Computer Science. Chapman & Hall/CRC, Boca Raton, FL, 2002.  . Mariangiola Dezani-Ciancaglini and J. Roger Hindley. Intersection types for combinatory logic. Theoretical Computer Science, 100:303–324, 1992.  . Mariangiola Dezani-Ciancaglini, Elio Giovannetti, and Ugo de’Liguoro. Intersection types, λ -models, and Böhm trees. In Masako Takahashi, Mitsuhiro Okada, and Mariangiola Dezani-Ciancaglini, editors, Theories of Types and Proofs, volume 2 of MSJ Memoirs, pages 45–97. Mathematical Society of Japan, Tokyo, 1998.  . Mariangiola Dezani-Ciancaglini, Robert K. Meyer, and Yoko Motohama. The semantics of entailment omega. Notre Dame Journal of Formal Logic, 43:129–145, 2003.  . J. Michael Dunn. Ternary relational semantics and beyond: programs as data and programs as instructions. Logical Studies, 7:1–20, 2001.  . J. Michael Dunn. A ‘Gentzen system’ for positive relevant implication (abstract). Journal of Symbolic Logic, 38:356–357, 1973.


325

Bibliography

 . J. Michael Dunn. Relevance logic and entailment. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 3, pages 117–229. D. Reidel, Dordrecht, 1st edition, 1986.  . J. Michael Dunn and Gary M. Hardegree. Algebraic Methods in Philosophical Logic, volume 41 of Oxford Logic Guides. Oxford University Press, Oxford, UK, 2001.  . J. Michael Dunn and Robert K. Meyer. Combinators and structurally free logic. Logic Journal of IGPL, 5:505–537, 1997.  . Erwin Engeler. Algebras and combinators. Algebra Universalis, 13:389–392, 1981.  . Andrzej Filinski. Declarative continuations: an investigation of duality in programming language semantics. In D. H. Pitt, D. E. Rydeheard, P. Dybjer, A. M. Pitts, and A. Poigné, editors, Category Theory and Computer Science. Proceedings of the Third Biennial Conference Held in Manchester, number 389 in Lecture Notes in Computer Science, pages 224–249, Springer, Berlin, 1989.  . Gerhard Gentzen. Untersuchungen u¨ ber das logische Schließen. Zeitschrift, 39:176–210, 1935.

Mathematische

 . Gerhard Gentzen. Untersuchungen u¨ ber das logische Schließen, II. Mathematische Zeitschrift, 39:405–431, 1935.  . Gerhard Gentzen. Die Widerspruchsfreiheit der reinen Zahlentheorie. Mathematische Annalen, 112:493–565, 1936.  . Pietro Di Gianantonio, Furio Honsell, and Luigi Liquori. A lambda calculus of objects with self-inflicted extension. In Proceedings of ACM-SIGPLAN OOPSLA-98 International Symposium on Object Oriented Programming, System Languages and Applications, pages 1–13. ACM Press, New York, NY, 1998.  . Gerhard Gierz, Karl H. Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, and Dana S. Scott. Continuous Lattices and Domains, volume 93 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge, UK, 2003.  . Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.  . Lou Goble. Combinator logic. Studia Logica, 76:17–66, 2004. ¨  . Kurt Gödel. Uber formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme I. In Solomon Feferman, editor, Collected Works, volume 1, pages 144–195. Oxford University Press and Clarendon Press, New York, NY, and Oxford, UK, 1986, 1931.  . Kurt Gödel. On undecidable propositions of formal mathematical systems. In Solomon Feferman, editor, Collected Works, volume 1, pages 346–371. Oxford University Press and Clarendon Press, New York, NY, and Oxford, UK, 1986, 1934.  . George Grätzer. Universal Algebra. Springer-Verlag, New York, NY, 2nd edition, 1979.  . Chris Hankin. Lambda Calculi. A Guide for Computer Scientists, volume 3 of Graduate Texts in Computer Science. Clarendon Press, Oxford, UK, 1994.  . David Harel. Algorithmics. The Spirit of Computing. Addison-Wesley Publishing Co.,


326

Bimbó: Combinatory Logic Wokingham, UK, 1987.

 . J. Roger Hindley. Axioms for strong reduction in combinatory logic. Journal of Symbolic Logic, 32:224–236, 1967.  . J. Roger Hindley. An abstract form of the Church-Rosser theorem, I. Journal of Symbolic Logic, 34:545–560, 1969.  . J. Roger Hindley. Lambda-calculus models and extensionality. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik, 26:289–310, 1980.  . J. Roger Hindley. The simple semantics for Coppo–Dezani–Sallé types. In M. DezaniCiancaglini and U. Montanari, editors, International Symposium on Programming, number 137 in Lecture Notes in Computer Science, pages 212–226, Springer, Berlin, 1982.  . J. Roger Hindley. Coppo–Dezani types do not correspond to propositional logic. Theoretical Computer Science, 28:235–236, 1984.  . J. Roger Hindley. Basic Simple Type Theory, volume 42 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 1997.  . J. Roger Hindley and Jonathan P. Seldin. Lambda-Calculus and Combinators, an Introduction. Cambridge University Press, Cambridge, UK, 2008.  . J. Roger Hindley and Jonathan P. Seldin, editors. To H. B. Curry. Academic Press, London, UK, 1980.  . J. Roger Hindley and Jonathan P. Seldin. Introduction to Combinators and λ -Calculus. Cambridge University Press, Cambridge, UK, 1986.  . W. A. Howard. The formulae-as-types notion of construction. In J. R. Hindley and J. P. Seldin, editors, To H. B. Curry, pages 479–490. Academic Press, London, UK, 1980.  . Stephen C. Kleene. Introduction to Metamathematics. Van Nostrand, New York, NY, 1952.  . Jan W. Klop. Combinatory reduction systems, volume 127 of Mathematical Centre Tracts. Mathematisch Centrum, Amsterdam, 1980.  . Jan W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science. Background: Computational Structures, volume 2, pages 1–116. Oxford University Press, New York, NY, 1992.  . C. P. J. Koymans. Models of the lambda calculus. Information and Control, 52:306– 332, 1982.  . Joachim Lambek. The mathematics of sentence structure. American Mathematical Monthly, 65:154–169, 1958.  . Joachim Lambek. On the calculus of syntactic types. In R. Jacobson, editor, Structure of Language and Its Mathematical Aspects, pages 166–178. American Mathematical Society, Providence, RI, 1961.  . Edward J. Lemmon, Carew A. Meredith, David Meredith, Arthur N. Prior, and Ivo


Bibliography

327

Thomas. Calculi of pure strict implication. In J. W. Davis, D. J. Hockney, and W. K. Wilson, editors, Philosophical Logic, pages 215–250. D. Reidel, Dordrecht, 1969.  . Bruce Lercher. Strong reduction and normal form in combinatory logic. Journal of Symbolic Logic, 32:213–223, 1967.  . Bruce Lercher. The decidability of Hindley’s axioms for strong reduction. Journal of Symbolic Logic, 32:237–239, 1967.  . G. Longo. Set-theoretical models of λ -calculus: theories, expansions, isomorphisms. Annals of Pure and Applied Logic, 24:153–188, 1983.  . Guilo Manzonetto and Antonino Salibra. Applying universal algebra to lambda calculus. Journal of Logic and Computation, 20:877–915, 2010.  . Edwin D. Mares. Relevance logic. In Dale Jacquette, editor, A Companion to Philosophical Logic, pages 609–627. Blackwell, Madden, MA, 2002.  . Edwin D. Mares and Robert K. Meyer. Relevant logics. In Lou Goble, editor, The Blackwell Guide to Philosophical Logic, Blackwell Philosophy Guides, pages 280–308. Blackwell Publishers, Oxford, UK, 2001.  . Norman D. Megill and Martin W. Bunder. Weaker D-complete logics. Journal of IGPL, 4:215–225, 1996.  . Elliott Mendelson. Introduction to Mathematical Logic. Chapman & Hall/CRC, Boca Raton, FL, 4th edition, 1997.  . Carew A. Meredith and Arthur N. Prior. Notes on the axiomatics of the propositional calculus. Notre Dame Journal of Formal Logic, 4:171–187, 1963.  . Albert R. Meyer. What is a model of the lambda calculus? Information and Control, 52:87–122, 1982.  . Robert K. Meyer. What entailment can do for type theory. (preprint), 2000.  . Robert K. Meyer. A general Gentzen system for implicational calculi. Relevance Logic Newsletter, 1:189–201, 1976.  . Robert K. Meyer and Martin W. Bunder. Condensed detachment and combinators. Technical Report TR–ARP–8188, Australian National University, Canberra, Australia, 1988.  . Robert K. Meyer and Martin W. Bunder. The D-completeness of T→ . Technical report, Australian National University, Canberra, Australia, 1998.  . Robert K. Meyer and Richard Routley. Algebraic analysis of entailment I. Logique et Analyse, 15:407–428, 1972.  . Robert K. Meyer, Richard Routley, and J. Michael Dunn. Curry’s paradox. Analysis (n.s.), 39:124–128, 1979.  . Robert K. Meyer, Martin W. Bunder, and Lawrence Powers. Implementing the “fool’s model” of combinatory logic. Journal of Automated Reasoning, 7:597–630, 1991.  . Koushik Pal and Robert K. Meyer. Basic relevant theories for combinators at levels I and II. Australasian Journal of Logic, 3:14–32, 2005.


328


 . Benjamin C. Pierce. Types and Programming Languages. MIT Press, Cambridge, MA, 2002.  . A. Piperno. Abstraction problems in combinatory logic: a composite approach. Theoretical Computer Science, 66:27–43, 1989.  . Gordon Plotkin. A semantics for static type inference. Information and Computation, 109:256–299, 1994.  . Garrel Pottinger. A type assignment for the strongly normalizable λ -terms. In J. R. Hindley and J. P. Seldin, editors, To H. B. Curry, pages 561–577. Academic Press, London, UK, 1980.  . Garrel Pottinger. A tour of the multivariate lambda calculus. In J. Michael Dunn and Anil Gupta, editors, Truth or Consequences, pages 209–229. Kluwer Academic Publishers, Amsterdam, 1990.  . W. V. Quine. Predicate functors revisited. Journal of Symbolic Logic, 46:649–652, 1981.  . Willard V. O. Quine. Predicate-functor logic. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, volume 63 of Studies in Logic and the Foundations of Mathematics, pages 309–315, Amsterdam, 1971. North-Holland.  . Willard Van Orman Quine. Selected Logic Papers. Harvard University Press, Cambridge, MA, enlarged edition, 1995.  . György E. Révész. Lambda-Calculus, Combinators and Functional Programming. Cambridge University Press, Cambridge, UK, 1988.  . Hartley Rogers. Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, MA, 1987.  . Simona Ronchi Della Rocca and Betti Venneri. Principal type schemes for an extended type theory. Theoretical Computer Science, 28:151–169, 1984.  . Barry K. Rosen. Tree-manipulating systems and Church-Rosser theorems. Journal of the Association for Computing Machinery, 20:160–187, 1973.  . J. Barkley Rosser. A mathematical logic without variables. I. Annals of Mathematics, 36:127–150, 1935.  . Richard Routley, Robert K. Meyer, Val Plumwood, and Ross T. Brady. Relevant Logics and Their Rivals, volume 1. Ridgeview Publishing Company, Atascadero, CA, 1982.  . Moses Schönfinkel. On the building blocks of mathematical logic. In Jean van Heijenoort, editor, From Frege to Godel. A Source Book in Mathematical Logic, pages 355–366. Harvard University Press, Cambridge, MA, 1967, 1924.  . Dana Scott. Outline of a mathematical theory of computation. Technical report, Oxford University Computing Laboratory Programming Research Group, 1970.  . Dana Scott. A type-theoretical alternative to ISWIM, CUCH, OWHY. Theoretical Computer Science, 121:411–440, 1993.  . Jonathan P. Seldin. The logic of Curry and Church. In Dov M. Gabbay and John


Bibliography

329

Woods, editors, Handbook of the History of Logic, volume 5, pages 819–873. Elsevier, Amsterdam, 2009.  . Natarajan Shankar. Metamathematics, Machines, and Godel’s Proof, volume 38 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 1997.  . Michael Sipser. Introduction to the Theory of Computation. PWS Publishing Company, Boston, MA, 1997.  . Raymond M. Smullyan. Theory of Formal Systems. Princeton University Press, Princeton, NJ, revised edition, 1962.  . Raymond M. Smullyan. To Mock a Mockingbird. And Other Logic Puzzles Including an Amazing Adventure in Combinatory Logic. Alfred A. Knopf, New York, NY, 1985.  . Raymond M. Smullyan. Diagonalization and Self-Reference. Clarendon, Oxford, UK, 1994.  . Morten H. Sørensen and Pawel Urzyczyn. Lectures on the Curry–Howard Isomorphism. Number 149 in Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam, 2006.  . John Staples. Church-Rosser theorems for replacement systems. In J. N. Crossley, editor, Algebra and Logic, volume 450 of Lecture Notes in Mathematics, pages 291– 307. Springer, Berlin, 1975.  . Sören Stenlund. Combinators, λ -Terms and Proof Theory. D. Reidel, Dordrecht, 1972.  . Joseph E. Stoy. Denotational Semantics: The Scott–Strachey Approach to Programming Language Theory. MIT Press, Cambridge, MA, 1977.  . William Tait. Intensional interpretations of functionals of finite type I. Journal of Symbolic Logic, 32:198–212, 1967.  . William Tait. A realizability interpretation of the theory of species. In R. Parikh, editor, Logic Colloquium, volume 453 of Lecture Notes in Mathematics, pages 240–251, Boston, 1975. Springer.  . William W. Tait. Normal form theorem for bar recursive functions of finite type. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, number 63 in Studies in Logic and the Foundations of Mathematics, pages 353–367, Amsterdam, 1971. North-Holland.  . Alfred Tarski. Contributions to the theory of models, III. Indagationes Mathematicae, 17:56–64, 1955.  . Alfred Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285–309, 1955.  . Terese. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 2003.  . Peter Trigg, J. Roger Hindley, and Martin W. Bunder. Combinatory abstraction using B , B0 and friends. Theoretical Computer Science, 135:405–422, 1994.


330


 . Anne S. Troelstra. Lectures on Linear Logic, volume 29 of CSLI Lecture Notes. CSLI Publications, Stanford, CA, 1992.  . Anne S. Troelstra and H. Schwichtenberg. Basic Proof Theory, volume 43 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 2nd edition, 2000.  . Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42:230–265, 1936– 37.  . David A. Turner. Another algorithm for bracket abstraction. Journal of Symbolic Logic, 44:267–270, 1979.  . Hirofumi Yokouchi. Syntax and semantics of type assignment systems. In M. Takahashi, M. Okada, and M. Dezani-Ciancaglini, editors, Theories of Types and Proofs, number 2 in MSJ Memoirs, pages 99–141. Mathematical Society of Japan, Tokyo, 1998.


List of symbols

a Ackermann function, 63 ℵ0 least infinite cardinal, 2 ∀ universal quantifier, 290 =α α -equality, 96 APL A Programming Language, 302 A+ set of nonempty strings over A , 282 A∗ set of strings over A , 282 ~a sequence of ai ’s, 294 B combinator, 6 b dual combinator, 181

B combinatory basis, 16 BT∧ type inference in CL ∧ , 165 BCI→ implicational fragment of BCI logic, 317 =β β -equal, 99 β nf β normal form, 104 βC β -expansion, 99 =βη βη -equality, 101 βηC βη -expansion, 101 b symmetric combinator, 209 B ≡ biconditional, 309 − Boolean complementation, 295 ⊥ bottom element, 288 ¤ necessity, 174 BT+ positive B with top, 172 B0 combinator, 6 b0 dual combinator, 181 b0 symmetric combinator, 204 B [ ]1 Schönfinkel’s bracket abstraction, 115 B→ implicational fragment of the minimal relevance logic B , 317 B2 combinator, 26 bv set of bound variables, 280 C combinator, 6

c dual combinator, 181 C implication in prefix notation, 222 c closure operator, 44 card cardinality of a set, 276 × Cartesian product, 314 b symmetric combinator, 209 C ◦ function composition, 55 ◦ fusion, 180 CL ∧ intersection type assignment system, 269 CL + CL ∧ with union types, 274 CL → simply typed CL, 241 Cn consequence operator, 44 cod codomain, 300 ∧ conjunction, 276 ⊥ contradiction, 315 CPO complete partial order, 156 C∗ combinator, 117 D combinator, 10 D “if zero, then. . . , else. . . ” combina-

tor, 70 D(A → B,C) condensed detachment of C from A → B , 145 ♦ possibility, 174 D∞ model of CL, 164 ∨ disjunction, 276 8 eight-element Boolean algebra, 299 0/ empty set, 281 ε empty string, 282 [x/N]M substitution of N for x in M , 96 EQB1 equational calculus with B1 , 128 η EQB1 EQB1 with ext rule, 130 EQ0B1 equational calculus with B1 , 129


332


EQB2

equational calculus with B2 , 200 =w weak equality, 21 =+ w transitive closure of =w , 21 =wζ extensional weak equality, 22 E→ implicational fragment of entailment, 317 ∃ existential quantifier, 31 exp exponentiation, 290 F functionality constant, 240

F absurdity, 210 f intensional falsity, 210 F relational structure, 175 f application in Pω , 152 fin set of finite elements, 161 fix type constructor, 250 [ polyadic combinator, 201 f −1 inverse image of f , 300 F(n) Fibonacci function, 45 4 a lattice, 159 fv set of free variables, 280 G combinator for Gödel number, 89

glb greatest lower bound, 287 g(M) Gödel number of M , 85 ≥ predicate in inequational logic, 121 H proposition in Il , 226

⊃ horseshoe (conditional), 304 H→ implicational fragment of intuitionistic logic, 317 I combinator, 6 i dual combinator, 181 id

reflexive closure, 285 IH inductive hypothesis, 276 bI symmetric combinator, 206 hi, ji a retraction, 162 Il illative CL system, 223 → implication, 276 In combinator, 17 inf infimum, 287 I interpretation function, 135 ∩ intersection, 281


IQB1 inequational calculus with B1 , 122 η IQB1 IQB1 with ext rule, 127 IQ0B1 inequational calculus with B1 , 125 iA identity map for A , 312 J combinator, 6 j dual combinator, 214 b J symmetric combinator, 209

∨ join operation, 45 K combinator, 6 k dual combinator, 181 b symmetric combinator, 203 K K(n) right-associated term of K ’s, 139 K2 combinator, 10

Λ λ -calculi, 93 λ abstraction operator, 94 λ∗ pseudo- λ in CL, 17 LC1 a structurally free logic, 217 LC∗ structurally free calculi, 210 LC2 a structurally free logic, 219 ← backward implication, 180 ` length function, 278 LJ sequent calculus for intuitionistic logic, 261 LK sequent calculus for classical logic, 304 lub least upper bound, 287 M combinator, 6 m dual combinator, 181

M model, 176 M set of maps in a category, 312 Mc M ’s translation into CL, 118 M ◦ M fused, 218 M ˘ dual of M , 203 ∧ meet operation, 45 mgci most general common instance, 142 Mλ M ’s translation into Λ , 111 MxN substitution of N for x in M , 7 ml left monotonicity rule, 122

333

List of symbols

mr right monotonicity rule, 122 M : τ M typed with τ , 240 M : τ assignment of τ to M , 245 M τ M typed with τ , 240 µ minimization operator, 58 N negation in Il0 , 224

N set of natural numbers, 17 | NAND, 310 |x N EXTAND, 229 N⊥ a CPO, 157 ∼ negation, 276 nf (weak) normal form, 15 n! factorial of n , 58 NJ natural deduction calculus for intuitionistic logic, 241 NK natural deduction calculus for classical logic, 241 † Peirce’s joint denial (N OR), 310 [N/M]P replacement of N by M in P , 21 ‫ נ‬predicate functor, 235 O set of open sets, 299 O set of objects in a category, 312 1 a fair combinator, 112 1βC one-step β -expansion, 99 1C one-step expansion, 21 1ηC one-step η -expansion, 100 OOP object-oriented programming, 304 P implication in Il , 221

P set of propositional variables, 276 PA Peano arithmetic, 290

P (D)Z set of directed subsets of D , 156 Φ combinator, 26 Φn combinator, 26 πnm m th projection, 54 +mod 2 addition modulo 2 , 314 Pω model of CL, 148 pr primitive recursion, 289 pred predecessor function, 290 Ψ combinator, 26 pt(M) principal type of M , 258


P (X)↑Y set of downward-directed cones on X , 177 Q combinator, 6

Q set of rationals, 60 qed quod erat demonstrandum, 18 R general number system, 84 R combinator, 10 R ∪ converse of R , 286 ¹ restriction to a set, 301 R∗ reflexive transitive closure of R , 35 Rn n -ary composition of R , 32 R→ implicational fragment of the logic of relevant implication, 317 S combinator, 6 s dual combinator, 181

s successor function, 54 {SB}n (KI) abbreviated CL-term for n , 87 B separator in axioms, 6 | | | | | | | seven, 81 sg sign function, 290 sg inverted sign function, 290 b symmetric combinator, 203 S snf strong normal form, 24 s0 dual combinator, 181 S∗ combinator, 117 ? undefined, 58 str set of structures, 211 sub substitution rule, 122 ( proper subset relation, 21 · truncated subtraction, 290 − s − subtraction of successor, 60 sup supremum, 287 ↔ symmetric closure, 286 T combinator, 47

T triviality, 210 t intensional truth, 210 τ(B) topology generated by B , 300 TV two-valued logic, 68 b T symmetric combinator, 204 ∼ negation, 80

334


TM Turing machine, 288

> top element, 288 T⊕ set of CL-terms over T , 282 tr transitivity rule, 122 + transitive closure, 286 Bβ β -reduction, 98 Bβη βη -reduction, 100 Bcβ composite β -reduction, 101 B1η one-step η -reduction, 100 B1β one-step β -reduction, 98 B1 one-step reduction, 13 B p1 simultaneous one-step reduction, 33 Bs strong reduction, 23 Bw weak reduction, 14 T→ implicational fragment of ticket entailment, 317 ` symbol in sequent, 212 ² truth in model, 167 TV→ implicational fragment of classical logic, 317 2 two-element Boolean algebra, 299 2⊥ a CPO, 157 U disjointness of predicates, 232 ∪ union, 282 V combinator, 11 ~x a sequence of xi ’s, 67 ∨ disjunction, 80 v interpretation of types, 167 W combinator, 6 w dual combinator, 181

‫ ו‬predicate functor, 235 infimum, 319 ∧ conjunction, 80 wff well-formed formula, 276 b symmetric combinator, 209 W wC weak expansion, 21 wnf weak normal form, 15 V

[x] equivalence class of x , 297 [x] bracket abstraction of x , 17 [x/M]N substitution of M for x in N , 8


Y combinator, 12 y dual combinator, 181 b symmetric combinator, 206 Y

YT Turing’s fixed point combinator in Λ , 109 Z meta-variable for combinator, 2 z meta-variable for dual combinator,

182 Zcon combinator for concatenation, 87 ZB combinator for primitive recursion,

72 Zc composition combinator, 66 Zmad improper combinator, 111 Zµ minimization combinator, 79 Zµ f minimization with f , 78 Z p Z0p or ZB (KI)K , 76 Z0p new predecessor function combina-

tor, 75

Z pr combinator for primitive recursion,

76 Zh3i combinator for ordered triple, 82 Z[0] combinator for zero predicate, 68

z constant zero function, 54 Zexp combinator for exponentiation, 87 ZFC ZF with AC, 42 Zgn second fixed point combinator, 89 b Z meta-variable for symmetric combinator, 203 Z+ set of positive integers, 278

Index A abstract term rewriting systems, 30 accessibility relation, 175 Ackermann, Wilhelm, 63 Ackermann function, 63 algebra combinatorial reduction, 140 combinatory, 136, 169 equational, 298 groupoids, 180 groups, 180 Lindenbaum, 135 of logics, 135 tonoid, 140 trivial, 137, 298 universal, 180, 313 algorithm for bracket abstraction, 18, 115 ff. alphabet, 53, 282 alphabetic variants of mgci, 142 α -equality, 96, 97, 100, 228, 239 α -reduction, 96 antecedent, 304 in sequent, 211 arithmetization of syntax, 46, 85 arity, 2, 6 assertion specialized, 12 associators, 9 dual, 185 atomic terms, 36 atoms in algebras, 299 auxiliary symbols parentheses, 283 axiom schemas, 125, 129, 257 axiomatic approach, 121 axioms, 6, 9–11, 122, 128, 181, 212, 222, 294, 295, 316 and replacement, 9 CL-terms in, 6

for PA, 290 instances of, 7

B basis combinatory, 16 for a topology, 299 β -equality, 99 β -expansion, 99 β normal form, 104 β -redexes, 98 β -reduction, 228 composite, 101 converse of, 99 one-step, 98 βη -equality, 101 βη -expansion, 101 βη normal form, 104 βη -reduction, 100 Bimbó, Katalin, xi, 76, 185 black hole combinator, 39 Bloomington, IN, x, 233 Boolean algebras, 295, 298 bottom, 298, 318 bound occurrences of variables, 293 bound variables, 95 in Λ , 292 bounds, 287 greatest lower, 287, 319 in semilattices, 318 least upper, 287 bracket abstraction, 17 ff., 44, 49, 114 ff., 241 η step in, 20 algorithm for, 18, 23, 25 computing, 116

C cancellators, 10, 31 dual, 185


336


Cantor, Georg, 42 carrier set of an algebra, 298 Catalan numbers, 283 category of monoids, 313 of posets, 313 category theory, 237, 312 and CL, 314 chains ascending, 159 characteristic function of a relation, 88 Church, Alonzo, 30, 47, 65, 93, 231, 264 Church numerals functional character of, 74 Church–Rosser property, 15, 30 ff., 36, 185 ff. and consistency, 198 as a FO sentence, 31, 185 for mild terms, 197 in symmetric CL, 204 lack of, 185 Church–Rosser theorem, 37 equivalent formulations of, 38 for Bs , 44 for Bβ , 101 for Bβη , 103 for Bcβ , 102 for safe terms, 194, 207 second form of, 37 with dual combinators, 185 with dual fixed point combinator, 189 with fixed point constants, 206 with symmetric combinators, 204 ff., 206 Church-style typing, 239 ff. CL and classical logic, 42 CL-terms, 2, 181 and Λ -terms, 118 and wnf’s, 39 as strings, 283 atomic, 3, 36, 279 complex, 3, 36 dual of, 203 finiteness of, 42, 43 formation trees of, 278 illative, 222 in an axiom, 6 in models, 134 interpretation of, 137, 154 left-associated, 3, 203, 277, 285


length of, 278, 281 linear, 253, 255 mild, 196 occurrences of v in trees, 278 over T , 282 parentheses in, 278 partition of, 42 proper, 285 redexes, 12, 182 right-associated, 203, 277 safe, 191 ff., 207 set of, 3 subterms of, 5, 246, 279 proper, 5 tangy, 196 typable, 245, 250, 271 and wnf, 272 typed, 240, 241 unique types of, 244 unambiguous, 181 weakly normalizable, 41 with fixed point property, 48 classical logic, 12, 68, 80, 85, 308, see also nonclassical logics closure operator, 285 ff. fixed point of, 44 codomain, 237, 313, 314 combinatorial completeness, 7, 17, 47, 49, 67, 225 combinatorial reduction algebra, 140, 175 combinators, 2 and complex terms, 12 arity of, 6 as constants, 2, 181 as formulas, 211 as Λ -terms, 106 as sets of types, 245 as subsets of N , 153 associators, 9 axioms for, 6, 9–11 black hole, 39 cancellators, 10, 31 composition, 26, 55 defined, 16, 18 dual, 304 as constants, 181 in redexes, 182 types of, 185 duplicators, 11, 16, 31, 33

Index effect of, 9 encoding proofs, 267 fair, 110 final regular, 126 fixed point, 12, 17, 46, 57, 225, 250 in Λ , 108 for minimization, 77, 83 for ordered pair, 73 for predecessor function, 75, 82 in nf, 77 for primitive recursion, 76 for truth functions, 80 for truth values, 68 for zero predicate, 82 identity, 9, 17 improper, 6 in Λ , 202 kinds of, 9 ff. notation for, 3 paradoxical, 12 permutators, 10, 138 predecessor function, 69 primitive, 12, 13, 15, 16 proper, 6, 11, 18, 111, 184 regular, 9, 11, 126 repeating, 113 rules for, 214 standardized, 23 strong composition, 55 symmetric, 203 typed, 242 undefined, see primitive very short, 185, 186 well-known, 6, 19 in Λ , 107 combinatory algebra, 136, 169, 175 Abelian, 137 associative, 138 finite, 138 bases, 16, 25 ff. equivalence of, 16, 17 ff. in bracket abstraction, 115 logic illative, 221 type-free, 237 untyped, 237 rules, 214 general shape of, 215


337 complement, 298 complete partial orders (CPOs), 156 ff. fixed point theorem for, 44 fixed points in, 161 completeness of CL with =w , 139, 178 of CL with Bw , 177 of CL ∧ , 171 of CL → , 172 complex terms, 36 and combinators, 12 concatenation, 85, 282 combinator for, 87 computable, 86 ff. condensed detachment, 255, 265 admissible, 266 as a partial operation, 145 on sets of wff’s, 145 cones, 175, 319 principal, 320 confluence, 15, 30, see also Church–Rosser property and diamond property conjunction, 290, 305 connectives, 308 NAND, 310 N OR, 310 and quantifiers, 311 conjunction, 165, 240, 268, 276 disjunction, 273, 276 functionally complete set of, 310 implication, 165, 241, 276, 317 consequence operator, 44 consequent in sequent, 211 conservative extension, 172 consistency, 22, 27, 127 in mathematics, 29, 291 of a logic, 137 of CL, 29 with Bw , 42, 43 with =w , 42, 43 with =wζ , 44 with Bs , 43 of equational calculus, 209 of Il , 223 of inequational calculus, 199 of Λ , 105 of LC∗ , 217 constants, 1 ff., 2, 12

338


dual, 181 polyadic, 201 symmetric, 202 context-free grammar, 283, 315 continuity of functions, 158 continuous functions in CPO, 158 in topology, 300 contraction, 305, 317 Curry, Haskell B., 7, 47, 49–51, 210, 231 Curry’s method, 109, 113 Curry’s paradox, 42, 223 ff. Curry–Howard isomorphism, 264, 267 Curry-style typing, 239, 245 ff. Curry’s fixed point combinator, 47, 48 cut rule, 305 admissible, 128 multiple, 306 cut theorem, 216

D D-completeness, 266 De Morgan laws, 311 decidability of inhabitation, 261 of typability, 260 set of wnf’s, 52 denumerably many, 276 derivation in equational calculus, 129 tree, 122 diamond property, 30 directed subsets, 156 disjunction, 290, 305 domain, 162, 172, 237, 313, 314 double negation, 311 downward-directed cones, 176 downward-directed sets, 319 dual combinators, 304 as constants, 181 axioms for, 181 types of, 185 Dunn, J. Michael, x, 174, 210 duplicators, 11, 16, 31, 33 dual, 185

E empty set, 319 empty string, 282


entailment, 12 enumeration, 41 of finite subsets of N , 149 equality extensional weak, 22 weak, 21 equations, 200, 207, 287, 294, 298 equivalence classes, 134, 297 equivalence relation, 21, 127, 297 η -expansion, 100 η -redex, 100 expansion weak, 21 extension conservative, 172 extensional weak equality, 22 ff., 127 axiomatized, 25 consistency of, 44 extensionality in bracket abstraction, 20 in CL, 22 rule, 127, 130, 199, 201, 208

F Fibonacci sequence, 45 filters, 172, 319 principal, 320 finite subsets of N , 151 first-order logic (FOL), 290, 308 fixed point combinator, 17, 46, 225 Curry’s, 47, 48 defined, 46 in Λ , 108 ff. in weak normal form, 47 infinitely many, 48 Turing’s, 47 type of, 250 wnf of, 110 fixed point theorem, 44 for complete lattices, 44 for CPOs, 44 in CL, 46 second, 52, 89 fixed points general, 49 in computer science, 46 in CPOs, 161 in logic, 46

339

Index mutual, 50 number of, 287 of a closure operator, 44 of a function, 44, 287 of CL-terms, 287 the least, 45 with =w , 48 with Bw , 48 FO language, 227, 308 sorted, 226 formal languages, 281 formation trees of CL-terms, 278 of structures, 212, 307 unique, 181, 307 formulas in algebras, 294 in FOL, 308 in inequational calculus, 122 the logical form of, 228 formulas-as-types, 144, 166, 239 foundations of mathematics, 221 free occurrences of variables, 293 free variables, 18, 95 in Λ , 292 function abstraction, 93 function application, 1 ff., 94, 282 Abelian, 137 on subset of N , 152 symmetric, 202 function symbols, 309 functional completeness, 231 functions, 1 Ackermann, 63 arity of, 2 as a rule of computation, 1 closure operator, 44 composition, 55, 56, 66, 238, 313 computable, 53 continuous, 149, 152, 158, 159, 161, 163, 300 domination, 64 enumeration, 149 extensionality of, 100 factorial, 302 homomorphisms, 313 identity, 313 in categories, 312, 314


in CL, 314 in geometry, 179 in mathematics, 1, 5, 14, 29, 44, 312 extensionality of, 20 in primitive recursion, 70 in set theory, 314 injective, 150 intensionality of, 100 invertible, 150 monotone, 158, 159 natural numbers as, 179 on truth values, 310 1–1 correspondence, 149 onto, 314 partial, 59, 314 primitive recursive, 57, 290 projection, 185 recursive, 53 strong composition, 56 surjective, 314 TM-computable, 289 total, 59, 62, 280, 314 unary, 14 fusion of theories, 167

G Gentzen, Gerhard, 304 Gödel, Kurt, 29 Gödel numbers, 46, 52, 85 ff. computable, 89 Gödel’s incompleteness theorem, 42, 46, 85, 90, 291 Gothic letters , 212 greatest lower bound, 319 group (Abelian), 180

H Hilbert, David, 42

I identities, 9, 17, 184 dual, 185 if–then–else, 57, 67 implication self v , 226 inconsistency, 184 index of substructures, 307

340 of subterms, 279 unique, 307 induction, 275 hypothesis of, 276 structural, 277 weak mathematical, 276 inductive definition fixed point and, 45 simultaneous, 50 inequations, 198, 207, 294 infimum, 287, 319 information ordering, 157 positive, 149 inhabitation, 261 interchange, 305 interpretation, 137, 154 as representation, 175 for type assignments, 167 intersection types, 268 intuitionistic logic, 315 inverse image, 300

J join, 298

K Kleene normal form, 63 Knaster–Tarski theorem, 44 Kripke, Saul A., 174

L λ -abstraction in CL, 44 λ -calculus, 65, 239 symmetric, 202 λI -calculus, 94, 264, 293 λK -calculus, 264 Λ -terms, 94 and CL-terms, 118 closed, 95, 97, 106 substitution in, 96 lattices, 287 as posets, 287 bounded, 288 complete, 45, 288 distributive, 173 meet semi v , 318 semi v , 166, 172


Bimbó: Combinatory Logic left-associated structure, 308 terms, 277 leftmost redex, 40 reduction strategy, 40 and normal forms, 41 length of a number, 88 of CL-terms, 278 lexicographic ordering, 300 ff. LISP , 303 logic BCI , 294 classical, 12, 42, 180, 202, 223, 229, 315, 316 functional completeness of, 231 condensed, 266 constructive, 201 D-complete, 266 equational, 294 first-order (FOL), 228, 308 for type inference, 269 implicational, 316 inequational, 295 intuitionistic, 201, 224, 251, 261, 315 minimal relevance, 165 nonclassical, 180, 316, see also nonclassical logics relational models, 174 relevance, ix, 12, 172, 174, 224, 264, 269, 294 structurally free, 210, 306 substructural, 210 two-valued, 68 logical constants in LC∗ , 210 logical form of a formula, 228, 232

M Markov algorithms, 53, 114, 289 meet, 298 meet semilattices, 318 meta-terms, 125, 129 meta-variables, 3, 308 methods in OOP, 304 mgci, 259 minimization, 58 ff., 61

341

Index combinator for, 77, 83 models of computation, 289 monoids, 182, 313 Abelian, 203 monotonicity rule, 123 most general common instance, 142, see also mgci multiple cut rule, 216 mutual fixed points, 50, 51

N name constants, 309 natural deduction systems, 240, 315 natural numbers, 275, 289 as ordered pairs, 150 concreteness of, 156 sets of, 148 nonclassical logics, 165, 170, 174, 224, 251, 261, 264 normal forms, 39 ff. and B1 reduction sequences, 40 β , 104 βη , 104 strong, 24 uniqueness, 104 weak, 15 weak and β , 112 normalization, 237, 268 notation for binary relations, 32 for CL-terms, 3 for combinators, 3, 6 for simultaneous one-step reduction, 33 for substitution, 8 for variables, 3 infix, 4, 180 prefix, 4, 180 suffix, 180 numbers natural, 148 rationals, 60

O object-oriented programming, 304 objects in categories, 312 in mathematics, 182 in OOP languages, 180, 304 occurrences


disjoint, 284 distinct, 33 of formulas, 306 of redexes, 13, 284 of subterms, 8, 279, 293 overlapping, 284 of variables, 8, 18, 19, 95, 279 in Λ , 293 omitting parentheses, 3 ff., 4, 239 one-step expansion, 21 one-step reductions, 13, 30 ff., 35, 183 infinite sequences of, 39 of leftmost redex, 40 sequences of, 30 ff., 32 and normal forms, 40 simultaneous, 33, 34, 194 successive, 34, 194 visualized, 34 open sets in topology, 149, 299 operation antitone, 295 associative, 255 commutative, 255 complementation, 295 existential image, 174 idempotent, 285 in algebras, 294 monotone, 45, 122, 285, 288, 295 partial, 141 residuated, 180 operators λ, 7 N EXTAND, 229 quantifiers, 7, 309 variable binding, 7, 93 order lexicographic, 151 partial complete, 156 ordered pairs, 312 numbers as, 81 of natural numbers, 150

P paradoxical combinator, 12, see fixed point combinator partial order, 296 partitions, 297

342


and equivalence relations, 297 path in a graph, 32 Peano arithmetic (PA), 29, 42, 65, 290 Peirce, Charles S., 310 Peirce’s law, 316 permutators, 10 poset, see partial order positive paradox, 316 possible worlds, 175 power set, 299 predecessor function, 69 combinator for, 82 total, 82 predicate functor, 234 predicates, 308 prefixing, 317 preorder, 166, 296 primitive combinators, 12, 13, 15 primitive recursion, 57, 70 combinator for, 76 primitive recursive functions, 57 principal types, 147, 258 problem of substitution, 234 programming languages, 302 APL , 180 OO , 180 projection functions, 66, 185 proof by cases, 186, 204 cut-free, 217 in axiomatic calculus, 166 in CL ∧ , 270 in CL → , 242 in equational calculus, 129 in H→ , 262 special, 264 in Il , 223 in inequational calculus, 122, 198 in LC∗, 215 in natural deduction systems, 315 in sequent calculus, 305 proper combinators, 11 propositional variables, 276

Q quantifiers, 227 ff. and connectives, 311 existential, 47, 309 universal, 309


R rationals enumerations of, 61 recursive definitions and fixed points, 45 recursive set, 90 redexes, 12 ff., 182 absence of, 33 arguments in, 12, 182, 285 β -, 202 η -, 202 head of, 12, 182 in Λ , 98 left-associated, 203 leftmost, 40 new, 13 occurrences of, 13, 284 overlapping, 182, 186 right-associated, 203 reduct, 17 reductions, 35 α -, 96 β -, 202 one-step, 13, 183 successive, 14 one-step β -, 202 sequences of infinite, 39, 77 strategies for, 14, 38 leftmost, 40, 41 strong, 23 weak, 14 reflexive closure, 285 reflexive symmetric closure, 286 reflexive transitive closure, 286 regular combinators, 11 dual, 185 relation antisymmetric, 6, 295, 296 characteristic function for, 88 composition m times, 32 converse of, 20, 286 diamond property for, 36 equivalence, 21, 22, 127, 131, 297 identity, 285, 296 infix notation for, 32 lexicographic ordering, 300 linear ordering, 300 mathematical, 221

343

Index not antisymmetric, 35 not asymmetric, 35 not symmetric, 35 not transitive, 35 on CL-terms, 12, 14, 21–23, 33, 35, 121 and confluence, 37 one-step expansion, 21 one-step reduction, 13 weak equality, 92 on Λ -terms, 98 orderings, 296 partial order, 295, 318 prefix notation for, 32 preorder, 121, 296 properties of, 296 reflexive, 5, 21, 24, 33, 35, 102, 296 reflexive closure of, 35, 285 reflexive symmetric closure of, 286 reflexive transitive closure of, 286 strictly less than, 88 subset, 314 symmetric, 30, 127, 129, 295, 296 symmetric closure of, 21, 286 symmetric reflexive closure of, 286 total, 22, 200 transitive, 5, 21, 33, 295, 296 transitive closure of, 14, 21, 32, 34, 35, 102, 285 transitive reflexive closure of, 98 relational composition, 32 relations accessibility, 175 preorder, 134 tonicity of, 175 relettering of mgci’s, 142 relevance logics, 12, 294, see also logic, relevance renaming of bound variables, 96, 97, 110, 228, 232 replacement, 8, 135, 183, 212, 217, 307 residuation, 180 retractions continuity of, 163 in CPOs, 162 right-associated terms, 277 and dual combinators, 277 root in a tree, 307 Rosser, Barkley, 30


rules, 122, 128, 222 ext , 127, 130 combinatory, 214 condensed detachment, 265 connective, 212 cut, 305, 306 detachment, 317 elimination, 240, 315 introduction, 240, 315 mix, 216, 306 monotonicity, 243, 258 multiple cut, 216 reiteration, 243 schemas for combinators, 215 single cut, 216 substitution, 242, 256 replaced, 257 Russell’s paradox, 225

S safe terms, 207 sans serif letters, 3, 181 Schönfinkel, Moses, 17, 115, 227, 229 ff. Scott, Dana, 52, 92 Scott topology, 149 Scott’s theorem, 92 second fixed point theorem, 89 semilattices meet, 318 sequent calculus, 127, 180, 210, 304 sequents in LC∗ , 307 set downward-directed, 319 inductively defined, 276 open, 299 poset, 319 power, 297, 299 recursive, 90 subdirected, 156 upward-closed, 319 set theory, 238, 314 comprehension in, 225 similarity type of an algebra, 298 simple types, 238 ff. basic, 241 simultaneous one-step reduction, 33 ff., 194

344


confluence of, 36 notation for, 33 single cut rule, 216 situations, 175 Smullyan, Raymond, x, 63, 86 soundness of CL with =w , 165, 178 of CL with Bw , 176 of CL ∧ , 168 Stone, Marshall, 172 strings, 9, 182, 255, 282 binary, 151, 300 enumeration of, 301 length of, 300 strong normal form, 24 strong reduction, 23, 35, 127 Church–Rosser property for, 44 consistency of, 43 structural connectives , (comma), 210, 305 ; (semicolon), 211, 212 structural rules, 305 structurally free logic and types, 218 structures in sequent calculi, 211 left-associated, 308 over B , 308 sub v , 307 index of, 307 subbasis for a topology, 299 subformula property, 217 substitution, 7 ff., 18, 183, 242, 256 admissible rule, 126, 130 in axiomatic calculus, 123 in CL-terms, 7 in Λ , 96 in wff’s, 142 notation for, 8 problem of, 95, 234 simultaneous, 8, 280 ff. single, 281 subterms, 5 identification of, 8, 279 occurrences of, 8 of CL-terms, 181, 246, 280 of Λ -terms, 99 proper, 5, 280


replacement of, 8, 279 typable, 247 succedent, 304 successor function, 275 suffixing, 317 supremum, 287 symmetric closure, 286 symmetric transitive closure, 286 symmetry the meaning of, 203

T terms closed in Λ , 202 distinct occurrences of, 33 in algebras, 294 in CL, 1, 2 in FOL, 309 in Λ , 94, 97, 293 closed, 95 meta-, 125, 129 redexes, 12 translations of, 111 ff. theorems in LC∗ , 215 in axiomatic calculus, 166 in inequational calculus, 122 of logic, 228 theory Harrop, 173 thinning, 305 tonicity of a relation, 175 of an operation, 295 top, 298 topology, 299 (sub)basis for, 299 basis for, 149 transitive closure, 285 transitive reflexive closure, 286 transitive symmetric closure, 286 transitivity rule, 123 trees for CL-terms, 181, 278 nodes in, 278 proofs as, 215 TRS , see abstract term rewriting systems truth functions, 310

345

Index combinators for, 80 truth set, 91 truth tables, 310 truth values as combinators, 68 Turing, Alan, 47, 49, 50 Turing machine (TM), 53, 289 Turing’s method, 74, 108, 113 Turing’s fixed point combinator, 47 typable CL-terms, 245, 247 ff. type assignment, 167 type constructors, 268 implication, 238 types inferring, 269 intersection, 268 of variables, 259 principal, 258 simple, 238 union, 273

U unification, 259 impossibility of, 258 unique normal forms, 39 upper bound, 156 upward-closed sets, 319

V variable binding, 7, 94, 95, 227, 293 operator, 47 variables, 3, 15, 94 apparent, 19 bound, 280, 309 elimination of, 227 in Λ , 292 renaming of, 96 free, 18, 280, 309 in Λ , 292 in CL, 1 in FOL, 308 in Λ ℵ0 -many, 97 infinitely many, 43 notation for, 3 occurrences of, 8, 19, 95, 198, 200 free, 229, 279 real, 19 roles of, 227


typed, 259 variations, 283 variety, 298, 313 very short combinators, 185 von Neumann–Bernays–Gödel set theory, 226

W weak equality, 21, 29, 92, 128, 134, 183 as congruence, 135 consistency with, 42 in Church–Rosser theorem, 37 weak expansion, 21 weak normal form, 15, 24, 39 and typability, 272 of fixed point combinator, 47 uniqueness of, 39 weak reduction, 14, 29, 35, 183 and consistency, 43 Church–Rosser property for, 37 closure under, 196 converse of, 20 role of v in CL, 14 weakly normalizable terms, 41 well-formed formulas, 210, 276, 308 words, 282

Z Zermelo–Fraenkel set theory (ZF), 42, 226 zero predicate, 68, 82

Combinatory Logic: Pure, Applied and Typed

Combinatory Logic: Pure, Applied and Typed (Discrete Mathematics and Its Applications)

Combinatory Logic: Pure, Applied and Typed (Discrete Mathematics and its Applications)

Elements of combinatory logic

Elements of combinatory logic

Elements of Combinatory Logic

Elements of Combinatory Logic

Algebra: Pure and Applied

Algebra. Pure and applied

CRC Pure and Applied Mathematics)

Semigroups (Pure and Applied Mathematics)

Measure and Integral (Pure and Applied Mathematics)

Categories and Functors (Pure and Applied Mathematics)

The Pure Logic Of Choice

Pure Logic and Other Minor Works

Functional Analysis (Pure and Applied Mathematics)

The Heat Equation (Pure and Applied Mathematics)

Topology (Pure & Applied Mathematics)

Classical Complex Analysis (Pure and Applied Mathematics)

Theory of Distributions (Pure and Applied Mathematics)

Homotopy Theory (Pure and Applied Mathematics 8)

Sobolev Spaces. Pure and applied Mathematics

Noncommutative Distributions (Pure and Applied Mathematics)

The Smith Conjecture (Pure and Applied Mathematics)

Dictionary of Pure and Applied Physics

Practical Quantum Electrodynamics (Pure and Applied Physics)

Linear Algebra. Pure and Applied Mathematics

Combinatory analysis

Dynamic Programming (Pure and Applied Mathematics)

The relation between pure and applied mathematics

Complex Analysis (Pure and Applied Mathematics)

Combinatory Logic: Pure, Applied and Typed