Cover Image

A Complete Finitary Refinement Type System for Scott-Open Properties

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Riba, Colin, Donadille, Adam
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science F.2.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

Infinitary Refinement Types for Temporal Properties in Scott Domains
by: Riba, Colin, et al.
Published: (2025)

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

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

Interpreting De Finetti's theorem in the Category of Integrable Cones (long version)
by: Raphaëlle, Crubillé
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)

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

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

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

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

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)

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

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

A Coherence Construction for the Propositional Universe
by: Huang, Xu
Published: (2024)

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

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

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

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

Polynomial-time Tractable Problems over the $p$-adic Numbers
by: Fehm, Arno, et al.
Published: (2025)

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

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

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

A Resolution-Based Interactive Proof System for UNSAT
by: Czerner, Philipp, et al.
Published: (2024)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)

On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)

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

Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)

On the Realizability of Prime Conjectures in Heyting Arithmetic
by: Rosko, Milan
Published: (2025)

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

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

Two-Level Type Theory and Applications
by: Annenkov, Danil, et al.
Published: (2017)

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

Probabilistic Shoenfield Machines
by: Bujok, Maksymilian, et al.
Published: (2024)

Generating Higher Identity Proofs in Homotopy Type Theory
by: Benjamin, Thibaut
Published: (2024)

A Coq-based Axiomatization of Tarski's Mereogeometry
by: Barlatier, Patrick, et al.
Published: (2025)

Implementing Dependent Type Theory Inhabitation and Unification
by: Norman, Chase, et al.
Published: (2026)

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

Branching Bisimilarity for Processes with Time-outs
by: Reghem, Gaspard, et al.
Published: (2024)

Concrete Branching Bisimilarity for Processes with Time-outs
by: Reghem, Gaspard, et al.
Published: (2024)