Elementary complexity and geometry of interaction
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1342271
- scientific article; zbMATH DE number 1231531
- Linear logic by levels and bounded time complexity
- Realizability models and implicit complexity
- scientific article; zbMATH DE number 2182488
- scientific article; zbMATH DE number 922617
- scientific article; zbMATH DE number 1424049
- Propositional computability logic II
- The addition of bounded quantification and partial functions to a computational logic and its theorem prover
Cited in
(20)- Light types for polynomial time computation in lambda calculus
- Linear logic and elementary time
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time
- Stratified coherence spaces: A denotational semantics for light linear logic
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
- An abstract approach to stratification in linear logic
- A structural approach to reversible computation
- Logarithmic space and permutations
- Unary resolution: characterizing \textsc{Ptime}
- Memoryful geometry of interaction. II: Recursion and adequacy
- Interaction graphs: graphings
- On paths-based criteria for polynomial time complexity in proof-nets
- Dynamics of complexity of intersections
- scientific article; zbMATH DE number 1342271 (Why is no real title available?)
- scientific article; zbMATH DE number 6917940 (Why is no real title available?)
- A correspondence between maximal abelian sub-algebras and linear logic fragments
- Implicit computation complexity in higher-order programming languages
- Light logics and optimal reduction: completeness and complexity
- Principal types as partial involutions
- Two views on unification: terms as strategies
This page was built for publication: Elementary complexity and geometry of interaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708316)
