On the public citation graph

Category Theory and Computer Science

https://doi.org/10.1007/bfb0018340
0 signed · 62 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1998.2725openalex-snapshot
Structural Induction and Coinduction in a Fibrational Setting
inferred← citeshttps://doi.org/10.1006/inco.2001.2962openalex-snapshot
Bisimulation for Labelled Markov Processes
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_16openalex-snapshot
Observers, experiments, and agents: A comprehensive approach to parallelism
inferred← citeshttps://doi.org/10.1007/978-1-4471-3196-0_19openalex-snapshot
A Semantics for Relational Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_28openalex-snapshot
Generalizing over Several Learning Settings
inferred← citeshttps://doi.org/10.1007/bfb0000479openalex-snapshot
Span(Graph): A categorical algebra of transition systems
inferred← citeshttps://doi.org/10.1007/bfb0000480openalex-snapshot
Representing place/transition nets in Span(Graph)
inferred← citeshttps://doi.org/10.1016/0022-4049(91)90020-3openalex-snapshot
Accessible categories and models of linear logic
inferred← citeshttps://doi.org/10.1016/0022-4049(95)00160-3openalex-snapshot
Weakly distributive categories
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90023-7openalex-snapshot
Data structures and program transformation
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90076-6openalex-snapshot
Terminal coalgebras in well-founded set theory
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00105-7openalex-snapshot
On proof normalization in linear logic
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90060-4openalex-snapshot
Additions and corrections to “Terminal coalgebras in well-founded set theory”
inferred← citeshttps://doi.org/10.1016/b978-1-55860-203-8.50026-7openalex-snapshot
Evidential Reasoning in a Categorial Perspective: Conjunction and Disjunction of Belief Functions
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.028openalex-snapshot
A Coalgebraic Perspective on Monotone Modal Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.031openalex-snapshot
Trace Semantics for Coalgebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.043openalex-snapshot
Relating State-Based and Process-Based Concurrency through Linear Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.06.002openalex-snapshot
Modularity in Coalgebra
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.06.005openalex-snapshot
Some Properties and Some Problems on Set Functors
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.06.007openalex-snapshot
An Effective Coalgebraic Bisimulation Proof Method
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.015openalex-snapshot
Bisimulations Generated from Corecursive Equations
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.09.024openalex-snapshot
Realization of Coinductive Types
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.009openalex-snapshot
Nominal Lambda Calculus: An Internal Language for FM-Cartesian Closed Categories
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.10.015openalex-snapshot
The Coinductive Resumption Monad
inferred← citeshttps://doi.org/10.1016/j.ic.2003.08.001openalex-snapshot
On the call-by-value CPS transform and its semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2005.03.006openalex-snapshot
Distributive laws for the coinductive solution of recursive equations
inferred← citeshttps://doi.org/10.1016/j.ic.2008.11.008openalex-snapshot
Functional interpretations of linear and intuitionistic logic
inferred← citeshttps://doi.org/10.1016/j.ic.2012.05.001openalex-snapshot
Functorial data migration
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.12.001openalex-snapshot
From Lawvere to Brandenburger–Keisler: Interactive forms of diagonalization and self-reference
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.12.007openalex-snapshot
Relational presheaves, change of base and weak simulation
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.08.002openalex-snapshot
Relation lifting, a survey
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100942openalex-snapshot
Protocol choice and iteration for the free cornering
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.01.007openalex-snapshot
The converse of a stochastic relation
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.12.022openalex-snapshot
On coalgebra based on classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.06.002openalex-snapshot
Modular construction of complete coalgebraic logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.033openalex-snapshot
CPS-translation as adjoint
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.024openalex-snapshot
Coalgebras in functional programming and type theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.027openalex-snapshot
Modalities in the Stone age: A comparison of coalgebraic logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.004openalex-snapshot
Analytic functors between presheaf categories over groupoids
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00042-6openalex-snapshot
Coalgebraic logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00012-6openalex-snapshot
Representation of computations in concurrent automata by dependence orders
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00145-4openalex-snapshot
Representing inductively defined sets by wellorderings in Martin-Löf's type theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00160-0openalex-snapshot
May I borrow your logic? (Transporting logical structures along maps)
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00076-5openalex-snapshot
A fixpoint approach to finite delay and fairness
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80357-8openalex-snapshot
Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80365-7openalex-snapshot
Towards coalgebraic behaviourism
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80557-7openalex-snapshot
On Rational Monads and Free Iterative Theories
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80640-6openalex-snapshot
CoCasl at Work — Modelling Process Algebra
inferred← citeshttps://doi.org/10.1109/ase.1997.632830openalex-snapshot
Notes on refinement, interpolation and uniformity
inferred← citeshttps://doi.org/10.1109/icacte.2008.104openalex-snapshot
The Syntactic and Semantic Model of Web Services Composition Based Category
inferred← citeshttps://doi.org/10.1109/iccms.2009.82openalex-snapshot
Modeling and Consistency Checking Based on Category for Web Navigation Behavior
inferred← citeshttps://doi.org/10.1109/icsmc.1991.169911openalex-snapshot
Categorial approach to machine learning
inferred← citeshttps://doi.org/10.1109/icycs.2008.410openalex-snapshot
An Approach to Checking the Compatibility for Web Services Specification Based on the Typed Graph Category
inferred← citeshttps://doi.org/10.1109/tools.2000.891368openalex-snapshot
On mathematical foundations for business modeling
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1996.tb49173.xopenalex-snapshot
On Transition Systems and Non‐well‐founded Sets
inferred← citeshttps://doi.org/10.1145/3531130.3533365openalex-snapshot
Monoidal Streams for Dataflow Programming
inferred← citeshttps://doi.org/10.3182/20080706-5-kr-1001.00614openalex-snapshot
An Interpretation of Concurrent Hybrid Time Systems over Multi-clock Systems
inferred← citeshttps://doi.org/10.70930/tac/6tol3qmuopenalex-snapshot
The eventual image
inferred← citeshttps://doi.org/10.70930/tac/et1997rtopenalex-snapshot
Dialectica and Chu Constructions: Cousins?
inferred← citeshttps://doi.org/10.70930/tac/lx85zomdopenalex-snapshot
The 2-Chu-Dialectica construction and the polycategory of multivariable adjunctions
inferred← citeshttps://doi.org/10.70930/tac/oj2bs96hopenalex-snapshot
Introduction to Coalgebra
inferred← citeshttps://doi.org/10.70930/tac/z47tl0paopenalex-snapshot
A Parigot-style linear λ-calculus forFull intuitionistic Linear Logic
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.