Abstract
Typing relates instances to types. In 'graph typing' both the instances and the types are graphs. The nodes of an instance graph are the items that are typed, and the edges are relations between items. 'Graph typing' generalizes the kind of typing known from programming languages, where the instances form a tree and the only directly supported relation among types ist the 'is-a' relation.
Guts is a framework for 'graph typing', originating in typing hypertext. In this paper we present our initial motivation for GUTS. It supports 'graph typing', and types can be defined with or without formal meaning (semantics).
| Original language | English |
|---|---|
| Title of host publication | Proc. 3rd International Austrian-Israeli Technion Symposium cum Industrial Forum, Software for Communication Technologies, Hagenberg, Austria |
| Number of pages | 6 |
| Publication status | Published - Apr 1999 |
Fields of science
- 102 Computer Sciences
- 102002 Augmented reality
- 102006 Computer supported cooperative work (CSCW)
- 102013 Human-computer interaction
- 102015 Information systems
- 102021 Pervasive computing
- 102025 Distributed systems
- 102027 Web engineering
- 202038 Telecommunications