Lê Thành Dũng Nguyễn
Publications
Publications
|
|
Slightly Non-Linear Higher-Order Tree Transducers42nd 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⟩ |
|
|
Syntactically and Semantically Regular Languages of λ-Terms Coincide Through Logical Relations32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), Feb 2024, Naples, Italy. pp.40:1-40:22, ⟨10.4230/LIPIcs.CSL.2024.40⟩ |
|
|
Function Spaces for Orbit-Finite Sets51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.130⟩ |
|
|
Algebraic Recognition of Regular Functions50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Jul 2023, Paderborn, Germany. pp.117:1-117:19, ⟨10.4230/LIPIcs.ICALP.2023.117⟩ |
|
|
Comparison-free polyregular functionsInternational Colloquium on Automata, Languages and Programming 2021, Jul 2021, Glasgow, United Kingdom |
|
|
Implicit automata in typed λ-calculi I: aperiodicity in a non-commutative logic47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Jul 2020, Saarbrücken (virtual conference), Germany |
|
|
From normal functors to logarithmic space queries46th International Colloquium on Automata, Languages and Programming (ICALP 2019), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.123⟩ |
|
|
Unique perfect matchings and proof nets3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018), Jul 2018, Oxford, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2018.25⟩ |
|
|
Simply typed convertibility is TOWER-complete even for safe lambda-termsLogical Methods in Computer Science, 2024, 20 (3), pp.21:1-21:15. ⟨10.46298/LMCS-20(3:21)2024⟩ |
|
|
On the elementary affine λ-calculus with and without type fixpointsElectronic 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⟩ |
|
|
Finite semantics of polymorphism, complexity and the power of type fixpoints2019 |