Implementation techniques for rewriting and narrowing

Rewrite systems are directed equations that can be used to compute by repeatedly rewriting an initial term until a final form is obtained. Such systems provide a nondeterministic programming language having convenient mathematical properties. Programs are easy to understand, as they have very simple syntax and semantics, based on equalities, with no explicit control. By allowing variables within the initial term, the term may be thought of as a logical query. It is possible to solve queries by narrowing, i.e. using the left-hand sides of rules to identify subterms with instances to which rules apply, and repeating the process until instantiations of the variables are constructed that can be shown by rewriting to satisfy the query.

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 dc:creator

• Josephson, Norman Alan

Contributors dc:contributor

• Dershowitz, Nachum

• Computer Science

Statement dc:rights

• Copyright 1989 Josephson, Norman Alan

Language dc:language

eng

Identifier

AAI8924855
(UMI)AAI8924855

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/21931