Lê Thành Dung Nguyên

32 papers A* 5A 1B 3Journal 20Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
A finer reparameterisation theorem for MSO and FO queries on strings.
CoRR
Lê Thành Dung Nguyên, Pawel Parys
2025 A conf
Slightly Non-Linear Higher-Order Tree Transducers.
STACS
Lê Thành Dung Nguyên, Gabriele Vanoni
2025 J jnl
The structure of polynomial growth for tree automata/transducers and MSO set queries.
CoRR
Paul Gallot, Nathan Lhote, Lê Thành Dung Nguyên
2024 A* conf
Function Spaces for Orbit-Finite Sets.
ICALP
Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski
2024 J jnl
Function spaces for orbit-finite sets.
CoRR
Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski
2024 J jnl
On the complexity of normalization for the planar λ-calculus.
CoRR
Anupam Das, Damiano Mazza, Lê Thành Dung Nguyên, Noam Zeilberger
2024 J jnl
Simply typed convertibility is TOWER-complete even for safe lambda-terms.
Log. Methods Comput. Sci.
Lê Thành Dung Nguyên
2024 B conf
Syntactically and Semantically Regular Languages of λ-Terms Coincide Through Logical Relations.
CSL
Vincent Moreau, Lê Thành Dung Nguyên
2024 J jnl
Two or three things I know about tree transducers.
CoRR
Lê Thành Dung Nguyên
2023 J jnl
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic.
Log. Methods Comput. Sci.
Lê Thành Dung Nguyên, Lutz Straßburger
2023 A* conf
Algebraic Recognition of Regular Functions.
ICALP
Mikolaj Bojanczyk, Lê Thành Dung Nguyên
2023 J jnl
Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs.
CoRR
Sandra Kiefer, Lê Thành Dung Nguyên, Cécilia Pradic
2023 J jnl
Simply typed convertibility is TOWER-complete even for safe lambda-terms.
CoRR
Lê Thành Dung Nguyên
2023 J jnl
Syntactically and semantically regular languages of lambda-terms coincide through logical relations.
CoRR
Vincent Moreau, Lê Thành Dung Nguyên
2023 J jnl
Two-way automata and transducers with planar behaviours are aperiodic.
CoRR
Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic
2022 J jnl
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic.
CoRR
Lê Thành Dung Nguyên, Lutz Straßburger
2022 B conf
BV and Pomset Logic Are Not the Same.
CSL
Lê Thành Dung Nguyên, Lutz Straßburger
2021 — —
Automates implicites en logique linéaire et théorie catégorique des transducteurs. (Implicit automata in linear logic and categorical transducer theory).
Lê Thành Dung Nguyên
2021 A* conf
Comparison-Free Polyregular Functions.
ICALP
Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic
2021 J jnl
Comparison-free polyregular functions.
CoRR
Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic
2020 A* conf
Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic.
ICALP
Lê Thành Dung Nguyên, Cécilia Pradic
2020 J jnl
Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics.
CoRR
Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic
2020 J jnl
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix.
Log. Methods Comput. Sci.
Lê Thành Dung Nguyên
2019 J jnl
Constrained path-finding and structure from acyclicity.
CoRR
Lê Thành Dung Nguyên
2019 J jnl
Finite semantics of polymorphism, complexity and the power of type fixpoints.
CoRR
Lê Thành Dung Nguyên, Paolo Pistone, Thomas Seiller, Lorenzo Tortora de Falco
2019 A* conf
From Normal Functors to Logarithmic Space Queries.
ICALP
Lê Thành Dung Nguyên, Cécilia Pradic
2019 — conf
On the Elementary Affine Lambda-Calculus with and Without Fixed Points.
DICE-FOPARA@ETAPS
Lê Thành Dung Nguyên
2019 J jnl
Typed lambda-calculi and superclasses of regular functions.
CoRR
Lê Thành Dung Nguyên
2019 J jnl
Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix.
CoRR
Lê Thành Dung Nguyên
2019 J jnl
When lattice cubes meet affine subspaces: a short note.
CoRR
Lê Thành Dung Nguyên
2018 — conf
Coherent Interaction Graphs.
Linearity-TLLA@FLoC
Lê Thành Dung Nguyên, Thomas Seiller
2018 B conf
Unique perfect matchings and proof nets.
FSCD
Lê Thành Dung Nguyên