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.
Type de document :
Communication dans un congrès
22nd International Conference on Theorem Proving in Higher-Order Logics : emerging trends session - TPHOLs 2009, Aug 2009, Munich, Germany. 2009
Liste complète des métadonnées

https://hal.inria.fr/inria-00408964
Contributeur : Stephan Merz <>
Soumis le : mardi 4 août 2009 - 15:45:48
Dernière modification le : mercredi 28 mars 2018 - 14:38:34
Document(s) archivé(s) le : mardi 15 juin 2010 - 20:33:37

Fichiers

trends09final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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

Collections

Citation

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, Aug 2009, Munich, Germany. 2009. 〈inria-00408964〉

Partager

Métriques

Consultations de la notice

140

Téléchargements de fichiers

152