References

  1. Sergei Abramov & Robert Glück (2000): The Universal Resolving Algorithm: Inverse Computation in a Functional Language. In: Mathematics of Program Construction, MPC'00. Springer, Berlin, Heidelberg, pp. 187–212, doi:10.1007/10722010_13.
  2. Sergei Abramov & Robert Glück (2002): The Universal Resolving Algorithm and its Correctness: Inverse Computation in a Functional Language. Science of Computer Programming 43(2), pp. 193–229, doi:10.1016/S0167-6423(02)00023-0.
  3. Sergei Abramov, Robert Glück & Yuri Klimov (2007): An Universal Resolving Algorithm for Inverse Computation of Lazy Languages. In: Proceedings of the 6th International Andrei Ershov Memorial Conference on Perspectives of Systems Informatics, PSI'06. Springer, Berlin, Heidelberg, pp. 27–40, doi:10.1007/978-3-540-70881-0_6.
  4. Jesús M. Almendros-Jiménez & Germán Vidal (2007): Automatic Partial Inversion of Inductively Sequential Functions. In: Proceedings of the 18th International Conference on Implementation and Application of Functional Languages, IFL'06. Springer, Berlin, Heidelberg, pp. 253–270, doi:10.1007/978-3-540-74130-5_15.
  5. Sergio Antoy (2001): Constructor-Based Conditional Narrowing. In: Proceedings of the 3rd ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP’01. Association for Computing Machinery, New York, NY, USA, pp. 199––206, doi:10.1145/773184.773205.
  6. Sergio Antoy & Michael Hanus (2006): Declarative Programming with Function Patterns. In: Proceedings of the 15th International Conference on Logic-Based Program Synthesis and Transformation, LOPSTR'05. Springer, Berlin, Heidelberg, pp. 6–22, doi:10.1007/11680093_2.
  7. Sergio Antoy & Michael Hanus (2010): Functional Logic Programming. Communications of the ACM 53(4), pp. 74–85, doi:10.1145/1721654.1721675.
  8. Sergio Antoy & Michael Hanus (2017): Eliminating Irrelevant Non-determinism in Functional Logic Programs. In: Practical Aspects of Declarative Languages, PADL'17. Springer, Cham, pp. 1–18, doi:10.1007/978-3-319-51676-9_1.
  9. Sergio Antoy & Michael Hanus (2018): Equivalence Checking of Non-deterministic Operations. In: Proceedings of the 14th International Symposium on Functional and Logic Programming, FLOPS'18. Springer, Cham, pp. 149–165, doi:10.1007/978-3-319-90686-7_10.
  10. Bernd Braßel & Jan Christiansen (2008): A Relation Algebraic Semantics for a Lazy Functional Logic Language. In: Relations and Kleene Algebra in Computer Science, RelMiCS'08. Springer, Berlin, Heidelberg, pp. 37–53, doi:10.1007/978-3-540-78913-0_5.
  11. Jan Christiansen & Sebastian Fischer (2008): EasyCheck – Test Data for Free. In: Proceedings of the 9th International Symposium on Functional and Logic Programming, FLOPS'08. Springer, Berlin, Heidelberg, pp. 322–336, doi:10.1007/978-3-540-78969-7_23.
  12. Sandra Dylus, Jan Christiansen & Finn Teegen (2020): Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism. Theory and Practice of Logic Programming 20(1), pp. 147––175, doi:10.1017/S1471068419000085.
  13. Robert Glück & Masahiko Kawabe (2004): Derivation of Deterministic Inverse Programs Based on LR Parsing. In: Functional and Logic Programming, FLOPS'04. Springer, Berlin, Heidelberg, pp. 291–306, doi:10.1007/978-3-540-24754-8_21.
  14. Robert Glück & Andrei V. Klimov (1993): Occam's Razor in Metacomputation: the Notion of a Perfect Process Tree. In: Patrick Cousot, Moreno Falaschi, Gilberto Filé & Antoine Rauzy: Static Analysis. Springer, Berlin, Heidelberg, pp. 112–123, doi:10.1007/3-540-57264-3_34.
  15. Juan Carlos González-Moreno, M.T. Hortalá-González, F.J. López-Fraguas & M. Rodríguez-Artalejo (1999): An approach to declarative programming based on a rewriting logic. Journal of Logic Programming 40, pp. 47–87, doi:10.1016/S0743-1066(98)10029-8.
  16. Michael Hanus (2017): CurryCheck: Checking Properties of Curry Programs. In: Proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR'16. Springer, Cham, pp. 222–239, doi:10.1007/978-3-319-63139-4_13.
  17. Michael Hanus & Finn Teegen (2020): Adding Data to Curry. In: Declarative Programming and Knowledge Management. Springer, Cham, pp. 230–246, doi:10.1007/978-3-030-46714-2_15.
  18. Michael Hanus (ed.) (2016): Curry: An Integrated Functional Logic Language (Vers. 0.9.0). Available at http://www.curry-lang.org.
  19. Francisco López-Fraguas & Jaime Sánchez-Hernández (1999): TOY: A Multiparadigm Declarative System. In: Rewriting Techniques and Applications, RTA'99. Springer, Berlin, Heidelberg, pp. 244–247, doi:10.1007/3-540-48685-2_19.
  20. Naoki Nishida, Masahiko Sakai & Toshiki Sakabe (2005): Partial Inversion of Constructor Term Rewriting Systems. In: Proceedings of the 16th International Conference on Term Rewriting and Applications, RTA'05. Springer, Berlin, Heidelberg, pp. 264–278, doi:10.1007/978-3-540-32033-3_20.
  21. Björn Peemöller (2016): Normalization and Partial Evaluation of Functional Logic Programs. Kiel University. Available at https://macau.uni-kiel.de/receive/diss_mods_00021156.
  22. Jens Peter Secher & Morten Heine Sørensen (2002): From Checking to Inference via Driving and Dag Grammars. In: Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, PEPM'02. ACM, New York, NY, USA, pp. 41–51, doi:10.1145/509799.503036.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org