A categorical setting for lower complexity
From MaRDI portal
Recommendations
- Categorical comprehensions and recursion
- An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras
- scientific article; zbMATH DE number 4033724
- scientific article; zbMATH DE number 4027427
- Aspects of categorical recursion theory
Cites work
- A categorical semantics for polarized MALL
- A new constructive logic: classic logic
- A new recursion-theoretic characterization of the polytime functions
- Focussing and proof construction
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 2079048 (Why is no real title available?)
- scientific article; zbMATH DE number 1552770 (Why is no real title available?)
- scientific article; zbMATH DE number 2087442 (Why is no real title available?)
- Linear types and non-size-increasing polynomial time computation.
- Monoidal categories with natural numbers object
- Polarized category theory, modules, and game semantics
- Polarized games
- Safe recursion revisited. I: Categorical semantics for lower complexity
- Strong functors and monoidal monads
- Structural induction and coinduction in a fibrational setting
Cited in
(3)
This page was built for publication: A categorical setting for lower complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178259)
