Curry and Howard Meet Borel - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail (Preprint/Prepublication) Année : 2023

Curry and Howard Meet Borel

Résumé

We show that an intuitionistic version of counting propositional logic corresponds, in the sense of Curry and Howard, to an expressive type system for the probabilistic eventcalculus, a vehicle calculus in which both call-by-name and call-by-value evaluation of discrete randomized functional programs can be simulated. Remarkably, proofs (respectively, types) do not only guarantee that validity (respectively, termination) holds, but also reveal the underlying probability. We finally show that by endowing the type system with an intersection operator, one obtains a system precisely capturing the probabilistic behavior of-terms.
Fichier principal
Vignette du fichier
LICS.pdf (927.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03921649 , version 1 (04-01-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-03921649 , version 1

Citer

Melissa Antonelli, Ugo Dal Lago, Paolo Pistone. Curry and Howard Meet Borel. 2023. ⟨hal-03921649⟩
18 Consultations
12 Téléchargements

Partager

Gmail Facebook X LinkedIn More