Abstract
TOY is the concrete implementation of CRWL, a wide theo- retical framework for declarative programming whose basis is a construc- tor based rewriting logic with lazy non-deterministic functions as the core notion. Other aspects of CRWL supported by TOY are: polymor- phic types; HO features; equality and disequality constraints over terms and linear constraints over real numbers; goal solving by needed narrow- ing combined with constraint solving. The implementation is based on a compilation of TOY programs into Prolog.
Cite
CITATION STYLE
López Fraguas, F. J., & Hernández, J. S. (1999). TOY: A multiparadigm declarative system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1631, pp. 244–247). Springer Verlag. https://doi.org/10.1007/3-540-48685-2_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
