Cover Image

Syntactically and semantically regular languages of lambda-terms coincide through logical relations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Moreau, Vincent, Nguyên, Lê Thành Dũng
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science Formal Languages and Automata Theory Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Profinite trees, through Lawvere theories and the lambda-calculus
by: Moreau, Vincent
Published: (2024)

Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
by: Dartois, Luc, et al.
Published: (2026)

Slightly Non-Linear Higher-Order Tree Transducers
by: Nguyên, Lê Thành Dũng, et al.
Published: (2024)

A cartesian closed fibration of higher-order regular languages
by: Melliès, Paul-André, et al.
Published: (2026)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Positive and monotone fragments of FO and LTL
by: Kuperberg, Denis, et al.
Published: (2024)

Finding Regular Herbrand Models for CHCs using Answer Set Programming
by: Maire, Gregoire, et al.
Published: (2025)

A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes
by: Różowski, Wojciech, et al.
Published: (2026)

Parametrizing Reads-From Equivalence for Predictive Monitoring
by: Farzan, Azadeh, et al.
Published: (2026)

Weighted GKAT: Completeness and Complexity
by: Van Koevering, Spencer, et al.
Published: (2025)

Verifying Asynchronous Hyperproperties in Reactive Systems
by: Beutner, Raven, et al.
Published: (2025)

The Decision Problem for Regular First-Order Theories
by: Mathur, Umang, et al.
Published: (2024)

SuperDP: Differential Privacy Refutation via Supermartingales
by: Chatterjee, Krishnendu, et al.
Published: (2026)

Towards a Coq-verified Chain of Esterel Semantics
by: Berry, Gérard, et al.
Published: (2019)

Non-commutative linear logic fragments with sub-context-free complexity
by: Nishimiya, Yusaku, et al.
Published: (2025)

Deciding the synthesis problem for hybrid games through bisimulation
by: Dima, Catalin, et al.
Published: (2024)

Improving Reachability in Vector Addition Systems through Pumpability
by: Chen, Weijun, et al.
Published: (2026)

Two or three things I know about tree transducers
by: Nguyên, Lê Thành Dũng
Published: (2024)

A formal query language and automata model for aggregation in complex event recognition
by: Bourhis, Pierre, et al.
Published: (2026)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Word equations, constraints, and formal languages
by: Ciobanu, Laura
Published: (2024)

Counting and Sampling Traces in Regular Languages
by: de Colnet, Alexis, et al.
Published: (2025)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
by: Halftermeyer, Pierre
Published: (2026)

Slice closures of indexed languages and word equations with counting constraints
by: Ciobanu, Laura, et al.
Published: (2024)

A complete formalization of Fermat's Last Theorem for regular primes in Lean
by: Best, Alex, et al.
Published: (2024)

Relating Reversible Petri Nets and Reversible Event Structures, categorically
by: Melgratti, Hernán, et al.
Published: (2023)

Parikh's Theorem Made Symbolic
by: Hague, Matthew, et al.
Published: (2023)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Feasability of Learning Weighted Automata on a Semiring
by: Daviaud, Laure, et al.
Published: (2023)

Discounted-Sum Automata with Multiple Discount Factors
by: Boker, Udi, et al.
Published: (2023)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)