Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Antoy, R. Echahed, M. Hanus. A needed narrowing strategy. Proc. POPL’94, 268–279, 1994.
P. Arenas, T. Hortalá, F.J. López, E. Ullán. Real constraints within a au]functional logic language. Proc. APPIA-GULP-PRODE’96, 451–462, 1996.
P. Arenas, F.J. López, M. Rodríguez. Embedding multiset constraints into a lazy functional logic language. Proc. PLILP’98, Springer LNCS 1490, 429–444, 1998.
P. Arenas, F.J. López, M. Rodríguez. Functional plus logic programming with built-in and symbolic constraints, 1998. Submitted.
P. Arenas, M. Rodríguez. A semantic framework for functional logic programming with algebraic polymorphic types. Proc.TAPSOFT’97, Springer LNCS 1214, 453–464, 1997.
P. Arenas, M. Rodríguez. A lazy narrowing calculus for functional logic programming with algebraic polymorphic types. Proc. ILPS’97,MIT Press, 53–69, 1997.
R. Caballero, F.J. López. A functional logic alternative to monads. Proc. of Workshop on Component-Based Software Development in Computer Logic, 87–100, 1998.
R. Caballero, F.J. López. Parsing with non-deterministic functions. Proc. APPIA-GULP-PRODE’98, 1–16, 1998.
J.C. González, T. Hortala, F.J. López, M. Rodríguez. An approach to declarative programming based on a rewriting logic. To appear in JLP, 1998. Earlier version in ESOP’96.
J.C. González, M.T. Hortalá, M. Rodríguez. A higher order rewriting logic for functional logic programming. ICLP’97, MIT Press, 153–167, 1997.
M. Hanus. The integration of functions into logic programming, JLP, 19 & 20, 583–628, 1994.
M. Hanus. A unified computation model for functional and logic programming, Proc. POPL’97, 80–93, 1997.
M. Hanus (ed.). Curry: An integrated functional logic language. Available at http://www-i2.informatik.rwth-aachen.de/~hanus/curry, 1998.
F.J.a López, J. Sánchez. An efficient narrowing strategy by means of disequality constraints. Tech. Rep. 98/84, Dep. SIP, UCM Madrid, 1998.
R. Loogen, F.J. López, M. Rodríguez. A demand driven computation strategy for lazy narrowing. Proc. PLILP’3, Springer LNCS 714, 184–200, 1993.
J.J. Moreno, M. Rodríguez. Logic programming with functions and predicates: The language BABEL. JLP, 12, 191–223, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López Fraguas, F.J., Sánchez Hernández, J. (1999). TOY: A Multiparadigm Declarative System. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_19
Download citation
DOI: https://doi.org/10.1007/3-540-48685-2_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66201-3
Online ISBN: 978-3-540-48685-5
eBook Packages: Springer Book Archive