Abstract. Modern 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 for-malization 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.
Modern programming languages offer a lot of guarantees (no or few memory leaks, safe parallel progra...
Propositional Logic This week’s exercises will be on propositional logic. We will do proofs both usi...
This paper describes a deep embedding of a refinement calculus for logic programs in Isabelle/HOL. I...
International audienceModern functional-logic programming languages like Toy or Curry feature non-st...
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-...
AbstractA distinctive feature of modern functional logic languages like Toy or Curry is the possibil...
We present a novel approach to the verification of functional-logic programs. For our verification p...
How to extract negative information from programs is an important issue in logic program-ming. Here ...
Abstract. How to extract negative information from programs is an important issue in logic programmi...
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...
This book is two books. Part I is a practical introduction to working with the Isabelle proof assist...
This book is two books. Part I is a practical introduction to working with the Isabelle proof assist...
Modern programming languages offer a lot of guarantees (no or few memory leaks, safe parallel progra...
Propositional Logic This week’s exercises will be on propositional logic. We will do proofs both usi...
This paper describes a deep embedding of a refinement calculus for logic programs in Isabelle/HOL. I...
International audienceModern functional-logic programming languages like Toy or Curry feature non-st...
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-...
AbstractA distinctive feature of modern functional logic languages like Toy or Curry is the possibil...
We present a novel approach to the verification of functional-logic programs. For our verification p...
How to extract negative information from programs is an important issue in logic program-ming. Here ...
Abstract. How to extract negative information from programs is an important issue in logic programmi...
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...
This book is two books. Part I is a practical introduction to working with the Isabelle proof assist...
This book is two books. Part I is a practical introduction to working with the Isabelle proof assist...
Modern programming languages offer a lot of guarantees (no or few memory leaks, safe parallel progra...
Propositional Logic This week’s exercises will be on propositional logic. We will do proofs both usi...
This paper describes a deep embedding of a refinement calculus for logic programs in Isabelle/HOL. I...