TOY is the concrete implementation of CRWL,a wide theoretical framework for declarative programming whose basis is a constructor based rewriting logic with lazy non-deterministic functions as the core notion.Other aspects of CRWL supported by TOY are:polmorphic types; HO features; equality and lisequality constraints over terms and linear constraints over real numbers; goal solving by needed narrowing combined with constraint solving.The implementation is based on a compilation of TOY programs into Prolog.
展开▼
