A recursively defined ordering for proving termination of term rewriting systems

My Reading Lists:

Create a new list




Download Options

Buy this book

Last edited by MARC Bot
September 6, 2021 | History

A recursively defined ordering for proving termination of term rewriting systems

This edition doesn't have a description yet. Can you add one?

Buy this book

Previews available in: English

Edition Availability
Cover of: A recursively defined ordering for proving termination of term rewriting systems
A recursively defined ordering for proving termination of term rewriting systems
1978, Dept. of Computer Science, University of Illinois at Urbana-Champaign
in English

Add another edition?

Book Details


Edition Notes

Bibliography: p. 53.
"UILU-ENG 78 1736."
NSF MCS 77-22830."

Published in
Urbana
Series
[Report] - UIUCDCS-R-78 ; 943

Classifications

Dewey Decimal Class
001.6/4/08 s, 001.6/42
Library of Congress
QA76 .I4 no. 943, QA76.6 .I4 no. 943

The Physical Object

Pagination
53 p. ;
Number of pages
53

Edition Identifiers

Open Library
OL4067866M
Internet Archive
recursivelydefin943plai
LCCN
79621024

Work Identifiers

Work ID
OL2110060W

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
September 6, 2021 Edited by MARC Bot import existing book
October 18, 2020 Edited by MARC Bot import existing book
December 14, 2009 Edited by WorkBot link works
December 14, 2009 Edited by WorkBot link works
April 1, 2008 Created by an anonymous user Imported from Scriblio MARC record