5 citations · 19 across the 10 of their papers we have counts for
Showing 2024 · cs.LOShow all
2 papers · 2 filters
cs.LO2024
On the complexity of normalization for the planar -calculus
Anupam Das, Damiano Mazza, Lê Thành Dũng Nguyên +1
We sketch a tentative proof of P-completeness for the -convertibility problem on untyped planar (a.k.a. ordered or non-commutative) -terms.
cs.LO2024
Function spaces for orbit-finite sets
Mikołaj Bojańczyk, Lê Thành Dũng Nguyên, Rafał Stefański
Orbit-finite sets are a generalisation of finite sets, and as such support many operations allowed for finite sets, such as pairing, quotienting, or taking subsets. However, they d…