- Page 1: Kind TheoryThesis byJoseph R. Kinir
- Page 6 and 7: viAbstractMy contribution, describe
- Page 8 and 9: viiiContentsAcknowledgementsAbstrac
- Page 10 and 11: x2.6 Syntax of Kind Theory . . . .
- Page 12 and 13: xii3 Theorems of Kind Theory 763.0.
- Page 14 and 15: xiv5.3.6 Universal Properties . . .
- Page 16 and 17: xvi8 Conclusion 1958.1 Functions an
- Page 18 and 19: xviiiList of Figures2.1 Pictorial O
- Page 20 and 21: xxList of Tables2.1 A Detailed Summ
- Page 22 and 23: xxiiThe Extension of an universal I
- Page 24 and 25: 2of mathematics have been developed
- Page 26 and 27: 4Within these disciplines, objectiv
- Page 28 and 29: 6Unfortunately, none of this work,
- Page 30 and 31: 81.3.3.2 Model TheoryOn a similar n
- Page 32 and 33: 101.3.4 Knowledge RepresentationWor
- Page 34 and 35: 121.3.5.4 Asset RepositoriesNearly
- Page 36 and 37: 14of a mega-literate programming fo
- Page 38 and 39: 16started down this path, but with
- Page 40 and 41: 181.4.4 ToolsA number of tools have
- Page 42 and 43: 20that is important to kind theory,
- Page 44 and 45: 22Chapter 3 presents some basic the
- Page 46 and 47: 24An agent is a person or system th
- Page 48 and 49: 26instances are mapped to the corre
- Page 50 and 51: 28operator can be denoted, for exam
- Page 52 and 53:
30A final example of classification
- Page 54 and 55:
32undefinition, renaming, etc. Only
- Page 56 and 57:
342.4.4 Statements about KindsSeman
- Page 58 and 59:
36any inferences impossible [178, 2
- Page 60 and 61:
38Table 2.2: Claims and BeliefsΓ
- Page 62 and 63:
40(Claim Null-Evidence*) applies to
- Page 64 and 65:
2.8 Operators42Core operators like
- Page 66 and 67:
44Operational Semantics. Operationa
- Page 68 and 69:
46those concepts that can be though
- Page 70 and 71:
48• Type-equivalent optimization
- Page 72 and 73:
50necessary. These diagrams are use
- Page 74 and 75:
52Table 2.5: Inclusion Rules(Part-o
- Page 76 and 77:
54Table 2.10: General Inference Rul
- Page 78 and 79:
562.9.10.2 The Interplay between Co
- Page 80 and 81:
58kind A → B × C matches with C
- Page 82 and 83:
60The partial interpretation ∆
- Page 84 and 85:
62Γ Γ ′< ✲u✻✛
- Page 86 and 87:
64• derivable from a set of earli
- Page 88 and 89:
66The evidence necessary to state a
- Page 90 and 91:
68situation as above, or (c) agent
- Page 92 and 93:
70between the structures of the sta
- Page 94 and 95:
72A set of values must be chosen be
- Page 96 and 97:
74exist, typically in the form of a
- Page 98 and 99:
76Chapter 3Theorems of Kind TheoryI
- Page 100 and 101:
78basic theorems to review (5 diago
- Page 102 and 103:
80Proof.[U] = V(premise)V W(premis
- Page 104 and 105:
82Figure 3.8: The Proof Diagram for
- Page 106 and 107:
84Full interpretation, on the other
- Page 108 and 109:
86Theorem 14 (FullInterp Real)Γ
- Page 110 and 111:
88Figure 3.19: General Case of Full
- Page 112 and 113:
90Consider compositional forms invo
- Page 114 and 115:
92correspondingly decreases its app
- Page 116 and 117:
94detail here. What is striking to
- Page 118 and 119:
96Chapter 4An Operational ModelWhil
- Page 120 and 121:
A-8 APPENDIXIsolated Communications
- Page 122 and 123:
4.3 Specification Overview100T Γ i
- Page 124 and 125:
4.4 Formal Specification102This sec
- Page 126 and 127:
104Table 4.5: Subtyping rules for T
- Page 128 and 129:
106Table 4.7: Rules for basic type
- Page 130 and 131:
108Table 4.10: Rules for basic type
- Page 132 and 133:
110Table 4.13: Union types(Type Uni
- Page 134 and 135:
1124.4.3 Operational Definition of
- Page 136 and 137:
114The judgment is-subtype-of?(Γ T
- Page 138 and 139:
116Definition 40 (is-part-of? for I
- Page 140 and 141:
118This completes the mapping of te
- Page 142 and 143:
120definition of T Γ is space-effi
- Page 144 and 145:
122and compared.5.1 Core NotionsAll
- Page 146 and 147:
1245.1.1 Basic Functional KindFunct
- Page 148 and 149:
126structure.FullInterpretation < p
- Page 150 and 151:
128First, define some elements of m
- Page 152 and 153:
130Definition 62 (BooleanTruthValue
- Page 154 and 155:
132The relationship between Boolean
- Page 156 and 157:
134ments associated with this speci
- Page 158 and 159:
1365.3.2 Type and Instance Realizat
- Page 160 and 161:
138each named field is realized by
- Page 162 and 163:
140Chapter 6Software Engineering Ex
- Page 164 and 165:
142the kind Operation. Each operati
- Page 166 and 167:
144variableResult.value := 0 .eq in
- Page 168 and 169:
146...endiFact 2 (Behavioral Equiva
- Page 170 and 171:
148F.summary newline" * @pre " F.pr
- Page 172 and 173:
150kind State is Multiset .-- Funda
- Page 174 and 175:
152• it is a piece of Intellectua
- Page 176 and 177:
154independent constructs as define
- Page 178 and 179:
156instance idebug.Debug.isOff is-k
- Page 180 and 181:
158In 1998 at OOPSLA, several membe
- Page 182 and 183:
160A user can add truth structures
- Page 184 and 185:
1626.4.5.1 Current InterfaceThe cur
- Page 186 and 187:
1646.5.1 A Usage ExampleFigure 6.3:
- Page 188 and 189:
166realize those kind. Thus, each o
- Page 190 and 191:
168Conflict identification and reso
- Page 192 and 193:
170Chapter 7Semantic Properties, Co
- Page 194 and 195:
172the attention of augmented versi
- Page 196 and 197:
174are represented via kind theory
- Page 198 and 199:
176Augmentation, on the other hand,
- Page 200 and 201:
178A set of conventions have been d
- Page 202 and 203:
180Work has begun on such environme
- Page 204 and 205:
182Limitations and Opportunities. B
- Page 206 and 207:
184Examples of Use. BON and EBON ha
- Page 208 and 209:
1867.2.1 BackgroundModern software
- Page 210 and 211:
188The method’s signature is inte
- Page 212 and 213:
190Definition 75 (Semantic Compatib
- Page 214 and 215:
192text (if this is permissible in
- Page 216 and 217:
194The next step is to lift these e
- Page 218 and 219:
196ing out a space of possibilities
- Page 220 and 221:
198Eiffel’s covariant type system
- Page 222 and 223:
200introduction of an interpretatio
- Page 224 and 225:
2028.2.2 Knowledgeable Environments
- Page 226 and 227:
2048.2.4 Specification of Component
- Page 228 and 229:
206These ideas are by no means comp
- Page 230 and 231:
208Appendix AThe Algebra A T in Ful
- Page 232 and 233:
210eq E in mt = false .eq E in (E
- Page 234 and 235:
212sorts Boolean String Integer Flo
- Page 236 and 237:
214* (sort Pair[VSlot, VValue] to V
- Page 238 and 239:
216eq as-set(nil) = mt .eq as-set(G
- Page 240 and 241:
218var SS : SlotSet . var Gt : Type
- Page 242 and 243:
220op valid? : TypeContext TypeCont
- Page 244 and 245:
222eq is-part-of?(Gt # Gi, G0, G1)
- Page 246 and 247:
224*** Sets of such.(red strings-on
- Page 248 and 249:
226op TE : -> Type .eq TE = < N ; T
- Page 250 and 251:
228eq t2 = < $ ’New ; $ ’Univer
- Page 252 and 253:
230(red validparents?(mt, -0-, mt)
- Page 254 and 255:
232(red valid?(T0, t40) == false .)
- Page 256 and 257:
234*** is?(red is?(Basic, $ ’Univ
- Page 258 and 259:
236*** type-of?(red type-of?(Basic
- Page 260 and 261:
238< $ ’Float ; $ ’weight > >)
- Page 262 and 263:
240eq B2 = [ $ ’B2 ; $ ’B ;< <
- Page 264 and 265:
242Table B.2: Pending Work Properti
- Page 266 and 267:
244Table B.5: Usage Information Pro
- Page 268 and 269:
246Appendix CThe Extended BON Gramm
- Page 270 and 271:
248[ indexing Index_list ][ propert
- Page 272 and 273:
250Creation_entries = { Creation_en
- Page 274 and 275:
252Feature_specifications = { Featu
- Page 276 and 277:
254Binary_expression = Expression I
- Page 278 and 279:
256Email_address = Manifest_stringB
- Page 280 and 281:
258Table C.1: BON Reserved Wordsact
- Page 282 and 283:
260on Software Reuse, pages 114-123
- Page 284 and 285:
262[39] P. Besnard and A. Hunter. H
- Page 286 and 287:
264[64] P. Chen, R. Hennicker, and
- Page 288 and 289:
266[89] Microsoft Corp. The .NET co
- Page 290 and 291:
268[117] S. Ferré and O. Ridoux. A
- Page 292 and 293:
270[143] R. Godin, H. Mili, G. W. M
- Page 294 and 295:
272[167] Joseph A. Goguen and David
- Page 296 and 297:
274[193] IEEE P1600.1 - standard up
- Page 298 and 299:
276[222] Gerhard Lakemeyer and Bern
- Page 300 and 301:
278[249] J. Lukasiewicz. Polish Log
- Page 302 and 303:
280[277] David E. Monarchi and Gret
- Page 304 and 305:
282[304] Sukesh Patel, William Chu,
- Page 306 and 307:
284[332] Y. Shinkawa and M. J. Mats
- Page 308 and 309:
286[363] Anca Vermesan and Frans Co