9E The condensed structure of a type 1559E4 Definition (S-components) Iff a node on the condensed tree of T is labelled witha type a and a position p we call the triple (a, p, T) an s-component of -r. (Thus ans-component is a particular occurrence of an s-subtype.)9E4.1 Notation S-components are distinguished from s-subtypes by underliningtheir names. The phrases "p contains g", "p properly contains a" etc. are definedhere as in 9A5.9E5 Definition (Premises, tail) If p is a composite s-component of a type T andp =_(m >_ 1), the s-components pl,..., p,, are called the premises ofp and a is called the conclusion or tail-component of p, or justTail(p).9E5.1 Lemma Two distinct s-components of a type T cannot have the same tailcomponent.Proof Induction on itt, using the fact that if T = Tl--*... the only s-components containing a are r and a and a is not the tail of itself because atomsdo not have tails (by 9E5).9E5.2 Warning The above lemma does not say that the tails of two distinct s-components p and g cannot be occurrences of the same atom. That is, usingthe =-notation of (iv), the lemma forbids Tail(p) = Tail(g) but does not forbidTail(p) = Tail(g).9E6 Definition (Subpremises, subtails) An s-component of T is called a subpremiseor subtail of T according as it is a premise or tail of another s-component of T. Thesets of all subpremises and all subtails of T will be called, respectively,Subpremises(T),Subtails(r).9E6.1 Example The type T - (a--+b--+c)--+(a-+b)-+a-+c in Fig. 9E2.1a has six subpremises,namely all three a's andIt has three subtails, namely3, T), (a-*b, 2, T), (b, 31, T).(b, 2*, T), (c, 3*, T), (c, *, T)9E6.2 Notes (i) A proper s-component g = (a, p, T) (p * 0) is a subpremise iff p is apremise position and a subtail iff p is a tail position.(ii) Each s-component of T is either a subtail, an atomic subpremise, a compositesubpremise, or T itself, and cannot be more than one of these.(iii) If T is composite, its leftmost atom-occurrence is a subpremise and itsrightmost is a subtail.(iv) An atom has no subpremises or subtails.
156 9 Technical details9E6.3 Lemma If T is composite, then(i) #(Subtails(T))no. of composite s-components of r,(ii)1 + no. of composite sub premises ofT,(iii)ITI - no. of atomic sub premises of T,(iv)ITI -(v) #(Subpremises(T))ITI -(vi) no. of s-components of T < 21TI-1.Proof For (i): use 9E5.1. For (ii): each composite s-component is either a subpremiseor r itself. For (iii): use 9E6.2(ii). For (iv): use 9E6.2(iii). For (v): subtract (iii) from(ii). For (vi): use 9E6.2(ii), adding (iv) to (v) and adding 1 for T itself.9E7 Definition Order(T), the order of r, is 1 + the length of the longest position onthe condensed tree of T. In detail: Order(e) = 1 for atoms e, and for composite typesOrder9E7.1 Example Order((a->b-+c)-*(a-*b)--*a-*c) = 3.1+Max {Order(Ti),...,Order(T)}.9E8 Definition (Positive and negative s-components) An s-component a of r is calledpositive or negative according as the <strong>number</strong> of non-asterisk symbols in its positionis even or odd. If v is positive we say a occurs positively in T, otherwise a occursnegatively in T.9E8.1 Example If r - (a-+b-.c)->(a->b)-*a-*c, see Fig. 9E2.1a, its positive s-components are(r, 0, r), (c, *, r), (a, 32, r), (b, 31, r), (a, 21, r).9E8.2 Notes (i) It is straightforward to show that an s-component a is positive ornegative according as the corresponding component in the more usual sense (9D3)is positive or negative.(ii) A subpremise of T is positive if its position has even length. (Because theposition of a subpremise contains no *'s.)The following set plays a role in Chapter 8.9E9 Definition (NSS(T)) (cf. Ben-Yelles 1979 Def. 3.36.) If r is composite, NSS(T)is the set of all finite sequences(n >: 1) such that T contains a positivecomposite s-component with formfor some atom a. Each member of NSS (T) is called a negative subpremise-sequence(because it is a sequence of terms that have occurrences as negative subpremises inT).The set of all the members of the sequences in NSS(T) will be calledU NSS (r).
- 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 148 and 149: 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 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