DeepAI AI Chat
Log In Sign Up

Probabilistic Soft Type Assignment

by   Gianluca Curzi, et al.

We model randomized complexity classes in the style of Implicit Computational Complexity. We introduce PSTA, a probabilistic version of STA, the type-theoretical counterpart of Soft Linear Logic. PSTA is a type assignment for an extension of Simpson's Linear Lambda Calculus and its surface reduction, where Linear additives express random choice. Linear additives are weaker than the usual ones; they allow for duplications harmlessly affecting the computational cost of normalization. PSTA is sound and complete w.r.t. probabilistic polynomial time functions and characterizes the probabilistic complexity classes PP and BPP, the latter slightly less implicitly than PP.


page 1

page 2

page 3

page 4


Probabilistic Complexity Classes through Semantics

In a recent paper, the author has shown how Interaction Graphs models fo...

Type Assignment for the Computational lambda-Calculus

We study polymorphic type assignment systems for untyped lambda-calculi ...

Typed lambda-calculi and superclasses of regular functions

We propose to use Church encodings in typed lambda-calculi as the basis ...

A type-assignment of linear erasure and duplication

We introduce LEM, a type-assignment system for the linear λ-calculus tha...

Systematic Translation of Formalizations of Type Theory from Intrinsic to Extrinsic Style

Type theories can be formalized using the intrinsically (hard) or the ex...

Linear Additives

We introduce 𝖫𝖠𝖬, a subsystem of 𝖨𝖬𝖠𝖫𝖫_2 with restricted additive rules ...

On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments (Long Version)

A system of session types is introduced as induced by a Curry Howard cor...