The notion of solvability, crucial in the λ-calculus, is conservatively extended to a probabilistic setting, and a complete characterization of it is given. The employed technical tool is a type assignment system, based on non-idempotent intersection types, whose typable terms turn out to be precisely the terms which are solvable with nonnull probability. We also supply an operational characterization of solvable terms, through the notion of head normal form, and a denotational model of Λ_⊕, itself induced by the type system, which equates all the unsolvable terms.
@InProceedings{ronchidellarocca_et_al:LIPIcs.FSCD.2020.1, author = {Ronchi Della Rocca, Simona and Dal Lago, Ugo and Faggian, Claudia}, title = {{Solvability in a Probabilistic Setting}}, booktitle = {5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)}, pages = {1:1--1:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-155-9}, ISSN = {1868-8969}, year = {2020}, volume = {167}, editor = {Ariola, Zena M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2020.1}, URN = {urn:nbn:de:0030-drops-123237}, doi = {10.4230/LIPIcs.FSCD.2020.1}, annote = {Keywords: Probabilistic Computation, Lambda Calculus, Solvability, Intersection Types} }
Feedback for Dagstuhl Publishing