8F Stretching, shrinking and completeness 135Define M* to be the result of replacing Bp+r in M by a copy of B,, (after changingbound variables in this copy to avoid clashes). Then M* has an argument-branchwith length d + r. (Its members areNo,...,Np+rlNpp+1,...,N°,where for i = 0,..., p + r each N` has the same position in M* as Ni had in M, andfor j = p + 1, ... , d we have N = Np) Hence by 8E4.1,Depth(M*) >d + r >d + 1.To complete the proof of (i) it only remains to show that M* is a genuine typedterm. This will be done by applying Lemma 5B2.1(ii) on replacement in typed terms.First, for i = 0, ... , d let F be the context that assigns to the initial abstractors ofNi the types they have in M. Since M has no bound-variable clashes the variablesin I'o,...,rd are all distinct, so(4) 1'o U ... U I'd is consistent.Also every variable free in B; is bound in one of No_., Ni because M is closed andBi is in Ni. Hence, by the definitions of typed term (5A1) and Con (5A4),(5) B1 E TT(FO U ... U ri), Con(B;) fo U ... U Fi.To apply 5B2.1(ii) it is enough to show that the set(6) Con(Bp) U Con(M) U FO U ... U Fp+ris consistent. (The abstractors in M whose scopes contain Bp+r are exactly the initialabstractors of N0....,Np+r.) But M is closed, so Con(M) = 0. And by (5),Thus (6) is consistent by (4).Con(Bp) s roU...Ufp s foU...UFp+r.8F3 Detailed Shrinking Lemma>- D(T) then(i) it has a memberM*Twith(cf. 8D3.) If Long(T) has a member Mt with depth(ii) it has a member NT withDepth(Mt) - IITII - 2 because T is composite since atomic types have no inhabitants.By 8E4.1, M has at least one argument-branch with length d; to reduce the depthof M we must shrink all these branches. Consider any such branch; just as in theproof of the stretching lemma 8F2 it has form(1) (No,...,Nd),
136 8 Counting a type's inhabitantswhere N M and Ni+1 is an argument of Ni for i = 0, ... , d - 1. And(2) Ni = )xi,1 ... xi,m, *yiPi,I ... Pi,,,, (mi, ni > 0)for 0 < i < d - 1. Let the type of Ni be(3) pi = Pi,l --+ --+Pi,mr--+aiThen since Ni is long, the types of Xi,1,xi,2,... are exactly pi,1,pi,2.... ; that is, usingthe "IAT" notation introduced in 8E6,IAT(Ni) =Just as in the proof of 8F2 let B be the body of N. for i = 0,...,d. Then the typeof Bi is the tail of the type of NO namely ai.Define a sequence of integers do,d1,... thus: do = 0 and d3+l is the least i > djsuch that IAT(Ni) differs from all of(4) IAT(Ndo), IAT(Nd,),..., IAT(Nd1).Let n be the greatest integer such that d is defined. The branch (1) has only dmembers after No, so n< d and d < d. Then(5) 0=do
- Page 2 and 3:
BASIC SIMPLE TYPE THEORY
- Page 4 and 5:
BASIC SIMPLE TYPE THEORYJ. Roger Hi
- Page 6:
To Carol
- Page 9 and 10:
VlllContents7C The converse PT proo
- Page 11 and 12:
xIntroductionhave proved themselves
- Page 14 and 15:
1The type-free A-calculusThe R-calc
- Page 16 and 17:
1A A-terms and their structure 31A6
- Page 18 and 19:
I B #-reduction and #-normal forms
- Page 20 and 21:
IC rl- and firs-reductions 7Proof S
- Page 22 and 23:
IC q- and iq-reductions93TFig. lC7a
- Page 24 and 25:
1D Restricted A-terms 11(ii) The BC
- Page 26 and 27:
2A The system TAA 132A2 Definition
- Page 28 and 29:
2A The system TA, 152A5.1 Notation
- Page 30 and 31:
2A The system TA2172A8.3 Example Le
- Page 32 and 33:
Proof Trivial from 2A9.2A The syste
- Page 34 and 35:
2B The subject-construction theorem
- Page 36 and 37:
2B The subject-construction theorem
- Page 38 and 39:
2C Subject reduction and expansion2
- Page 40 and 41:
2D The typable terms 27However, Cha
- Page 42 and 43:
2D The typable terms 292D8.1 Note T
- Page 44 and 45:
3A Principal types and their histor
- Page 46 and 47:
3A Principal types and their histor
- Page 48 and 49:
3B Type-substitutions 353B1 Notatio
- Page 50 and 51:
3B Type-substitutions 37Then r U (s
- Page 52 and 53:
3C Motivating the PT algorithm 39(i
- Page 54 and 55:
3D Unification 41this pair was show
- Page 56 and 57:
3D Unification 43If pk * Tk and the
- Page 58 and 59:
A' _ §(Ap) for some s; hence in pa
- Page 60 and 61:
3E The PT algorithm 47Let r - rl U
- Page 62 and 63:
3E The PT algorithm 49for some subs
- Page 64 and 65:
3E The PT algorithm 513E4 Further R
- Page 66 and 67:
4A The equality rule 53The name "TA
- Page 68 and 69:
(M).4A The equality rule 554A3 Weak
- Page 70 and 71:
4B Semantics and completeness 574A1
- Page 72 and 73:
4B Semantics and completeness 59413
- Page 74 and 75:
4B Semantics and completeness 61Pro
- Page 76 and 77:
5A version using typed termsIn Chap
- Page 78 and 79:
5A Typed terms 655A1.5 Warning If M
- Page 80 and 81:
5B Reducing typed terms(ii) if MT E
- Page 82 and 83:
5B Reducing typed terms 695B5.1 Not
- Page 84 and 85:
5C Normalization theorems 71of rede
- Page 86 and 87:
SC Normalization theorems 73in leng
- Page 88 and 89:
6A Intuitionist implicational logic
- Page 90 and 91:
6A Intuitionist implicational logic
- Page 92 and 93:
6B The Curry-Howard isomorphism 79T
- Page 94 and 95:
6B The Curry-Howard isomorphism 816
- Page 96 and 97:
6B The Curry-Howard isomorphism 83t
- Page 98 and 99: 6C Some weaker logics 85for some cl
- Page 100 and 101: 6C Some weaker logics 87logic in 6A
- Page 102 and 103: 6D Axiom-based versions 89Deduction
- Page 104 and 105: 6D Axiom-based versions 916D6.1 Not
- Page 106 and 107: The converse principal-type algorit
- Page 108 and 109: 7B Identifications 957A3 Converse P
- Page 110 and 111: 7C The converse PT proofNext, suppo
- Page 112 and 113: Since (a-+b)* __ a--+b, we must pro
- Page 114 and 115: 7C The converse PT proof 101Conside
- Page 116 and 117: instance, construct an m.g.c.i. V -
- Page 118 and 119: AD-7D Condensed detachment 1057D6 M
- Page 120 and 121: 7D Condensed detachment 107Proof By
- Page 122 and 123: 8A Inhabitants 109A Pq-normal inhab
- Page 124 and 125: 8A Inhabitants 1118A7.1 Example Let
- Page 126 and 127: 8A Inhabitants113Fig. 8A12a.8A11.2
- Page 128 and 129: 8B Examples of the search strategy
- Page 130 and 131: 8B Examples of the search strategy
- Page 132 and 133: 8C The search algorithm 119Long(s)
- Page 134 and 135: 8C The search algorithm 121Note. Th
- Page 136 and 137: 8C The search algorithm1238C6.1 Exa
- Page 138 and 139: 8D The Counting algorithm 1258D3.1
- Page 140 and 141: 8E The structure of a nf-scheme 127
- Page 142 and 143: 8E The structure of a nf-scheme129x
- Page 144 and 145: 8E The structure of a nf-scheme131T
- Page 146 and 147: 8F Stretching, shrinking and comple
- Page 150 and 151: 8F Stretching, shrinking and comple
- Page 152 and 153: 8F Stretching, shrinking and comple
- Page 154 and 155: 9A The structure of a term 1419A2 D
- Page 156 and 157: 9A The structure of a term(ii) if r
- Page 158 and 159: 9B Residuals 145Proof-note Two case
- Page 160 and 161: 9B Residuals 1479134.1 Lemma Every
- Page 162 and 163: 9C The structure of a TAR-deduction
- Page 164 and 165: 9D The structure of a type 151below
- Page 166 and 167: 9E The condensed structure of a typ
- Page 168 and 169: 9E The condensed structure of a typ
- Page 170 and 171: 9F Imitating combinatory logic in A
- Page 172: [x].N*Before constructing9F Imitati
- Page 175 and 176: 162 Answers to starred exerciseswit
- Page 177 and 178: 164 Answers to starred exercisesIf
- Page 179 and 180: 166 Answers to starred exercisesTo
- Page 182 and 183: BibliographyReferences to unpublish
- Page 184 and 185: Bibliography 171DOSEN, K. [1992a] M
- Page 186 and 187: Bibliography 173KALMAN, J. A. [1983
- Page 188 and 189: Bibliography 175SCEDROV, A. [1990]
- Page 190 and 191: Table of principal typesThis table
- Page 192 and 193: IndexA-logics (see axiom-based logi
- Page 194 and 195: Index 181D-incompleteness of BCI, B
- Page 196 and 197: Index183PT algorithm, converse (see
- Page 198 and 199:
Index185#-contraction 4of typed ter