Lê Thành Dũng Nguyễn

Publications

Communication dans un congrès (8)

Slightly Non-Linear Higher-Order Tree Transducers Lê Thành Dũng Nguyễn,Gabriele Vanoni 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Jena, Germany. pp.68:1-68:20, ⟨10.4230/LIPIcs.STACS.2025.68⟩ Communication dans un congrès hal-04982237v1
Syntactically and Semantically Regular Languages of λ-Terms Coincide Through Logical Relations Vincent Moreau,Lê Thành Dũng Nguyễn 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), Feb 2024, Naples, Italy. pp.40:1-40:22, ⟨10.4230/LIPIcs.CSL.2024.40⟩ Communication dans un congrès hal-04447910v1
Function Spaces for Orbit-Finite Sets Mikołaj Bojańczyk,Lê Thành Dũng Nguyễn,Rafał Stefański 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.130⟩ Communication dans un congrès hal-04634408v1
Algebraic Recognition of Regular Functions Mikołaj Bojańczyk,Lê Thành Dũng Nguyễn 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Jul 2023, Paderborn, Germany. pp.117:1-117:19, ⟨10.4230/LIPIcs.ICALP.2023.117⟩ Communication dans un congrès hal-03985883v2
Comparison-free polyregular functions Lê Thành Dũng Nguyễn,Camille Noûs,Cécilia Pradic International Colloquium on Automata, Languages and Programming 2021, Jul 2021, Glasgow, United Kingdom Communication dans un congrès hal-02986228v3
Implicit automata in typed λ-calculi I: aperiodicity in a non-commutative logic Lê Thành Dũng Nguyễn,Cécilia Pradic 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Jul 2020, Saarbrücken (virtual conference), Germany Communication dans un congrès hal-02476219v3
From normal functors to logarithmic space queries Lê Thành Dũng Nguyễn,Cécilia Pradic 46th International Colloquium on Automata, Languages and Programming (ICALP 2019), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.123⟩ Communication dans un congrès hal-02024152v3
Unique perfect matchings and proof nets Lê Thành Dũng Nguyễn 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), Jul 2018, Oxford, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2018.25⟩ Communication dans un congrès hal-01692179v2

Article dans une revue (2)

Simply typed convertibility is TOWER-complete even for safe lambda-terms Lê Thành Dũng Nguyễn Logical Methods in Computer Science, 2024, 20 (3), pp.21:1-21:15. ⟨10.46298/LMCS-20(3:21)2024⟩ Article dans une revue hal-04688374v1
On the elementary affine λ-calculus with and without type fixpoints Lê Thành Dũng Nguyễn Electronic Proceedings in Theoretical Computer Science, 2019, Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis (DICE-FOPARA 2019), 298, pp.15-29. ⟨10.4204/EPTCS.298.2⟩ Article dans une revue hal-02153709v1

Pré-publication, Document de travail (1)

Finite semantics of polymorphism, complexity and the power of type fixpoints Lê Thành Dũng Nguyễn,Thomas Seiller,Paolo Pistone,Lorenzo Tortora de Falco 2019 Pré-publication, Document de travail hal-01979009v1