Back to results
University of Illinois at Urbana-Champaign
Termination of non-simple rewrite systems
Abstract
dc:descriptionRewriting is a computational process in which one term is derived from another by replacing a subterm with another subterm in accordance with a set of rules. If such a set of rules (rewrite system) has the property that no derivation can continue indefinitely, it is said to be terminating. Showing termination is an important component of theorem proving and of great interest in programming languages.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2011
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Hoot, Charles Glen
- Contributors dc:contributor
-
- Dershowitz, Nachum
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Copyright 1996 Hoot, Charles Glen
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
-
9780591199000
AAI9712310
(UMI)AAI9712310 - OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/21211