A simple rewrite notion for call-time choice semantics

@inproceedings{LpezFraguas2007ASR,
  title={A simple rewrite notion for call-time choice semantics},
  author={Francisco Javier L{\'o}pez-Fraguas and Juan Rodr{\'i}guez-Hortal{\'a} and Jaime S{\'a}nchez-Hern{\'a}ndez},
  booktitle={PPDP},
  year={2007}
}
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewrite systems to define possibly non-strict non-deterministic functions. The semantics adopted for non-determinism is call-time choice, whose combination with non-strictness is not a trivial issue that has been addressed from a semantic point of view in the Constructor-based Rewriting Logic (CRWL) framework. We investigate… CONTINUE READING