A recursively defined ordering for proving termination of term rewriting systems

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today



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

ID Numbers

Open Library
OL4067866M
Internet Archive
recursivelydefin943plai
LCCN
79621024

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
September 6, 2021 Edited by MARC Bot import existing book
February 3, 2010 Edited by WorkBot add more information to works
December 9, 2009 Created by WorkBot add works page