Aspects of categorical recursion theory
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to history and biography (01-01) General histories, source books (01A05) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computational methods for problems pertaining to category theory (18-08) Classical models of computation (Turing machines, etc.) (68Q04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to quantum theory (81-01) Quantum computation (81P68) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Abstract: We present a survey of some developments in the general area of category-theoretic approaches to the theory of computation, with a focus on topics and ideas particularly close to the interests of Jim Lambek.
Recommendations
Cites work
- A categorical model for the geometry of interaction
- A category-theoretic characterization of functional completeness
- A characterization of the left exact categories whose exact completions are toposes
- A fixpoint theorem for complete categories
- A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
- AN ELEMENTARY THEORY OF THE CATEGORY OF SETS
- An exactification of the monoid of primitive recursive functions
- An existence theorem for recursion categories
- An induction principle for consequence in arithmetic universes
- An internal language for autonomous categories
- Artin glueing
- Basic subtoposes of the effective topos
- Cartesian categories with natural numbers object
- Categorical simulations
- Categories for computation in context and unified logic
- Characterizing partitioned assemblies and realizability toposes
- Classical recursion theory. The theory of functions and sets of natural numbers
- Coherence in closed categories
- Colimit completions and the effective topos
- Computability and Logic
- Computability and Recursion
- Cut elimination in categories
- Deductive systems and categories
- Diagram chasing in Mal'cev categories
- Dominical categories: recursion theory without elements
- Feedback, trace and fixed-point semantics
- Functional completeness of cartesian categories
- Generalized Banach-Mazur functionals in the topos of recursive sets
- Higher-order computability
- How to Program an Infinite Abacus
- scientific article; zbMATH DE number 3645093 (Why is no real title available?)
- scientific article; zbMATH DE number 5695342 (Why is no real title available?)
- scientific article; zbMATH DE number 3811568 (Why is no real title available?)
- scientific article; zbMATH DE number 3825806 (Why is no real title available?)
- scientific article; zbMATH DE number 3944108 (Why is no real title available?)
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 3967883 (Why is no real title available?)
- scientific article; zbMATH DE number 4061468 (Why is no real title available?)
- scientific article; zbMATH DE number 3700811 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 48365 (Why is no real title available?)
- scientific article; zbMATH DE number 3556031 (Why is no real title available?)
- scientific article; zbMATH DE number 3573844 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1229489 (Why is no real title available?)
- scientific article; zbMATH DE number 1024333 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 4122189 (Why is no real title available?)
- scientific article; zbMATH DE number 1841819 (Why is no real title available?)
- scientific article; zbMATH DE number 812861 (Why is no real title available?)
- scientific article; zbMATH DE number 2204752 (Why is no real title available?)
- scientific article; zbMATH DE number 3216998 (Why is no real title available?)
- scientific article; zbMATH DE number 3316072 (Why is no real title available?)
- scientific article; zbMATH DE number 3335016 (Why is no real title available?)
- scientific article; zbMATH DE number 3346618 (Why is no real title available?)
- scientific article; zbMATH DE number 3385865 (Why is no real title available?)
- scientific article; zbMATH DE number 3411260 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Introduction to Turing categories
- Intuitionist type theory and the free topos
- Kleene computable functionals and the higher order existence property
- Languages for monoidal categories
- LCF considered as a programming language
- Linear logic
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Monoidal categories with natural numbers object
- Natural deduction and coherence for weakly distributive categories
- On the interpretation of intuitionistic number theory
- On the ubiquity of certain total type structures
- Ordered partial combinatory algebras
- Partial recursive functions and finality
- Proof-net categories
- Proof-theoretical coherence
- Range categories II: Towards regularity
- Range categories. I: General theory
- Realizability models for BLL-like languages
- Realizability. An introduction to its categorical side
- Realizability: a historical essay
- Recursive Functionals and Quantifiers of Finite Types I
- Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus
- Recursively enumerable sets of positive integers and their decision problems
- Regular and exact completions
- Relations in operational categories
- Relative computability in the effective topos
- Restriction categories. I: Categories of partial maps
- Safe recursion with higher types and BCK-algebra
- Some free constructions in realizability and proof theory
- Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The Mathematics of Sentence Structure
- The structure of free closed categories
- Total maps of Turing categories
- Towards a typed geometry of interaction
- Traced monoidal categories
- Tripos theory
- Unique decomposition categories, Geometry of Interaction and combinatory logic
- Unitary theories, unitary categories
- Why commutative diagrams coincide with equivalent proofs
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(17)- Formalizing abstract computability: Turing categories in Coq
- Axiomatizing iteration categories
- Categorical comprehensions and recursion
- A categorical setting for lower complexity
- An existence theorem for recursion categories
- scientific article; zbMATH DE number 3901002 (Why is no real title available?)
- scientific article; zbMATH DE number 3950509 (Why is no real title available?)
- scientific article; zbMATH DE number 4033724 (Why is no real title available?)
- scientific article; zbMATH DE number 980656 (Why is no real title available?)
- Categorical characterizations of the natural numbers require primitive recursion
- Theoretical computer science for the working category theorist
- Algebra and Coalgebra in Computer Science
- Samson Abramsky on logic and structure in computer science and beyond
- Categorical structure in coherent theory of arithmetic
- Primitive recursive dependent type theory
- A categorial approach to the theory of computation
- Introduction to Turing categories
This page was built for publication: Aspects of categorical recursion theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014598)
