CCSL
From MaRDI portal
Software:15889
swMATH3357MaRDI QIDQ15889FDOQ15889
Author name not available (Why is that?)
Cited In (23)
- A Single Complete Relational Rule for Coalgebraic Refinement
- Modal Operators for Coequations
- Title not available (Why is that?)
- A finite model construction for coalgebraic modal logic
- Coalgebraic Semantic Model for the Clock Constraint Specification Language
- 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.
- Algebraic-coalgebraic specification in CoCASL
- Greatest bisimulations for binary methods
- Recent Trends in Algebraic Development Techniques
- Expressivity of coalgebraic modal logic: the limits and beyond
- Towards weak bisimulation for coalgebras
- From Algebras and Coalgebras to Dialgebras
- 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
- Title not available (Why is that?)
- Behavioral abstraction is hiding information
- The temporal logic of coalgebras via Galois algebras
- Title not available (Why is that?)
- Genomic control of agent morphogenesis in a physically correct virtual environment
This page was built for software: CCSL
