Cover Image

Infinitary Refinement Types for Temporal Properties in Scott Domains

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Riba, Colin, Kejikian, Alexandre
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science F.3.1; F.3.2; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Complete Finitary Refinement Type System for Scott-Open Properties
by: Riba, Colin, et al.
Published: (2026)

Separation Logic of Generic Resources via Sheafeology
by: van Starkenburg, Berend, et al.
Published: (2025)

Definitional Functoriality for Dependent (Sub)Types -- Extended version
by: Laurent, Théo, et al.
Published: (2023)

AdapTT: Functoriality for Dependent Type Casts
by: Adjedj, Arthur, et al.
Published: (2025)

Genericity Through Stratification
by: Arrial, Victor, et al.
Published: (2024)

What does it take to certify a conversion checker?
by: Lennon-Bertrand, Meven
Published: (2025)

Conformance Games for Graded Semantics
by: Forster, Jonas, et al.
Published: (2024)

Uniform Substitution for Differential Refinement Logic
by: Prebet, Enguerrand, et al.
Published: (2024)

Semantics out of context: nominal absolute denotations for first-order logic and computation
by: Gabbay, Murdoch J.
Published: (2013)

Node Replication: Theory And Practice
by: Kesner, Delia, et al.
Published: (2022)

Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
by: Prebet, Enguerrand, et al.
Published: (2026)

Interpreting De Finetti's theorem in the Category of Integrable Cones (long version)
by: Raphaëlle, Crubillé
Published: (2026)

One Energy Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics
by: Bisping, Benjamin, et al.
Published: (2024)

A Fibrational Perspective on Differential Linear Logic
by: Koleilat, Jad
Published: (2026)

On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
by: Lago, Ugo Dal, et al.
Published: (2026)

Relational Dualities and Bisimulation
by: Kozicki, Piotr, et al.
Published: (2026)

A Graded Modal Type Theory for Pulse Schedules
by: Adams, Robin, et al.
Published: (2025)

Simple Types for Polymorphic Functions
by: Jay, Barry, et al.
Published: (2026)

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

A Real-Analytic Approach to Differential-Algebraic Dynamic Logic
by: Hellwig, Jonathan, et al.
Published: (2025)

The General and Finite Satisfiability Problems for PCTL are Undecidable
by: Chodil, Miroslav, et al.
Published: (2024)

The Thins Ordering on Relations
by: Voermans, Ed, et al.
Published: (2024)

Diagonals and Block-Ordered Relations
by: Backhouse, Roland, et al.
Published: (2024)

The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra
by: Backhouse, Roland, et al.
Published: (2023)

Probabilistic Epistemic Dynamic Agentive Logic
by: Logan, Shay Allen
Published: (2026)

Intersection Types for a Computational Lambda-Calculus with Global State
by: de'Liguoro, Ugo, et al.
Published: (2021)

A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report
by: Klaus, Natalia, et al.
Published: (2026)

Internal Effectful Forcing in System T
by: Escardo, Martin H., et al.
Published: (2025)

A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
by: Barroso-Nascimento, Victor, et al.
Published: (2025)

Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
by: Waldinger, Richard
Published: (2025)

How to Verify a Turing Machine with Dafny
by: Lederer, Edgar F. A.
Published: (2026)

Extracting total Amb programs from proofs
by: Berger, Ulrich, et al.
Published: (2023)

The Lambda Calculus is Quantifiable
by: Maestracci, Valentin, et al.
Published: (2024)

Symmetries in Sorting
by: Choudhury, Vikraman, et al.
Published: (2025)

Safety, Relative Tightness and the Probabilistic Frame Rule
by: Jereb, Janez Ignacij, et al.
Published: (2025)

Relation-Algebraic Verification of Disjoint-Set Forests
by: Guttmann, Walter
Published: (2023)

Calculational Design of Hyperlogics by Abstract Interpretation
by: Cousot, Patrick, et al.
Published: (2024)

Abstract clones for abstract syntax
by: Arkor, Nathanael, et al.
Published: (2021)

LeanLTL: A unifying framework for linear temporal logics in Lean
by: Vin, Eric, et al.
Published: (2025)

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
by: Xu, Qiyuan, et al.
Published: (2024)