35 citations · 80 across the 25 of their papers we have counts for
4 papers · 1 filter
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME
Neil D. Jones, Siddharth Bhaskar, Cynthia Kop +1
Programming language concepts are used to give some new perspectives on a long-standing open problem: is logspace = ptime ?
The Power of Non-Determinism in Higher-Order Implicit Complexity
Cynthia Kop, Jakob Grue Simonsen
We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we consider cons-free programs of varying data orders,…
Complexity Hierarchies and Higher-order Cons-free Term Rewriting
Cynthia Kop, Jakob Grue Simonsen
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of the left-hand sides; the computational intuit…
Complexity Hierarchies and Higher-Order Cons-Free Rewriting
Cynthia Kop, Jakob Grue Simonsen
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of constructor terms in the left-hand side; the…