Order-sorted model theory for temporal executable specifications
An order-sorted, temporal programming paradigm is presented. It consists of a typed, modular, declarative language, its associated order-sorted temporal Horn clause logic basis, and a model theory generalizing order-sorted algebras with predicates to temporal order-sorted structures. The essence of...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science Jg. 179; H. 1; S. 273 - 299 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.06.1997
|
| ISSN: | 0304-3975, 1879-2294 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | An order-sorted, temporal programming paradigm is presented. It consists of a typed, modular, declarative language, its associated order-sorted temporal Horn clause logic basis, and a model theory generalizing order-sorted algebras with predicates to temporal order-sorted structures. The essence of this generalization is in time-dependent interpretation of predicates, so that a temporal order-sorted model amounts to a sequence of order-sorted equational models with predicates, one per each state. The main advantage of the presented paradigm in comparison with paradigms based on Horn-clause logic with equality is that it is more expressive, particularly so in representing properly state transitions, and other event-oriented, temporal behavioral properties of objects. At the same time, the generalized paradigm is proved to have the initial model semantics. The rules for temporal order-sorted deduction are established as an appropriate generalization of the rules for order-sorted Horn-clause logic with equality. The initial model is a quotient temporal order-sorted structure constructed from the initial temporal order-sorted structure and a congruence relation derived from a given set of temporal constraints. Temporal order-sorted model theoretic properties are also naturally established for temporal queries. The temporal constraint language has an execution model, and it is intended to be a basis for a prototyping tool for complex, typed, modular software systems. |
|---|---|
| Bibliographie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0304-3975 1879-2294 |
| DOI: | 10.1016/S0304-3975(96)00134-X |