Curry and Howard Meet Borel - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Curry and Howard Meet Borel

Abstract

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 event λ-calculus, a vehicle calculus in which both call-by-name and call-by-value evaluation of discrete randomized functional programs can be simulated. In this context, proofs (respectively, types) do not guarantee that validity (respectively, termination) holds, but reveal the underlying probability. We finally show how to obtain a system precisely capturing the probabilistic behavior of λ-terms, by endowing the type system with an intersection operator.
Fichier principal
Vignette du fichier
LICS_2022.pdf (884.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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

Identifiers

Cite

Melissa Antonelli, Ugo Dal Lago, Paolo Pistone. Curry and Howard Meet Borel. LICS 2022 - 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa, Israel. ⟨10.1145/3531130.3533361⟩. ⟨hal-03921650⟩
30 View
12 Download

Altmetric

Share

Gmail Facebook X LinkedIn More