scientific article; zbMATH DE number 7376040

DOI10.4230/LIPIcs.ICALP.2018.113zbMath1499.68198arXiv1802.06283MaRDI QIDQ5002798

Justin Hsu, Gilles Barthe, Alexandra Silva, Alejandro Aguirre

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1802.06283

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

productivityprobabilistic programmingcoinduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Productivity of stream definitions
• Semantics of probabilistic programs
• Analyzing probabilistic pushdown automata
• Relational reasoning for Markov chains in a probabilistic guarded lambda calculus
• A productivity checker for logic programming
• Probabilistic Termination
• Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
• Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems
• Copatterns
• On the Hardness of Almost–Sure Termination
• The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types
• Probabilistic Termination by Monadic Affine Sized Typing
• Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
• Termination of Probabilistic Concurrent Program
• Stochastic invariants for probabilistic termination
• Data-Oblivious Stream Productivity
• Realization of Coinductive Types

This page was built for publication: