Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs

We have designed Circular Reasoner, a package in Mathematica for the specification of functional programs using rewrite rules. The package detects certain recursions of a cyclical nature, and through repeated refinement of a set of initial guesses of final values for relevant terms, arrives at a value consistent with the equations used to define the functional program. We discuss this package and its implementation.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2010

Author dc:creator

• Osborn, Christopher J.

Contributors dc:contributor

• Gunter, Elsa L.

• Mathematica
• term rewriting
• circular reasoner

Statement dc:rights

• Copyright 2010 by Christopher Jon Osborn. All rights reserved.

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/16748

OAI identifier oai:identifier

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