:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Blechschmidt, Paula
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2509.16228
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fair Asynchronous Session Subtyping
by: Bravetti, Mario, et al.
Published: (2021)

Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System
by: Kura, Satoshi, et al.
Published: (2024)

On Asynchronous Multiparty Session Types for Federated Learning
by: Prokić, Ivan, et al.
Published: (2025)

FTMPST: Fault-Tolerant Multiparty Session Types
by: Peters, Kirstin, et al.
Published: (2022)

Comparing Session Type Systems derived from Linear Logic
by: Heuvel, Bas van den, et al.
Published: (2024)

Linear Contextual Metaprogramming and Session Types
by: Ângelo, Pedro, et al.
Published: (2024)

Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT
by: Lommen, Nils, et al.
Published: (2024)

Resource-Bounded Martin-Löf Type Theory: Compositional Cost Analysis for Dependent Types
by: Mannucci, Mirco A., et al.
Published: (2026)

Compositional Reasoning for Probabilistic Automata with Uncertainty
by: Mertens, Hannah, et al.
Published: (2026)

Timeout Asynchronous Session Types: Safe Asynchronous Mixed-Choice For Timed Interactions
by: Pears, Jonah, et al.
Published: (2024)

To Zip Through the Cost Analysis of Probabilistic Programs
by: Hetzenberger, Matthias, et al.
Published: (2025)

Crash-Stop Failures in Asynchronous Multiparty Session Types
by: Barwell, Adam D., et al.
Published: (2023)

Predicate Subtypes in VerCors
by: Dubbeling, Tycho, et al.
Published: (2026)

Resource-Bounded Type Theory: Compositional Cost Analysis via Graded Modalities
by: Mannucci, Mirco A., et al.
Published: (2025)

Compositional Reasoning for Parametric Probabilistic Automata
by: Mertens, Hannah, et al.
Published: (2025)

Dependent Type Refinements for Futures
by: Somayyajula, Siva, et al.
Published: (2023)

A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs
by: Genco, Francesco A., et al.
Published: (2023)

Regrading Policies for Flexible Information Flow Control in Session-Typed Concurrency
by: Derakhshan, Farzaneh, et al.
Published: (2024)

Fault-Tolerant Multiparty Session Types with Global Escape Loops
by: Bartl, Lukas, et al.
Published: (2025)

Order-Sorted Intensional Logic: Expressing Subtyping Polymorphism with Typing Assertions and Quantification over Concepts
by: Marković, Đorđe, et al.
Published: (2025)

A Strongly Normalising System of Dependent Types for Transparent and Opaque Probabilistic Computation
by: Genco, Francesco A.
Published: (2024)

Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
by: Li, Kwing Hei, et al.
Published: (2025)

Towards Multiparty Session Types for Highly-Concurrent and Fault-Tolerant Web Applications
by: Casetta, Richard, et al.
Published: (2026)

A Dual-Threshold Probabilistic Knowing Value Logic
by: Wang, Shanxia
Published: (2026)

Modular Multiparty Sessions with Mixed Choice
by: Barbanera, Franco, et al.
Published: (2025)

Asynchronous Multiparty Sessions with Mixed Choice
by: Barbanera, Franco, et al.
Published: (2026)

Partial Typing for Asynchronous Multiparty Sessions
by: Barbanera, Franco, et al.
Published: (2024)

A Session Type System for Asynchronous Unreliable Broadcast Communication
by: Kouzapas, Dimitrios, et al.
Published: (2019)

Quantum Bayesian Networks: Compositionality and Typing via Linear Logic
by: Di Guardia, Rémi, et al.
Published: (2026)

A Type Theory for Probabilistic and Bayesian Reasoning
by: Adams, Robin, et al.
Published: (2015)

On Small Types in Univalent Foundations
by: de Jong, Tom, et al.
Published: (2021)

On Probabilistic and Causal Reasoning with Summation Operators
by: Ibeling, Duligur, et al.
Published: (2024)

Primitive Recursive Dependent Type Theory
by: Buchholtz, Ulrik, et al.
Published: (2024)

Separation and Encodability in Mixed Choice Multiparty Sessions (Technical Report)
by: Peters, Kirstin, et al.
Published: (2024)

Checking Trustworthiness of Probabilistic Computations in a Typed Natural Deduction System
by: D'Asaro, Fabio Aurelio, et al.
Published: (2022)

Basis-Sensitive Quantum Typing via Realisability
by: Díaz-Caro, Alejandro, et al.
Published: (2025)

An Analysis of Tennenbaum's Theorem in Constructive Type Theory
by: Hermes, Marc, et al.
Published: (2023)

Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks
by: Heuvel, Bas van den, et al.
Published: (2021)

A Naive Encoding of Russell's Paradox in Type Theory
by: Qu, Zhuoyuan
Published: (2025)

Non-Derivability Results in Polymorphic Dependent Type Theory
by: Geuvers, Herman
Published: (2026)