Ph.D. Dissertation

More documents

Recommendations

Info

254Binary_expression = Expression Infix_operator ExpressionSet_expression = Enumerated_set | Call | Operator_expressionEnumerated_set = "{" Enumeration_list "}"Enumeration_list = { Enumeration_element "," ...} +Enumeration_element = Expression | IntervalInterval =Integer_interval | Character_intervalInteger_interval = Integer_constant ".." Integer_constantCharacter_interval = Character_constant ".." Character_constantConstant =Manifest_constant | Current | VoidManifest_constant = Boolean_constant | Character_constant |Integer_constant | Real_constant |Manifest_stringSign = "+" | "-"Boolean_constant = true | falseCharacter_constant = "’" Character "’"Integer_constant = [ Sign ] IntegerReal_constant = [ Sign ] RealManifest_textblock = String_begin String String_endString = { Simple_string New_line ...} +Manifest_string = String_begin Simple_string String_endC.3.6Dynamic DiagramsDynamic_diagram = dynamic_diagram [ Extended_id ] [ Comment ]component Dynamic_block endDynamic_block = { Dynamic_component ...}Dynamic_component = Scenario_description |Object_group |Object_stack |Object |Message_relationScenario_description = scenario Scenario_name [ Comment ]action Labeled_actions endLabeled_actions = { Labeled_action ...} +
255Labeled_action =Action_label =Action_description =Scenario_name =Action_label Action_descriptionManifest_stringManifest_textblockManifest_stringObject_group = [ nameless ] object_group Group_name [ Comment ][ Group_components ]Group_components = component Dynamic_block endObject_stack = object_stack Object_name [ Comment ]Object = object Object_name [ Comment ]Message_relation = Caller calls Receiver [ Message_label ]Caller =Dynamic_refReceiver =Dynamic_refDynamic_ref ={ Group_prefix ...} Dynamic_component_nameGroup_prefix = Group_name "."Dynamic_component_name = Object_name | Group_nameObject_name = Class_name [ "." Extended_id ]Group_name =Extended_idMessage_label =Manifest_stringC.3.7Notational TuningNotational_tuning = Change_string_marks |Change_concatenator |Change_prefixChange_string_marks = string_marks Manifest_string Manifest_stringChange_concatenator = concatenator Manifest_stringChange_prefix =keyword_prefix Manifest_stringC.3.8Semantic PropertiesSemantic_properties = { Semantic_property New_line ...} +Semantic_property =SP_all_clauseAuthor_clause = author ":" Author_fullname [ Email_address ]Author_fullname = Manifest_string
Page 1:
Kind TheoryThesis byJoseph R. Kinir
Page 4:
ivAcknowledgementsI am grateful to
Page 7 and 8:
viiNotationNearly all mathematical
Page 9 and 10:
ix1.3.7.1 Concepts to Drive New Kin
Page 11 and 12:
xi2.9.12 Functional Kind Matching .
Page 13 and 14:
xiii4.4.2.8 Examples . . . . . . .
Page 15 and 16:
xv7 Semantic Properties, Components
Page 17 and 18:
xviiC The Extended BON Grammar 246C
Page 19 and 20:
xix3.14 The Proof Diagram for (Part
Page 21 and 22:
xxiB.3 Formal Specification Propert
Page 23 and 24:
1Chapter 1Introduction1.1 Motivatio
Page 25 and 26:
3sharing [263]. Classification is a
Page 27 and 28:
1.3 Related Work5Work from several
Page 29 and 30:
71.3.2.1 Conceptual SpacesGärdenfo
Page 31 and 32:
9The literature of paraconsistent l
Page 33 and 34:
111.3.5.2 Reuse TheoriesThe work of
Page 35 and 36:
13matching. Other similar environme
Page 37 and 38:
151.3.7.2 Semantic CompositionStrai
Page 39 and 40:
17As summarized in Section 1.2.1, t
Page 41 and 42:
19starting set. The theory and its
Page 43 and 44:
21reptitious manner, is one of the
Page 45 and 46:
23Chapter 2Kind TheoryThe structure
Page 47 and 48:
25functional kind called computatio
Page 49 and 50:
27system, specified again, by the c
Page 51 and 52:
29Predicates, denoted with the symb
Page 53 and 54:
31Equivalence is a context-sensitiv
Page 55 and 56:
332.4.2.6 InterpretationInterpretat
Page 57 and 58:
35development process, are also cla
Page 59 and 60:
37Table 2.1: A Detailed Summary of
Page 61 and 62:
39• The syntactically asymmetric
Page 63 and 64:
412.7.3 A Formal Definition of Stru
Page 65 and 66:
43Multiple Inheritance in Programmi
Page 67 and 68:
45the construct to which it is appl
Page 69 and 70:
472.8.3.2 Canonical FormsCanonical
Page 71 and 72:
492.8.5 CompositionA compositional
Page 73 and 74:
51164, 166, 261, 322], predicate ca
Page 75 and 76:
532.9.6 Interpretation RulesTable 2
Page 77 and 78:
55Figure 2.5: Basic Compositionalit
Page 79 and 80:
57Figure 2.7: Unknown Functional Co
Page 81 and 82:
592.10.1 Instance-Related Operation
Page 83 and 84:
61Γ Γ ′i✻• ✲ i ◦ j❄
Page 85 and 86:
63In this case all references to a
Page 87 and 88:
652.12.1 The Nature of EvidenceEvid
Page 89 and 90:
67initial context contains definiti
Page 91 and 92:
69Discussion on the second issue is
Page 93 and 94:
712.12.3.3 Trust GraphsA trust grap
Page 95 and 96:
73For any wff F, if Γ F holds, th
Page 97 and 98:
75Other theories were not known to
Page 99 and 100:
77substructure of A, then g preserv
Page 101 and 102:
79Figure 3.2: The Proof Diagram for
Page 103 and 104:
81□Figure 3.6: The Proof Diagram
Page 105 and 106:
83□Figure 3.10: The Proof Diagram
Page 107 and 108:
85Proof.U ⊂ p VV ⊂ p WV ⊃ UW
Page 109 and 110:
87Figure 3.17: The Theorem Diagram
Page 111 and 112:
893.3.3 Under CanonicalizationRecal
Page 113 and 114:
91Figure 3.26: Realization with Inc
Page 115 and 116:
93Theorem 18 (Coproducts under Inhe
Page 117 and 118:
95This theorem says that if a compo
Page 119 and 120:
97scription. A part of this parsing
Page 121 and 122:
The basic constructs used are the f
Page 123 and 124:
101Call the set of grounds Basic:Ba
Page 125 and 126:
103Table 4.2: Basic judgments on T
Page 127 and 128:
105in a slot of a type definition N
Page 129 and 130:
107Table 4.9: Rules for basic type
Page 131 and 132:
109Table 4.11: Rules for basic type
Page 133 and 134:
111Table 4.14: Introduction rules f
Page 135 and 136:
113on the left of a → are the dom
Page 137 and 138:
115Definition 36 (slots-of?)⎧erro
Page 139 and 140:
117• Likewise, basic instances of
Page 141 and 142:
119• New sorts TypeContext and In
Page 143 and 144:
121Chapter 5A Reflective ModelIn th
Page 145 and 146:
123Definition 45 (Instance) The kin
Page 147 and 148:
125notion of an interpretation is h
Page 149 and 150:
127defines the functional kind (at
Page 151 and 152:
1295.2.2 ParameterizationA core con
Page 153 and 154:
131a set theoretic operation on , o
Page 155 and 156:
133The specific realization is spec
Page 157 and 158:
135subkinding relationship exists.
Page 159 and 160:
1375.3.4 Inter-theory Interpretatio
Page 161 and 162:
1395.3.6 Universal PropertiesThe ba
Page 163 and 164:
141One programming construct, the l
Page 165 and 166:
143Recall the discussion of mathema
Page 167 and 168:
145Now, a kind is needed that expla
Page 169 and 170:
147Thus, algorithms that are functi
Page 171 and 172:
149The general structure of class i
Page 173 and 174:
151eq codomain = Next .eq interpret
Page 175 and 176:
153guage is also being developed th
Page 177 and 178:
155* @param thread we are checking
Page 179 and 180:
157Because (untyped) lambda calculi
Page 181 and 182:
159Static resources are encoded in
Page 183 and 184:
161Figure 6.2: Stating Claims via a
Page 185 and 186:
163problem is necessarily non-termi
Page 187 and 188:
165Figure 6.4: An Example DomainFig
Page 189 and 190:
167current kind context C”. A typ
Page 191 and 192:
169engineering problems. As a count
Page 193 and 194:
171Invariably, such program comment
Page 195 and 196:
173Even so, no mechanism exists in
Page 197 and 198:
175siderably.Each property listed i
Page 199 and 200:
177instance Author is-kind-of Meta-
Page 201 and 202:
1797.1.9.4 Variable ScopeMany varia
Page 203 and 204:
181The syntax of comments that use
Page 205 and 206:
183complexity as part of the algori
Page 207 and 208:
185enormously complex, distributed,
Page 209 and 210:
1877.2.3 Semantic CompatibilityThe
Page 211 and 212:
189Likewise, the method’s visibil
Page 213 and 214:
191Some of the following examples w
Page 215 and 216:
193day: Integer);method getDate():
Page 217 and 218:
195Chapter 8ConclusionThis is a lar
Page 219 and 220:
197helpful for the publication prob
Page 221 and 222:
199First, the context of each and e
Page 223 and 224:
201developing new tools and technol
Page 225 and 226: 2038.2.3 ArchitectureAs mentioned p
Page 227 and 228: 205the more complete and correct pr
Page 229 and 230: 2078.3.3 Model TheoryInstitutions a
Page 231 and 232: 209*** and two kind of tuples (pair
Page 233 and 234: 211var A : Elt.X . var B : Elt.Y .e
Page 235 and 236: 213eq strings-only(# I) = mt .eq st
Page 237 and 238: 215eq G type-in? (S SS) = (G == typ
Page 239 and 240: 217subsort InstanceNameSet < Ground
Page 241 and 242: 219(fmod ENVIRONMENT isprotecting T
Page 243 and 244: 221fi .*** Done.eq is-type?(Gt, G)
Page 245 and 246: 223*** $Id: appendices.tex,v 1.22 2
Page 247 and 248: 225(red S3 in S2 == false .)(red S3
Page 249 and 250: 227op Gt : -> TypeContext .ops T0 T
Page 251 and 252: 229eq t40 = < $ ’Bool ; $ ’DNE
Page 253 and 254: 231(red valid?(T0, t0) == false .)(
Page 255 and 256: 233< $ ’Float ; $ ’height > < $
Page 257 and 258: 235(red is-a-type-of?(Basic # Strin
Page 259 and 260: 237PEG TE # [ # 89 ; $ ’Int ; mt
Page 261 and 262: 239eq B = < $ ’B ; $ ’Universal
Page 263 and 264: 241Appendix BSemantic PropertiesTab
Page 265 and 266: 243Table B.4: Concurrency Propertie
Page 267 and 268: 245Table B.7: Inheritance Propertie
Page 269 and 270: 247| Static_relation| ELLIPSES_TOKE
Page 271 and 272: 249[ constraint Constraint_list ]en
Page 273 and 274: 251Indirection_feature_list = "(" F
Page 275: 253Actual_generics = "[" Type_list
Page 279 and 280: 257Overrides_clause = overrides Fea
Page 281 and 282: 259Bibliography[1] Martín Abadi an
Page 283 and 284: 261[24] Robert Axelrod. The Complex
Page 285 and 286: 263[51] S. Castano and V. De Antone
Page 287 and 288: 265[78] S. Cohen and L. M. Northrop
Page 289 and 290: 267[102] G. Dowek, A. Felty, H. Her
Page 291 and 292: 269[130] Dov M. Gabbay and Philippe
Page 293 and 294: 271[156] Joseph A. Goguen and Rod B
Page 295 and 296: 273[182] Jonathan D. Hay and Joanne
Page 297 and 298: 275[209] Joseph R. Kiniry. The Kind
Page 299 and 300: 277[235] F. Lehmann and R. Wille. A
Page 301 and 302: 279[262] R. Mayr and T. Nipkow. Hig
Page 303 and 304: 281[291] Moritz Neumüller. Applyin
Page 305 and 306: 283[317] M. B. Ratcliffe and R. J.
Page 307 and 308: 285[346] Guy Steele. Common Lisp: T
Page 309: 287[376] N. Wilde and R. Huitt. Mai
show all

Ph.D. Dissertation

Create successful ePaper yourself

Delete template?

Save as template?