Coinductive predicates and final sequences in a fibration
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 575948 (Why is no real title available?)
- scientific article; zbMATH DE number 1086721 (Why is no real title available?)
- scientific article; zbMATH DE number 2087427 (Why is no real title available?)
- scientific article; zbMATH DE number 1840601 (Why is no real title available?)
- A Coalgebraic Perspective on Minimization and Determinization
- A categorical model of the fusion calculus
- A congruence rule format for name-passing process calculi
- Accessible Categories: The Foundations of Categorical Model Theory
- Algebraic laws for nondeterminism and concurrency
- Automata and fixed point logic: a coalgebraic perspective
- Categorical logic and type theory
- Checking NFA equivalence with bisimulations up to congruence
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
- Coalgebraic modal logic beyond sets
- Coinductive predicates and final sequences in a fibration
- Comparing operational models of name-passing process calculi
- Constructive versions of Tarski's fixed point theorems
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- Fibrational induction meets effects
- 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. Proceedi
- Generic Trace Semantics via Coinduction
- Generic forward and backward simulations. II: Probabilistic simulation
- Indexed induction and coinduction, fibrationally
- Inductive and coinductive components of corecursive functions in Coq
- Maximal traces and path-based coalgebraic temporal logics
- Modal logics and mu-calculi: An introduction
- Modular games for coalgebraic fixed point logics
- On final coalgebras of continuous functors
- On the final sequence of a finitary set functor
- Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Relating coalgebraic notions of bisimulation
- Structural induction and coinduction in a fibrational setting
- Terminal Sequence Induction via Games
- The power of parameterization in coinductive proof
- Trace semantics for coalgebras
- Universal coalgebra: A theory of systems
Cited in
(7)- Coinductive predicates and final sequences in a fibration
- Coinduction in Flow: The Later Modality in Fibrations
- Bisimulation as a logical relation
- Generic weakest precondition semantics from monads enriched with order
- Coinductive predicates and final sequences in a fibration
- Fibrational bisimulations and quantitative reasoning
- A general account of coinduction up-to
This page was built for publication: Coinductive predicates and final sequences in a fibration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265811)
