Computational Complexity Via Finite Types
From MaRDI portal
Recommendations
- Expressing computational complexity in constructive type theory
- scientific article; zbMATH DE number 1414307
- Complexity of type inference
- scientific article; zbMATH DE number 1870418
- scientific article; zbMATH DE number 65741
- The complexity types of computable sets
- Computations on types
- scientific article; zbMATH DE number 66471
- scientific article; zbMATH DE number 4053608
- scientific article; zbMATH DE number 4114622
Cites work
- scientific article; zbMATH DE number 19768 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 2079048 (Why is no real title available?)
- scientific article; zbMATH DE number 806752 (Why is no real title available?)
- A Modular Formalisation of Finite Group Theory
- A concrete framework for environment machines
- A machine-checked proof of the odd order theorem
- A new recursion-theoretic characterization of the polytime functions
- Alternation
- An abstract framework for environment machines
- An implicit characterization of PSPACE
- An introduction to small scale reflection in Coq
- Canonical Big Operators
- Characterizing complexity classes by general recursive definitions in higher types
- Characterizing complexity classes by higher type primitive recursive definitions
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
- Finite model theory and its applications.
- Formal proof - the four color theorem
- Guest editorial: Special issue on implicit computational complexity
- Intuitionistic light affine logic
- Light linear logic
- Packaging Mathematical Structures
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Relationships between nondeterministic and deterministic tape complexities
- Soft linear logic and polynomial time
- Tailoring recursion for complexity
- The Matita interactive theorem prover
- The expressive power of higher-order types or, life without CONS
- The strength of non-size increasing computation
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(12)- Logical Approaches to Computational Barriers
- A note on complexity measures for inductive classes in constructive type theory
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
- scientific article; zbMATH DE number 5622695 (Why is no real title available?)
- On the expressive power of finitely typed and universally polymorphic recursive procedures
- The complexity types of computable sets
- Theories with self-application and computational complexity.
- Computations on types
- scientific article; zbMATH DE number 1424029 (Why is no real title available?)
- Uncertainty representation in dynamical systems using rough set theory
- Computing in Finite Time
- scientific article; zbMATH DE number 1870418 (Why is no real title available?)
This page was built for publication: Computational Complexity Via Finite Types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946764)
