5 papers
A Strongly Normalising System of Dependent Types for Transparent and Opaque Probabilistic Computation
Francesco A. Genco
We define an extension of lambda-calculus with dependents types that enables us to encode transparent and opaque probabilistic programs and prove a strong normalisation result for…
A Logic of Knowledge and Justifications, with an Application to Computational Trust
Francesco A. Genco
We present a logical framework that enables us to define a formal theory of computational trust in which this notion is analysed in terms of epistemic attitudes towards the possibl…
A Direct Characterisation of Logical Grounds and a Decidability Proof
Francesco A. Genco
We present a standard calculus for logical grounding based on well-established grounding principles [Schnieder, 2011, Fine, 2012, Correia, 2014, Correia, 2024] and provide a very d…
A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs
Francesco A. Genco, Giuseppe Primiero
The extensive deployment of probabilistic algorithms has radically changed our perspective on several well-established computational notions. Correctness is probably the most basic…
Evaluating AI fairness in credit scoring with the BRIO tool
Greta Coraglia, Francesco A. Genco, Pellegrino Piantadosi +4
We present a method for quantitative, in-depth analyses of fairness issues in AI systems with an application to credit scoring. To this aim we use BRIO, a tool for the evaluation o…