Towards Probabilistic Reasoning in Type Theory - The Intersection Type Case

The development of different probabilistic models of uncertainty has been inspired by the rapid progress in various fields, e.g. in AI, probabilistic programming, etc. Lambda calculus is a universal model of computation suitable to express programming languages concepts. Hence, different methods for probabilistic reasoning in lambda calculus have been investigated. In this paper, we develop a formal model for probabilistic reasoning about lambda terms with intersection types, which is a combination of lambda calculus and probabilistic logic. The language of lambda calculus with intersection types is endowed with a probabilistic operator. We propose a semantics based on the possible world approach. An infinitary axiomatization is given for this system and it is proved to be sound with respect to the proposed semantics.

[1]  Hinrich Schütze,et al.  Book Reviews: Foundations of Statistical Natural Language Processing , 1999, CL.

[2]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[3]  Ugo Dal Lago,et al.  On Applicative Similarity, Sequentiality, and Full Abstraction , 2015, Correct System Design.

[4]  Mariangiola Dezani-Ciancaglini,et al.  A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.

[5]  C. L. Hamblin.  VIII.—THE MODAL ”PROBABLY“ , 1959 .

[6]  G. Longo,et al.  Lambda-Calculus Models and Extensionality , 1980, Math. Log. Q..

[7]  Ugo Dal Lago,et al.  On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi , 2014, ESOP.

[8]  Michele Pagani,et al.  The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus , 2019, FSCD.

[9]  H. Jerome Keisler.  Hyperfinite models of adapted probability logic , 1986, Ann. Pure Appl. Log..

[10]  Zoran Ognjanovic,et al.  Probabilistic Reasoning About Simply Typed Lambda Terms , 2018, LFCS.

[11]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[12]  Ugo Dal Lago,et al.  On coinductive equivalences for higher-order probabilistic functional programs , 2013, POPL.

[13]  Coppo Mario,et al.  A new type assignment for lambda-terms , 1978 .

[14]  H. Gaifman.  Concerning measures in first order calculi , 1964 .

[15]  Mariangiola Dezani-Ciancaglini,et al.  A new type assignment for λ-terms , 1978, Arch. Math. Log..

[16]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[17]  Silvia Ghilezan,et al.  Strong Normalization and Typability with Intersection Types , 1996, Notre Dame J. Formal Log..

[18]  T. Hailperin,et al.  Best Possible Inequalities for the Probability of a Logical Function of Events , 1965 .

[19]  J. Roger Hindley,et al.  Lambda calculus with types (Perspectives in Logic) , 2014 .