Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Proof Principles for Datatypes with Iterated Recursion
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
On final coalgebras of continuous functors
Theoretical Computer Science - Category theory and computer science
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
On the final sequence of a finitary set functor
Theoretical Computer Science
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning)
Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning)
Coalgebraic Modal Logic Beyond Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Inductive and Coinductive Components of Corecursive Functions in Coq
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Games for Coalgebraic Fixed Point Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A congruence rule format for name-passing process calculi
Information and Computation
Terminal Sequence Induction via Games
Logic, Language, and Computation
Trace Semantics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
EXPTIME tableaux for the coalgebraic µ-calculus
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Generic forward and backward simulations II: probabilistic simulation
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
The Computer Journal
Indexed induction and coinduction, fibrationally
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Fibrational induction meets effects
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
The power of parameterization in coinductive proof
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
Coinductive predicates express persisting ''safety'' specifications of transition systems. Previous observations by Hermida and Jacobs identify coinductive predicates as suitable final coalgebras in a fibration-a categorical abstraction of predicate logic. In this paper we follow the spirit of a seminal work by Worrell and study final sequences in a fibration. Our main contribution is to identify some categorical ''size restriction'' axioms that guarantee stabilization of final sequences after @w steps. In its course we develop a relevant categorical infrastructure that relates fibrations and locally presentable categories, a combination that does not seem to be studied a lot. The genericity of our fibrational framework can be exploited for: binary relations (i.e. the logic of ''binary predicates'') for which a coinductive predicate is bisimilarity; constructive logics (where interests are growing in coinductive predicates); and logics for name-passing processes.