Lê Thành Dung Nguyên

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 27

Top Topics

Regular Languages

Lambda Calculus

Top Venues

Log. Methods Comput. Sci.

Publications

Vincent Moreau, Lê Thành Dung Nguyên
Syntactically and Semantically Regular Languages of λ-Terms Coincide Through Logical Relations. CSL (2024)
Anupam Das, Damiano Mazza, Lê Thành Dung Nguyên, Noam Zeilberger
On the complexity of normalization for the planar λ-calculus. CoRR (2024)
Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski
Function Spaces for Orbit-Finite Sets. ICALP (2024)
Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski
Function spaces for orbit-finite sets. CoRR (2024)
Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic
Two-way automata and transducers with planar behaviours are aperiodic. CoRR (2023)
Mikolaj Bojanczyk, Lê Thành Dung Nguyên
Algebraic Recognition of Regular Functions. ICALP (2023)
Lê Thành Dung Nguyên
Simply typed convertibility is TOWER-complete even for safe lambda-terms. CoRR (2023)
Sandra Kiefer, Lê Thành Dung Nguyên, Cécilia Pradic
Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs. CoRR (2023)
Lê Thành Dung Nguyên, Lutz Straßburger
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic. Log. Methods Comput. Sci. 19 (4) (2023)
Vincent Moreau, Lê Thành Dung Nguyên
Syntactically and semantically regular languages of lambda-terms coincide through logical relations. CoRR (2023)
Lê Thành Dung Nguyên, Lutz Straßburger
BV and Pomset Logic Are Not the Same. CSL (2022)
Lê Thành Dung Nguyên, Lutz Straßburger
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic. CoRR (2022)
Lê Thành Dung Nguyên, Camille Noûs, Pierre Pradic
Comparison-free polyregular functions. CoRR (2021)
Lê Thành Dung Nguyên, Camille Noûs, Pierre Pradic
Comparison-Free Polyregular Functions. ICALP (2021)
Lê Thành Dung Nguyên
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix. Log. Methods Comput. Sci. 16 (1) (2020)
Lê Thành Dung Nguyên, Camille Noûs, Pierre Pradic
Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics. CoRR (2020)
Lê Thành Dung Nguyên, Pierre Pradic
Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic. ICALP (2020)
Lê Thành Dung Nguyên
Typed lambda-calculi and superclasses of regular functions. CoRR (2019)
Lê Thành Dung Nguyên
On the Elementary Affine Lambda-Calculus with and Without Fixed Points. DICE-FOPARA@ETAPS (2019)
Lê Thành Dung Nguyên, Pierre Pradic
From Normal Functors to Logarithmic Space Queries. ICALP (2019)
Lê Thành Dung Nguyên
Proof nets through the lens of graph theory: a compilation of remarks. CoRR (2019)
Lê Thành Dung Nguyên, Paolo Pistone, Thomas Seiller, Lorenzo Tortora de Falco
Finite semantics of polymorphism, complexity and the power of type fixpoints. CoRR (2019)
Lê Thành Dung Nguyên
When lattice cubes meet affine subspaces: a short note. CoRR (2019)
Lê Thành Dung Nguyên
Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix. CoRR (2019)
Lê Thành Dung Nguyên
Constrained path-finding and structure from acyclicity. CoRR (2019)
Lê Thành Dung Nguyên, Thomas Seiller
Coherent Interaction Graphs. Linearity-TLLA@FLoC (2018)
Lê Thành Dung Nguyên
Unique perfect matchings and proof nets. FSCD (2018)