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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
