Image de couverture de livre

Stateful Realizers for Nonstandard Analysis

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dinis, Bruno, Miquey, Étienne
Format:	Preprint
Publié:	2022
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Syntactic Effectful Realizability in Higher-Order Logic
par: Cohen, Liron, et autres
Publié: (2025)

From Partial to Monadic: Combinatory Algebra with Effects
par: Cohen, Liron, et autres
Publié: (2025)

Realizing the totally unordered structure of ordinals
par: Fontanella, Laura, et autres
Publié: (2025)

The Arithmetical Hierarchy: A Realizability-Theoretic Perspective
par: Kihara, Takayuki
Publié: (2024)

Realizing the Maximal Analytic Display Fragment of Labeled Sequent Calculi for Tense Logics
par: Lyon, Tim S.
Publié: (2024)

Groupoidal Realizability for Intensional Type Theory
par: Speight, Sam
Publié: (2024)

Non-Termination of Logic Programs Using Patterns
par: Payet, Etienne
Publié: (2025)

Completeness of Synthesis under Realizability Assumptions using Superposition
par: Hajdu, Márton, et autres
Publié: (2026)

Reaching Classicality through Transitive Closure
par: Blomet, Quentin, et autres
Publié: (2025)

ocLTL: LTL Realizability and Synthesis Modulo ω-Categorical Structures
par: Asor, Ohad
Publié: (2026)

Realization of relational presheaves
par: Chamoun, Yorgo, et autres
Publié: (2025)

Parametric disjunctive timed networks
par: André, Étienne, et autres
Publié: (2025)

Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
par: André, Étienne, et autres
Publié: (2023)

$\text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity
par: Cohen, Liron, et autres
Publié: (2023)

An Analysis of Tennenbaum's Theorem in Constructive Type Theory
par: Hermes, Marc, et autres
Publié: (2023)

Semantical Analysis of Intuitionistic Modal Logics between CK and IK
par: de Groot, Jim, et autres
Publié: (2024)

Uniform Realizability Interpretations
par: Berger, Ulrich, et autres
Publié: (2026)

Realizability in Semantics-Guided Synthesis Done Eagerly
par: Meyer, Roland, et autres
Publié: (2024)

The Proof Analysis Problem
par: Arteche, Noel, et autres
Publié: (2025)

Unfoldings and coverings of weighted graphs
par: Courcelle, Bruno
Publié: (2022)

On describing trees and quasi-trees from their leaves
par: Courcelle, Bruno
Publié: (2025)

On first-order definable operations on relational structures
par: Courcelle, Bruno
Publié: (2026)

Formalizing UML State Machines for Automated Verification -- A Survey
par: André, Étienne, et autres
Publié: (2024)

Many-valued coalgebraic logic over semi-primal varieties
par: Kurz, Alexander, et autres
Publié: (2023)

Resource-Bounded Type Theory: Compositional Cost Analysis via Graded Modalities
par: Mannucci, Mirco A., et autres
Publié: (2025)

Resource-Bounded Martin-Löf Type Theory: Compositional Cost Analysis for Dependent Types
par: Mannucci, Mirco A., et autres
Publié: (2026)

Program Synthesis for Non-Linear Real Arithmetic: Going Beyond Realizability
par: Akshay, S., et autres
Publié: (2026)

A Guide to Krivine Realizability for Set Theory
par: Matthews, Richard
Publié: (2023)

An Algebraic Approach to Weighted Answer-set Programming
par: Coelho, Francisco, et autres
Publié: (2025)

Expiring opacity problems in parametric timed automata
par: André, Étienne, et autres
Publié: (2024)

Automated Theorem Proving for Prolog Verification
par: Mesnard, Fred, et autres
Publié: (2026)

Sequent Calculi for Data-Aware Modal Logics
par: Areces, Carlos, et autres
Publié: (2025)

Synthesis of Infinite State Systems
par: Drucker, Ohad, et autres
Publié: (2025)

Revisiting Stateful Partial-Order Reduction
par: Herbreteau, Frédéric, et autres
Publié: (2024)

Parameterized Infinite-State Reactive Synthesis
par: Maderbacher, Benedikt, et autres
Publié: (2025)

Explanations for Unrealizability of Infinite-State Safety Shields
par: Rodriguez, Andoni, et autres
Publié: (2025)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
par: Lin, Yi, et autres
Publié: (2024)

Infinite State Model Checking by Learning Transitive Relations
par: Frohn, Florian, et autres
Publié: (2025)

Multi-level Nonstandard Analysis and the Axiom of Choice
par: Hrbacek, Karel
Publié: (2024)

Localized Attractor Computations for Infinite-State Games (Full Version)
par: Schmuck, Anne-Kathrin, et autres
Publié: (2024)