References

  1. S. Antoy (1997): Optimal Non-Deterministic Functional Logic Computations. In: 6th Int'l Conf. on Algebraic and Logic Programming (ALP'97) 1298. Springer LNCS, Southampton, UK, pp. 16–30, doi:10.1007/BFb0027000.
  2. S. Antoy (2001): Constructor-based Conditional Narrowing. In: Proc. of the 3rd International Conference on Principles and Practice of Declarative Programming (PPDP'01). ACM, Florence, Italy, pp. 199–206, doi:10.1145/773184.773205.
  3. S. Antoy (2011): On the Correctness of Pull-Tabbing. TPLP 11(4-5), pp. 713–730. Available at http://dx.doi.org/10.1017/S1471068411000263.
  4. S. Antoy & M. Hanus (2005): Declarative Programming with Function Patterns. In: Proceedings of the International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'05). Springer LNCS 3901, pp. 6–22, doi:10.1007/11680093_2.
  5. S. Antoy & M. Hanus (2006): Overlapping Rules and Logic Variables in Functional Logic Programs. In: 22nd International Conference on Logic Programming. Springer LNCS 4079, Seattle, WA, pp. 87–101, doi:10.1007/11799573_9.
  6. S. Antoy & M. Hanus (2010): Functional Logic Programming. Communications of the ACM 53(4), pp. 74–85, doi:10.1145/1721654.1721675.
  7. S. Antoy & M. Hanus (2011): New Functional Logic Design Patterns. In: Proc. of the 20th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2011). Springer LNCS 6816, pp. 19–34, doi:10.1007/978-3-642-22531-4_2.
  8. S. Antoy & M. Hanus (2012): Contracts and Specifications for Functional Logic Programming. In: Proc. of the 14th International Symposium on Practical Aspects of Declarative Languages (PADL 2012). Springer LNCS 7149, pp. 33–47, doi:10.1007/978-3-642-27694-1_4.
  9. Ana Bove, Peter Dybjer & Ulf Norell (2009): A Brief Overview of Agda — A Functional Language with Dependent Types. In: Proceedings of the 22nd Int. Conference on Theorem Proving in Higher Order Logics, TPHOLs '09. Springer-Verlag, Berlin, Heidelberg, pp. 73–78, doi:10.1007/978-3-642-03359-9_6.
  10. B. Braßel, M. Hanus, B. Peemöller & F. Reck (2011): KiCS2: A New Compiler from Curry to Haskell. In: Proc. of the 20th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2011). Springer LNCS 6816, pp. 1–18, doi:10.1007/978-3-642-22531-4_1.
  11. Edmund M. Clarke & Jeannette M. Wing (1996): Formal Methods: State of the Art and Future Directions. ACM Comput. Surv. 28(4), pp. 626–643, doi:10.1145/242223.242257.
  12. J.M. Cleva, J. Leach & F.J. López-Fraguas (2004): A logic programming approach to the verification of functional-logic programs. In: Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming. ACM Press, pp. 9–19, doi:10.1145/1013963.1013969.
  13. J.M. Cleva & F.J. López-Fraguas (2007): Semantic Determinism and Functional Logic Program Properties. Electr. Notes Theor. Comput. Sci. 174(1), pp. 3–15, doi:10.1016/j.entcs.2006.10.018.
  14. J.M. Cleva & I. Pita (2006): Verification of CRWL Programs with Rewriting Logic. Journal of Universal Computer Science 12(11), pp. 1594–1617, doi:10.3217/jucs-012-11-1594.
  15. H.B. Curry, J.R. Hindley & J.P. Seldin (1980): To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism. Academic Press. Available at https://books.google.com/books?id=r0SRQAAACAAJ.
  16. J.C. 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.
  17. M. Hanus (2013): Functional Logic Programming: From Theory to Curry. In: Programming Logics - Essays in Memory of Harald Ganzinger. Springer LNCS 7797, pp. 123–168, doi:10.1007/978-3-642-37651-1_6.
  18. M. Hanus (ed.) (2016): Curry: An Integrated Functional Logic Language (Vers. 0.9.0). Available at http://www.curry-language.org.
  19. H. Hussmann (1992): Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting. Journal of Logic Programming 12, pp. 237–255, doi:10.1016/0743-1066(92)90026-Y.
  20. John McCarthy (1963): A Basis for a Mathematical Theory of Computation. In: Computer Programming and Formal Systems. North-Holland, pp. 33–70, doi:10.1016/S0049-237X(08)72018-4.
  21. Kenneth L. McMillan (1993): Symbolic model checking. Kluwer Academic, Boston. Available at http://opac.inria.fr/record=b1084184, doi:10.1007/978-1-4615-3190-6.
  22. Bertrand Meyer (1992): Applying "Design by Contract". Computer 25(10), pp. 40–51, doi:10.1109/2.161279.
  23. Flemming Nielson, Hanne R. Nielson & Chris Hankin (1999): Principles of Program Analysis. Springer-Verlag New York, Inc., Secaucus, NJ, USA, doi:10.1007/978-3-662-03811-6.
  24. Ulf Norell (2009): Dependently Typed Programming in Agda. In: Proceedings of the 4th International Workshop on Types in Language Design and Implementation, TLDI '09. ACM, New York, NY, USA, pp. 1–2, doi:10.1145/1481861.1481862.
  25. Ulf Norell (2009): Dependently Typed Programming in Agda. In: Proceedings of the 6th International Conference on Advanced Functional Programming, AFP'08. Springer-Verlag, Berlin, Heidelberg, pp. 230–266. Available at http://dl.acm.org/citation.cfm?id=1813347.1813352, doi:10.1007/978-3-642-04652-0_5.
  26. S. Peyton Jones (2003): Haskell 98 Language and Libraries—The Revised Report. Cambridge University Press.
  27. U. S. Reddy (1985): Narrowing as the Operational Semantics of Functional Languages. In: Proc. IEEE Internat. Symposium on Logic Programming, Boston, pp. 138–151.
  28. J. R. Slagle (1974): Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity. J. ACM 21(4), pp. 622–642, doi:10.1145/321850.321859.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org