Equivalence of Two Formal Semantics for Functional Logic Programs

@article{LpezFraguas2007EquivalenceOT,
  title={Equivalence of Two Formal Semantics for Functional Logic Programs},
  author={Francisco Javier L{\'o}pez-Fraguas and Juan Rodr{\'i}guez-Hortal{\'a} and Jaime S{\'a}nchez-Hern{\'a}ndez},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2007},
  volume={188},
  pages={117-142}
}
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 [6,7] has been the only formal setting covering all these semantic aspects. But recently [1] 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… CONTINUE READING