Nondeterministic algebraic specifications and nonconfluent term rewriting
Journal of Logic Programming
A natural semantics for lazy evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Rewriting Logic for Declarative Programming
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Proceedings of the Third International Conference on Algebraic and Logic Programming
Higher-order narrowing with definitional trees
Journal of Functional Programming
Extra Variables Can Be Eliminated from Functional Logic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational semantics for declarative multi-paradigm languages
Journal of Symbolic Computation
Overlapping rules and logic variables in functional logic programs
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
An adequate, denotational, functional-style semantics for typed FlatCurry
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
| Hi-index | 0.00 |
A distinctive feature of modern functional logic languages like Toy or Curry is the possibility of programming non-strict and non-deterministic functions with call-time choice semantics. For almost ten years the CRWL framework [J.C. Gonzalez-Moreno, T. Hortala-Gonzalez, F. Lopez-Fraguas, and M. Rodriguez-Artalejo. A rewriting logic for declarative programming. In Proc. European Symposium on Programming (ESOP'96), pages 156-172. Springer LNCS 1058, 1996, J.C. Gonzalez-Moreno, T. Hortala-Gonzalez, F. Lopez-Fraguas, and M. Rodriguez-Artalejo. An approach to declarative programming based on a rewriting logic. Journal of Logic Programming 40(1):47-87, 1999] has been the only formal setting covering all these semantic aspects. But recently [E. Albert, M. Hanus, F. Huch, J. Oliver, and G. Vidal. Operational semantics for declarative multi-paradigm languages. Journal of Symbolic Computation 40(1):795-829, 2005] an alternative proposal has appeared, focusing more on operational aspects. In this work we investigate the relation between both approaches, which is far from being obvious due to the wide gap between both descriptions, even at syntactical level.