Relating two semantic descriptions of functional logic programs

Abstract

Abstract 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 framewor

    Similar works