Categorical simulations

DOI10.1016/j.jpaa.2009.12.028zbMath1192.03020OpenAlexW4210692990MaRDI QIDQ964545

Pieter J. W. Hofstra, J. Robin B. Cockett

Publication date: 22 April 2010

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpaa.2009.12.028

zbMATH Keywords

abstract computabilitypartial combinatory algebrascategory of Turing categoriesfibrations of assembliesfree fibration monadsimulation between categories

Mathematics Subject Classification ID

Fibered categories (18D30) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (6)

Computability models over categories and presheaves ⋮ Unnamed Item ⋮ On the Semantics of Intensionality ⋮ Computability structures, simulations and realizability ⋮ Introduction to Turing categories ⋮ Aspects of Categorical Recursion Theory

Cites Work

• A categorical outlook on relational modalities and simulations
• Introduction to Turing categories
• Realizability. An introduction to its categorical side
• Restriction categories II: Partial map classification
• Developing theories of types and computability via realizability
• A categorical linear framework for Petri nets
• Ordered partial combinatory algebras
• Iterated realizability as a comma construction
• Restriction categories. I: Categories of partial maps
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Categorical simulations