HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A Formalization of the Semantics of Functional-Logic Programming in Isabelle

Francisco López Fraguas 1 Stephan Merz 2 Juan Rodríguez Hortalá 1
2 MOSEL - Proof-oriented development of computer-based systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Stephan Merz Connect in order to contact the contributor
Submitted on : Tuesday, August 4, 2009 - 3:45:48 PM
Last modification on : Friday, February 4, 2022 - 3:21:46 AM
Long-term archiving on: : Tuesday, June 15, 2010 - 8:33:37 PM


Files produced by the author(s)


  • HAL Id : inria-00408964, version 1
  • ARXIV : 0908.0494



Francisco López Fraguas, Stephan Merz, Juan Rodríguez Hortalá. A Formalization of the Semantics of Functional-Logic Programming in Isabelle. 22nd International Conference on Theorem Proving in Higher-Order Logics : emerging trends session - TPHOLs 2009, Technische Universität München, Aug 2009, Munich, Germany. ⟨inria-00408964⟩



Record views


Files downloads