A Formalization of the Semantics of Functional-Logic Programming in Isabelle - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

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

Résumé

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.
Fichier principal
Vignette du fichier
trends09final.pdf (146.31 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00408964 , version 1 (04-08-2009)

Identifiants

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

Citer

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⟩
91 Consultations
99 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More