Cover Image

A Strongly Normalising System of Dependent Types for Transparent and Opaque Probabilistic Computation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Genco, Francesco A.
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

A Logic of Knowledge and Justifications, with an Application to Computational Trust
by: Genco, Francesco A.
Published: (2024)

Strong Normalisation for Asynchronous Effects
by: Ahman, Danel, et al.
Published: (2026)

Normalisation for Negative Free Logics without and with Definite Descriptions
by: Kürbis, Nils
Published: (2024)

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

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

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2025)

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

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

A topological reading of inductive and coinductive definitions in Dependent Type Theory
by: Sabelli, Pietro
Published: (2024)

Reduction Free Normalisation for a proof irrelevant type of propositions
by: Coquand, Thierry
Published: (2021)

ODRL Policy Comparison Through Normalisation
by: Salas, Jaime Osvaldo, et al.
Published: (2026)

A Direct Characterisation of Logical Grounds and a Decidability Proof
by: Genco, Francesco A.
Published: (2025)

POPACheck: A Model Checker for Probabilistic Pushdown Automata
by: Pontiggia, Francesco, et al.
Published: (2025)

Are Dependent Types in Set Theory Feasible?
by: Yang, Yunsong, et al.
Published: (2026)

Evidence-Tracked Tape Semantics for Probabilistic Computation
by: Cohen, Liron, et al.
Published: (2026)

Compositional Interface Refinement Through Subtyping in Probabilistic Session Types
by: Blechschmidt, Paula
Published: (2025)

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

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

A Foundation for Differentiable Logics using Dependent Type Theory
by: Affeldt, Reynald, et al.
Published: (2026)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Impredicativity in Linear Dependent Type Theory
by: Speight, Sam, et al.
Published: (2026)

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
by: Chodil, Miroslav, et al.
Published: (2025)

Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)

Dependent Multiplicities in Dependent Linear Type Theory
by: Doré, Maximilian
Published: (2025)

Dependence Logics in Temporal Settings
by: Baltag, Alexandru, et al.
Published: (2022)

Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2026)

Towards a Proof System for Probabilistic Dynamic Logic
by: Johnsen, Einar Broch, et al.
Published: (2024)

Higher-Order Constrained Dependency Pairs for (Universal) Computability
by: Guo, Liye, et al.
Published: (2024)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

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

Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic (Extended Version)
by: Niederhauser, Johannes, et al.
Published: (2024)

DEKL 2.0: Trace-Indexed Knowledge Evolution in Dependent Type Theory
by: Peng, Chen
Published: (2026)

Fixed Point Theorems in Computability Theory
by: Terwijn, Sebastiaan A.
Published: (2024)

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

Probabilistic Verification for Modular Network-on-Chip Systems (extended version)
by: Waddoups, Nick, et al.
Published: (2025)

A Category-Theoretic Framework for Dependent Effect Systems
by: Kura, Satoshi, et al.
Published: (2026)

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