×

TOY

swMATH ID: 9812
Software Authors: F. J. López Fraguas, J. Sánchez Hernández
Description: TOY: A Multiparadigm Declarative System. 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: polymorphic types; HO features; equality and disequality 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.
Homepage: http://link.springer.com/chapter/10.1007/3-540-48685-2_19
Related Software: BABEL; PAKCS; Haskell; Curry; Kernel-LEAF; Maude; Hat; TeaBag; ECCE; Mercury; Oz; ML; Hood; Freja; PFLP; EasyCheck; Isabelle; Hakaru; Church; PITA
Cited in: 56 Publications

Citations by Year