default search action
Lê Thành Dung Nguyên
Person information
- affiliation: École normale supérieure de Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Lê Thành Dung Nguyên
:
Simply typed convertibility is TOWER-complete even for safe lambda-terms. Log. Methods Comput. Sci. 20(3) (2024) - [c10]Vincent Moreau, Lê Thành Dung Nguyên:
Syntactically and Semantically Regular Languages of λ-Terms Coincide Through Logical Relations. CSL 2024: 40:1-40:22 - [c9]Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski:
Function Spaces for Orbit-Finite Sets. ICALP 2024: 130:1-130:20 - [i15]Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski:
Function spaces for orbit-finite sets. CoRR abs/2404.05265 (2024) - [i14]Anupam Das, Damiano Mazza, Lê Thành Dung Nguyên, Noam Zeilberger:
On the complexity of normalization for the planar λ-calculus. CoRR abs/2404.05276 (2024) - [i13]Lê Thành Dung Nguyên:
Two or three things I know about tree transducers. CoRR abs/2409.03169 (2024) - 2023
- [j2]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) - [c8]Mikolaj Bojanczyk, Lê Thành Dung Nguyên:
Algebraic Recognition of Regular Functions. ICALP 2023: 117:1-117:19 - [i12]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 abs/2301.09234 (2023) - [i11]Lê Thành Dung Nguyên:
Simply typed convertibility is TOWER-complete even for safe lambda-terms. CoRR abs/2305.12601 (2023) - [i10]Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic:
Two-way automata and transducers with planar behaviours are aperiodic. CoRR abs/2307.11057 (2023) - [i9]Vincent Moreau, Lê Thành Dung Nguyên:
Syntactically and semantically regular languages of lambda-terms coincide through logical relations. CoRR abs/2308.00198 (2023) - 2022
- [c7]Lê Thành Dung Nguyên
BV and Pomset Logic Are Not the Same. CSL 2022: 32:1-32:17 - [i8]Lê Thành Dung Nguyên, Lutz Straßburger:
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic. CoRR abs/2209.07825 (2022) - 2021
- [b1]Lê Thành Dung Nguyên:
Automates implicites en logique linéaire et théorie catégorique des transducteurs. (Implicit automata in linear logic and categorical transducer theory). Paris 13 University, Villetaneuse, France, 2021 - [c6]Lê Thành Dung Nguyên
Comparison-Free Polyregular Functions. ICALP 2021: 139:1-139:20 - [i7]Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic:
Comparison-free polyregular functions. CoRR abs/2105.08358 (2021) - 2020
- [j1]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) - [c5]Lê Thành Dung Nguyên
Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic. ICALP 2020: 135:1-135:20 - [i6]Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic:
Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics. CoRR abs/2008.01050 (2020)
2010 – 2019
- 2019
- [c4]Lê Thành Dung Nguyên
From Normal Functors to Logarithmic Space Queries. ICALP 2019: 123:1-123:15 - [c3]Lê Thành Dung Nguyên
On the Elementary Affine Lambda-Calculus with and Without Fixed Points. DICE-FOPARA@ETAPS 2019: 15-29 - [i5]Lê Thành Dung Nguyên:
Constrained path-finding and structure from acyclicity. CoRR abs/1901.07028 (2019) - [i4]Lê Thành Dung Nguyên:
Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix. CoRR abs/1901.10247 (2019) - [i3]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 abs/1902.00196 (2019) - [i2]Lê Thành Dung Nguyên:
Typed lambda-calculi and superclasses of regular functions. CoRR abs/1907.00467 (2019) - [i1]Lê Thành Dung Nguyên:
When lattice cubes meet affine subspaces: a short note. CoRR abs/1909.03542 (2019) - 2018
- [c2]Lê Thành Dung Nguyên
Unique perfect matchings and proof nets. FSCD 2018: 25:1-25:20 - [c1]Lê Thành Dung Nguyên
Coherent Interaction Graphs. Linearity-TLLA@FLoC 2018: 104-117
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: