Anupam Das

collaborators

2 papers

cs.CC2025

Prover-Adversary games for systems over (non-deterministic) branching programs

Anupam Das, Avgerinos Delkos

We introduce Pudlak-Buss style Prover-Adversary games to characterise proof systems reasoning over deterministic branching programs (BPs) and non-deterministic branching programs (…

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.

Prover-Adversary games for systems over (non-deterministic) branching programs

On the complexity of normalization for the planar λ-calculus

On the complexity of normalization for the planar $λ$ -calculus