Add to ORKGInternational audienceModern functional-logic programming languages like Toy or Curry feature non-strict non-deterministic functions that behave under call-time choice semantics. A standard formulation for this semantics is the CRWL logic, that specifies a proof calculus for computing the set of possible results for each expression. In this paper we present a formalization of that calculus in the Isabelle/HOL proof assistant. We have proved some basic properties of CRWL: closedness under c-substitutions, polarity and compositionality. We also discuss some insights that have been gained, such as the fact that left linearity of program rules is not needed for any of these results to hold
I develop a formal framework for propositional satifisfiability with the conflict-driven clause lear...
This paper describes our experience in formalising arguments about the Miranda functional programmin...
Non-confluent and non-terminating constructor-based term rewrite systems are useful for the purpose ...
International audienceModern functional-logic programming languages like Toy or Curry feature non-st...
Abstract. Modern functional-logic programming languages like Toy or Curry feature non-strict non-det...
AbstractA distinctive feature of modern functional logic languages like Toy or Curry is the possibil...
We address in this paper the question of how to verify pro-gram properties in modern functional logi...
AbstractIn modern functional logic languages like Curry or Toy, programs are possibly non-confluent ...
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and non-...
We present a novel approach to the verification of functional-logic programs. For our verification p...
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning t...
AbstractIn the book on Advanced Topics in Types and Programming Languages, Crary illustrates the rea...
Abstract. How to extract negative information from programs is an important issue in logic programmi...
How to extract negative information from programs is an important issue in logic program-ming. Here ...
International audienceIsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at develo...
I develop a formal framework for propositional satifisfiability with the conflict-driven clause lear...
This paper describes our experience in formalising arguments about the Miranda functional programmin...
Non-confluent and non-terminating constructor-based term rewrite systems are useful for the purpose ...
International audienceModern functional-logic programming languages like Toy or Curry feature non-st...
Abstract. Modern functional-logic programming languages like Toy or Curry feature non-strict non-det...
AbstractA distinctive feature of modern functional logic languages like Toy or Curry is the possibil...
We address in this paper the question of how to verify pro-gram properties in modern functional logi...
AbstractIn modern functional logic languages like Curry or Toy, programs are possibly non-confluent ...
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and non-...
We present a novel approach to the verification of functional-logic programs. For our verification p...
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning t...
AbstractIn the book on Advanced Topics in Types and Programming Languages, Crary illustrates the rea...
Abstract. How to extract negative information from programs is an important issue in logic programmi...
How to extract negative information from programs is an important issue in logic program-ming. Here ...
International audienceIsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at develo...
I develop a formal framework for propositional satifisfiability with the conflict-driven clause lear...
This paper describes our experience in formalising arguments about the Miranda functional programmin...
Non-confluent and non-terminating constructor-based term rewrite systems are useful for the purpose ...