CPO models for infinite term rewriting

CPO models for infinite term rewriting (1995)

Cached

Download Links

[www.di.unipi.it]

Other Repositories/Bibliography

DBLP

by Andrea Corradini , Fabio Gadducci

Venue:	in Proc. AMAST'95, LNCS 936
Citations:	10 - 7 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	CPO models for infinite term rewriting	user correction - Legacy Corrections
AUTHOR NAME	Andrea Corradini	SVM HeaderParse 0.1
AUTHOR AFFIL	Universit`a di Pisa, Dipartimento di Informatica	SVM HeaderParse 0.2
AUTHOR ADDR	Corso Italia 40, 56125 Pisa, Italy	SVM HeaderParse 0.1
AUTHOR NAME	Fabio Gadducci	SVM HeaderParse 0.1
AUTHOR AFFIL	Universit`a di Pisa, Dipartimento di Informatica	SVM HeaderParse 0.2
AUTHOR ADDR	Corso Italia 40, 56125 Pisa, Italy	SVM HeaderParse 0.1
ABSTRACT	. Infinite terms in universal algebras are a well-known topic since the seminal work of the ADJ group [1]. The recent interest in the field of term rewriting (tr) for infinite terms is due to the use of term graph rewriting to implement tr, where terms are represented by graphs: so, a cyclic graph is a finitary description of a possibly infinite term. In this paper we introduce infinite rewriting logic, working on the framework of rewriting logic proposed by Jos'e Meseguer [13, 14]. We provide a simple algebraic presentation of infinite computations, recovering the infinite parallel term rewriting, originally presented by one of the authors ([6]) to extend the classical, set-theoretical approach to tr with infinite terms. Moreover, we put all the formalism on firm theoretical bases, providing (for the first time, to the best of our knowledge, for infinitary rewriting systems) a clean algebraic semantics by means of (internal) 2-categories. 1 Introduction Term rewriting sy...	user correction - Legacy Corrections
YEAR	1995	INFERENCE
VENUE	in Proc. AMAST'95, LNCS 936	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	368--384	INFERENCE
TECH	LNCS 936	INFERENCE
CITATIONS	17 found	ParsCit 1.0