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.

References in zbMATH (referenced in 61 articles )

Showing results 1 to 20 of 61.
Sorted by year (citations)

1 2 3 4 next

  1. Antoy, Sergio; Jost, Andy: Compiling a functional logic language: \itThe Fair Scheme (2014)
  2. López-Fraguas, Francisco J.; Martin-Martin, Enrique; Rodríguez-Hortalá, Juan: Safe typing of functional logic programs with opaque patterns and local bindings (2014)
  3. Riesco, Adrián; Rodríguez-Hortalá, Juan: Singular and plural functions for functional logic programming (2014)
  4. Hanus, Michael: Functional logic programming: from theory to curry (2013)
  5. Almendros-Jiménez, J.M.; Caballero, R.; García-Ruiz, Y.; Sáenz-Pérez, F.: XPath query processing in a functional-logic language (2012)
  6. Estévez-Martín, Sonia; Correas Fernández, Jesús; Sáenz-Pérez, Fernando: Extending the $\mathcalTOY$ system with the $ECL^i $P$S^e $ solver over sets of integers (2012)
  7. Hanus, Michael: Improving lazy non-deterministic computations by demand analysis (2012)
  8. Braßel, Bernd; Fischer, Sebastian; Hanus, Michael; Reck, Fabian: Transforming functional logic programs into monadic functional programs (2011)
  9. del Vado Vírseda, Rafael: Cooperation of algebraic constraint domains in higher-order functional and logic programming (2011)
  10. del Vado Vírseda, Rafael: A theoretical framework for the higher-order cooperation of numeric constraint domains (2011)
  11. Del Vado Vírseda, Rafael: A theoretical framework for the higher-order cooperation of numeric constraint domains (2011)
  12. Hanus, Michael: Lazy and enforceable assertions for functional logic programs (2011)
  13. Alpuente, Maria; Ballis, Demis; Falaschi, Moreno: Transformation and debugging of functional logic programs (2010)
  14. Alpuente, M.; Ballis, D.; Correa, F.; Falaschi, M.: An integrated framework for the diagnosis and correction of rule-based programs (2010)
  15. Alpuente, M.; Comini, M.; Escobar, S.; Falaschi, M.; Iborra, J.: A compact fixpoint semantics for term rewriting systems (2010)
  16. Antoy, Sergio: Programming with narrowing: a tutorial (2010)
  17. del Vado Vírseda, Rafael; Castiñeiras, Ignacio: A theoretical framework for the declarative debugging of functional logic programs with lambda abstractions (2010)
  18. Nishida, Naoki; Vidal, Germán: Termination of narrowing via termination of rewriting (2010)
  19. Riesco, Adrián; Rodríguez-Hortalá, Juan: A natural implementation of plural semantics in maude (2010)
  20. Del Vado Vírseda, Rafael: A logical framework for debugging in declarative constraint programming (2009)

1 2 3 4 next