Cited in
(27)- From algebras and coalgebras to dialgebras
- A finite model construction for coalgebraic modal logic
- Coalgebras for binary methods: Properties of bisimulations and invariants
- Global semantic typing for inductive and coinductive computing
- On the algebraic structure of declarative programming languages
- Modal operators and the formal dual of Birkhoffs completeness theorem This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction of Dana Scott.
- Imperative object-based calculi in co-inductive type theories
- The coinductive approach to verifying cryptographic protocols.
- Hiord
- CoCasl
- GenCCSL
- TimeSquare
- Modal operators for coequations
- Algebraic-coalgebraic specification in CoCASL
- Greatest bisimulations for binary methods
- Expressivity of coalgebraic modal logic: the limits and beyond
- Towards weak bisimulation for coalgebras
- A syntactical approach to weak (bi-)simulation for coalgebras
- Many-sorted coalgebraic modal logic: A model-theoretic study
- Foundations of Software Science and Computational Structures
- A single complete relational rule for coalgebraic refinement
- Behavioral abstraction is hiding information
- scientific article; zbMATH DE number 4219175 (Why is no real title available?)
- Coalgebraic semantic model for the clock constraint specification language
- Genomic control of agent morphogenesis in a physically correct virtual environment
- The temporal logic of coalgebras via Galois algebras
- scientific article; zbMATH DE number 2087434 (Why is no real title available?)
This page was built for software: CCSL
