Probabilistic Termination by Monadic Affine Sized Typing | Zendy

Ugo Dal Lago | Zendy; Charles Grellois | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Probabilistic Termination by Monadic Affine Sized Typing

Author(s) -

Ugo Dal Lago,

Charles Grellois

Publication year - 2019

Publication title -

acm transactions on programming languages and systems

Language(s) - Uncategorized

Resource type - Journals

SCImago Journal Rank - 0.233

H-Index - 70

eISSN - 1558-4593

pISSN - 0164-0925

DOI - 10.1145/3293605

Subject(s) - soundness , affine transformation , probabilistic logic , normalization (sociology) , computer science , normalization property , type (biology) , type inference , theoretical computer science , mathematics , algorithm , programming language , artificial intelligence , pure mathematics , inference , ecology , sociology , anthropology , biology

We introduce a system of monadic affine sized types, which substantially generalizes usual sized types and allows in this way to capture probabilistic higher-order programs that terminate almost su...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research