2026-09-20T01:50:26Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/16748 2023-07-10 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Gunter, Elsa L. Osborn, Christopher J. 2010-08-20T17:56:40Z 2010-08-20T17:56:40Z 2010-08-20T17:56:40Z 2010-08 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. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-07-19T15:33:59Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Osborn_Christopher.pdf: 284199 bytes, checksum: 8912105bf6225c3e70163645f77d42d1 (MD5) Made available in DSpace on 2010-08-20T17:56:40Z (GMT). No. of bitstreams: 2 Osborn_Christopher.pdf: 284199 bytes, checksum: 8912105bf6225c3e70163645f77d42d1 (MD5) license.txt: 4068 bytes, checksum: d18b50caac8759d5dda53f96a124f145 (MD5) http://hdl.handle.net/2142/16748 en Copyright 2010 by Christopher Jon Osborn. All rights reserved. Mathematica term rewriting circular reasoner Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs Computer Science 1434 Computer Science 0112 University of Illinois at Urbana-Champaign Thesis M.S. MS:Computer Science -UIUC 10KS0112MS