day35 - Term Rewriting Click to edit Master subtitle style...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Click to edit Master subtitle style 10/4/11 Term Rewriting
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 22 Types of Rewriting String rewriting is just grammars and the variety of rewriting systems posed by Post. In fact. L- systems are a form of concurrent string rewriting. Graph rewriting systems are often used in various forms of analyzers and optimizers, e.g., compiler optimizers. Some rewriting systems have a knowledge base underlying them, e.g., about operations on numbers. Such systems often are used as programming languages in systems that seek to simplify expressions, e.g., in Mathematica.
Background image of page 2
10/4/11 Dec 2, © UCF (Charles E. 33 Term Rewriting Systems These have equations as rules, but they are intended to be be rewritten in one direction only (lhs matches subterm which is replaced by rhs). Matching is a form of unification (as in theorem proving and Prolog).
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 44 TRS (Ackerman’s Function) R1: f(0,y) = y+1 R2: f(x+1,0) ) f(x,1)
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2011 for the course COT 5310 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Page1 / 10

day35 - Term Rewriting Click to edit Master subtitle style...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online