Loading...
Please wait, while we are loading the content...
Similar Documents
Deenable Naming Relations in Meta-level Systems Frank Van Harmelen
| Content Provider | Semantic Scholar |
|---|---|
| Author | Harmelen, Frank Van |
| Copyright Year | 1992 |
| Abstract | \Don't stand chattering to yourself like that," Humpty Dumpty said, looking at Alice for the rst time, \but tell me your name and your business." \My name is Alice, but |" \It's a stupid name enough!" Humpty Dumpty interrupted impatiently. \What does it mean?" \Must a name mean something?" Alice asked doubtfully. \Of course it must," Humpty Dumpty said with a short laugh: \my name means the shape I am | and a good handsome shape it is, too. With a name like yours, you might be any shape, almost." Abstract. Meta-level architectures are always, implicitly or explicitly, equipped with a component that establishes a relation between their object-and meta-level layers. This so-called naming relation has been a neglected part of the architecture of meta-level systems. This paper argues that the naming relation can be employed to increase the ex-pressiveness and eeciency of meta-level architectures, while preserving known logical properties. We argue that the naming relation should not be a xed part of a meta-level architecture, but that it should be deenable to allow suitable encoding of syntactic information. Once the naming relation is deenable, we can also make it meaningful. That is, it can also be used to encode pragmatic and semantic information, allowing for more compact and eecient meta-theories. We explore the formal constraints that such a deenable naming relation must satisfy, and we describe a definition mechanism for naming relations which is based on term rewriting systems. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.vu.nl/~frankh/postscript/META92.ps.gz |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
