Appeared in Volume 10/2, May 1997
TOY supports functional programming in the style of Gofer or Haskell. Its functional programming features include: polymorphic types, higher order functions, lazy evaluation and infinite data structures. TOY supports pure logic programming, including clausal notation as syntactic sugar for true-valued functions.
Lazy narrowing is achieved by means of a translation of the original program into Prolog. The translation implements a 'demand-driven' narrowing strategy which takes into account how arguments are demanded while reducing an expression.
Other features: (strict) equality and disequality constraint solving, higher order logic computations, nondeterministic functions.
TOY is available from:
TOY requires Sicstus Prolog v3.
For more information, contact:
Francisco J. Lopez-Fraguas
Tel: +34 1 394 4429
Fax: +34 1 394 4607