Cover Image

What does it take to certify a conversion checker?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Lennon-Bertrand, Meven
Format:	Preprint
Published:	2025
Subjects:	Programming Languages Logic in Computer Science D.3.1; F.3.2; F.3.3; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

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

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

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

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

Compile-Time Tensor Shape Checking via Staged Shape-Dependent Types
by: Suwa, Takashi, et al.
Published: (2026)

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

Explicit Weakening
by: Wadler, Philip
Published: (2024)

Nominal Algebraic-Coalgebraic Data Types, with Applications to Infinitary Lambda-Calculi
by: Cerda, Rémy
Published: (2025)

Bidirectional Interpolation for the Lambda-Calculus -- Revisiting and Formalising Craig-Čubrić Interpolation
by: Bertrand, Meven Lennon, et al.
Published: (2026)

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

Verified VCG and Verified Compiler for Dafny
by: Nezamabadi, Daniel, et al.
Published: (2025)

Probability and Angelic Nondeterminism with Multiset Semantics
by: Ong, Shawn, et al.
Published: (2024)

Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)

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

Modelling Distributed Applications with Mixed-Choice Stateful Typestates
by: Parrinha, Francisco, et al.
Published: (2026)

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

The Denotational Semantics of SSA
by: Ghalayini, Jad Elkhaleq, et al.
Published: (2024)

On Modular Termination Proofs of General Logic Programs
by: Bossi, Annalisa, et al.
Published: (2000)

Sequence-Based Abstract Interpretation of Prolog
by: Charlier, Baudouin Le, et al.
Published: (2000)

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

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

Fair Termination of Asynchronous Binary Sessions
by: Padovani, Luca, et al.
Published: (2025)

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

A note on occur-check (extended report)
by: Drabent, Włodzimierz
Published: (2022)

Proof-Carrying Neuro-Symbolic Code
by: Komendantskaya, Ekaterina
Published: (2025)

Modelling Recursion and Probabilistic Choice in Guarded Type Theory
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)

Forall-Exists Relational Verification by Filtering to Forall-Forall
by: Nagasamudram, Ramana, et al.
Published: (2025)

Bayesian Separation Logic
by: Ho, Shing Hin, et al.
Published: (2025)

Bisimilarity and Simulatability of Processes Parameterized by Join Interactions
by: Grabmayer, Clemens, et al.
Published: (2025)

Multisets and Distributions
by: Kozen, Dexter, et al.
Published: (2023)

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

Closure Conversion, Flat Environments, and the Complexity of Abstract Machines
by: Accattoli, Beniamino, et al.
Published: (2025)

Verifying Tree-Manipulating Programs via CHCs
by: Faella, Marco, et al.
Published: (2025)

Extending the Quantitative Pattern-Matching Paradigm
by: Alves, Sandra, et al.
Published: (2024)

Gradual Guarantee via Step-Indexed Logical Relations in Agda
by: Siek, Jeremy G.
Published: (2024)

Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops
by: Zaiser, Fabian, et al.
Published: (2024)

Intent-Driven Computing: A Computational Model for Governed Autonomous Systems
by: McCann, Alan L.
Published: (2026)

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