Coinductive predicates and final sequences in a fibration
From MaRDI portal
Publication:265811
DOI10.1016/j.entcs.2013.09.014zbMath1334.68136OpenAlexW2139427429WikidataQ113317961 ScholiaQ113317961MaRDI QIDQ265811
Ichiro Hasuo, Toshiki Kataoka, Kenta Cho
Publication date: 12 April 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2013.09.014
Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical logic, topoi (03G30)
Related Items (7)
Coinductive predicates and final sequences in a fibration ⋮ Bisimulation as a logical relation ⋮ Generic weakest precondition semantics from monads enriched with order ⋮ Coinduction in Flow: The Later Modality in Fibrations ⋮ A general account of coinduction up-to ⋮ Fibrational bisimulations and quantitative reasoning ⋮ Coinductive predicates and final sequences in a fibration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coinductive predicates and final sequences in a fibration
- On the final sequence of a finitary set functor
- Maximal traces and path-based coalgebraic temporal logics
- Foundations of software science and computational structures. 15th international conference, FOSSACS 2012, held as part of the European joint conferences on theory and practice of software, ETAPS 2012, Tallinn, Estonia, March 24 -- April 1, 2012. Proceedings
- A congruence rule format for name-passing process calculi
- Constructive versions of Tarski's fixed point theorems
- Structural induction and coinduction in a fibrational setting
- Categorical logic and type theory
- On final coalgebras of continuous functors
- Universal coalgebra: A theory of systems
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
- Comparing operational models of name-passing process calculi
- Automata and fixed point logic: a coalgebraic perspective
- Inductive and Coinductive Components of Corecursive Functions in Coq
- Modular Games for Coalgebraic Fixed Point Logics
- Fibrational Induction Meets Effects
- A Coalgebraic Perspective on Minimization and Determinization
- The power of parameterization in coinductive proof
- Checking NFA equivalence with bisimulations up to congruence
- Relating coalgebraic notions of bisimulation
- Generic Forward and Backward Simulations II: Probabilistic Simulation
- Terminal Sequence Induction via Games
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- Algebraic laws for nondeterminism and concurrency
- Accessible Categories: The Foundations of Categorical Model Theory
- Coalgebraic Modal Logic Beyond Sets
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- A Categorical Model of the Fusion Calculus
- Generic Trace Semantics via Coinduction
- Indexed Induction and Coinduction, Fibrationally
- Applications of Metric Coinduction
This page was built for publication: Coinductive predicates and final sequences in a fibration
