Categorical Term Rewriting: Monads and Modularity

Categorical Term Rewriting: Monads and Modularity (1998)

Cached

Download Links

[www.lfcs.inf.ed.ac.uk]

by Christoph Lüth

Venue:	University of Edinburgh
Citations:	12 - 6 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Categorical Term Rewriting: Monads and Modularity	SVM HeaderParse 0.2
AUTHOR NAME	Christoph Lüth	SVM HeaderParse 0.2
AUTHOR AFFIL	Doctor of Philosophy; University of Edinburgh	SVM HeaderParse 0.2
AUTHOR ADDR	1997 Abstract	SVM HeaderParse 0.2
ABSTRACT	Term rewriting systems are widely used throughout computer science as they provide an abstract model of computation while retaining a comparatively simple syntax and semantics. In order to reason within large term rewriting systems, structuring operations are used to build large term rewriting systems from smaller ones. Of particular interest is whether key properties are modular, thatis,ifthe components of a structured term rewriting system satisfy a property, then does the term rewriting system as a whole? A body of literature addresses this problem, but most of the results and proofs depend on strong syntactic conditions and do not easily generalize. Although many specific modularity results are known, a coherent framework which explains the underlying principles behind these results is lacking. This thesis posits that part of the problem is the usual, concrete and syntaxoriented semantics of term rewriting systems, and that a semantics is needed which on the one hand elides unnecessary syntactic details but on the other hand still possesses enough expressive power to model the key concepts arising from	SVM HeaderParse 0.2
YEAR	1998	INFERENCE
VENUE	University of Edinburgh	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
PAGES	18--32	INFERENCE
TECH	PhD thesis	INFERENCE
CITATIONS	28 found	ParsCit 1.0