Definable Naming Relations in Meta-level Systems

Definable Naming Relations in Meta-level Systems (1992)

by Frank Van Harmelen

Venue:	Proceedings of the Third Workshop on Meta-programming in Logic (META'92), volume 649 of Lecture Notes in Computer Science
Citations:	13 - 5 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Definable Naming Relations in Meta-level Systems	user correction - Legacy Corrections
AUTHOR NAME	Frank Van Harmelen	SVM HeaderParse 0.1
AUTHOR AFFIL	S.W.I., University of Amsterdam	SVM HeaderParse 0.2
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 expressiveness and efficiency of meta-level architectures, while preserving known logical properties. We argue that the naming relation should not be a fixed part of a meta-level architecture, but that it should be definable to allow suitable encoding of syntactic information. Once the naming relation is definable, we can also make it meaningful. That is, it can also be used to encode pragmatic and semantic information, allowing for more compact and efficient meta-theories. We explore the formal constraints that such a definable naming relation must satisfy, and we describe a definition mechanism for naming relations which is based on term rewriting s...	user correction - Legacy Corrections
YEAR	1992	INFERENCE
VENUE	Proceedings of the Third Workshop on Meta-programming in Logic (META'92), volume 649 of Lecture Notes in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	89--104	INFERENCE
CITATIONS	15 found	ParsCit 1.0