Basic category theory for computer scientists
From MaRDI portal
Cited in
(58)- Vivid: a framework for heterogeneous problem solving
- From environments to representations -- a mathematical theory of artificial perceptions
- A behavioural theory of first-order CML
- A computational framework for conceptual blending
- Combinatorial bitstring semantics for arbitrary logical fragments
- Embeddings between lattices of fuzzy sets: an application of closed-valued fuzzy sets
- A rational reconstruction of the domain of feature structures
- Data refinement, call by value and higher order programs
- Models of nondeterministic regular expressions
- Comprehensive systems: a formal foundation for multi-model consistency management
- Monadic vs adjoint decomposition
- Episodic memory: a hierarchy of spatiotemporal concepts
- Organizational invariance and metabolic closure: analysis in terms of \((M, R)\) systems
- Transformations of discrete closure systems
- Dynamic structural operational semantics
- MiniBrass: soft constraints for MiniZinc
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference
- Categorical approach to the construction of fuzzy graph grammars
- Why mathematics needs engineering
- Transformations of fuzzy graphs specified by FD-grammars
- Fibrations and universal view updatability
- An abstract interface to higher spin gauge field theory
- ASP, amalgamation, and the conceptual blending workflow
- Pullback Grammars Are Context-Free
- Big toy models. Representing physical systems as Chu spaces
- Two Cartesian closed categories of information algebras
- Sets and functions in theoretical physics
- A Finite Axiomatization of Nondeterministic Regular Expressions
- Extensional equality preservation and verified generic programming
- Towards multiple model synchronization with comprehensive systems
- Ring theoretical properties of epsilon-strongly graded rings and Leavitt path algebras
- Minimal fuzzy realization for fuzzy behaviour: a bicategory-theoretic approach
- THE DIRICHLET HOPF ALGEBRA OF ARITHMETICS
- Categories of Automata and Languages Based on a Complete Residuated Lattice
- Fuzzy Regular Languages Based on Residuated Lattice
- Graded monads and graded logics for the linear time -- branching time spectrum
- Context rewriting
- A categorical interpretation of Landin's correspondence principle
- On the category of \(L\)-fuzzy automata, coalgebras and dialgebras
- scientific article; zbMATH DE number 7809761 (Why is no real title available?)
- Pointfree expression and calculation: From quantification to temporal logic
- Termination of graph transformation systems using weighted subgraph counting
- Categorical approximation fixpoint theory
- A comparison of HOL and ALF formalizations of a categorical coherence theorem
- On L-fuzzy automata, coalgebras and dialgebras: associated categories and L-fuzzy topologies
- Nondeterminism and infinite computations in constraint programming
- Predicate transformers and higher-order programs
- Genetic programming + proof search = automatic improvement
- Hefty algebras: modular elaboration of higher-order effects
- A sheaf-theoretic approach to pattern matching and related problems
- Categorical semantics of compositional reinforcement learning
- Intersection types for a computational lambda-calculus with global state
- Analysis of research into the mathematical foundations of model-based systems engineering
- On compositions of (L-fuzzy) automata: a categorical approach
- On categories associated with L-valued fuzzy approximation spaces
- The universality of functions in the sciences at large and in computing
- Termination of graph transformation systems using weighted subgraph counting
- Functorial data migration
This page was built for publication: Basic category theory for computer scientists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023244)
