Coinduction in Flow: The Later Modality in Fibrations
From MaRDI portal
Publication:5875348
Recommendations
Cites work
- scientific article; zbMATH DE number 6680140 (Why is no real title available?)
- scientific article; zbMATH DE number 3825806 (Why is no real title available?)
- scientific article; zbMATH DE number 4047683 (Why is no real title available?)
- scientific article; zbMATH DE number 1032008 (Why is no real title available?)
- scientific article; zbMATH DE number 1064116 (Why is no real title available?)
- scientific article; zbMATH DE number 2087442 (Why is no real title available?)
- scientific article; zbMATH DE number 7297836 (Why is no real title available?)
- scientific article; zbMATH DE number 3346618 (Why is no real title available?)
- μ-Bicomplete Categories and Parity Games
- A Convenient Category for Higher-Order Probability Theory
- A Proof System for the Linear Time μ-Calculus
- A type theory for productive coprogramming via guarded recursion
- A very modal model of a modern, major, general type system
- Automated Reasoning with Analytic Tableaux and Related Methods
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Categorical logic and type theory
- Circular coinduction: a proof theoretical foundation
- Co-Logic Programming: Extending Logic Programming with Coinduction
- Coinduction All the Way Up
- Coinduction up-to in a fibrational setting
- Coinductive predicates and final sequences in a fibration
- Companions, codensity and causality
- Complete Lattices and Up-To Techniques
- Constructive completeness for the linear-time \(\mu \)-calculus
- Copatterns, programming infinite structures by observations
- Cyclic arithmetic is equivalent to Peano arithmetic
- Deforestation, program transformation, and cut-elimination
- Dependent inductive and coinductive types are fibrational dialgebras
- Enhanced coalgebraic bisimulation
- Fibered categories and the foundations of naive category theory
- First steps in synthetic guarded domain theory: step-indexing in the topos of trees
- Games for the -calculus
- Guarded cubical type theory: path equality for guarded recursion
- Guarded dependent type theory with coinductive types
- Guarded traced categories
- Indexed induction and coinduction, fibrationally
- Inductive types and type constraints in the second-order lambda calculus
- Initial algebras and terminal coalgebras in many-sorted sets
- Intensional type theory with guarded recursive types qua fixed points on universes
- Introduction to coalgebra. Towards mathematics of states and observation
- Lifting adjunctions to coalgebras to (re)discover automata constructions
- Monoidal company for accessible functors
- On the bisimulation proof method
- On traced monoidal closed categories
- Parameter free induction and provably total computable functions
- Parametric corecursion
- Probabilistic systems coalgebraically: a survey
- Productive coprogramming with guarded recursion
- Provability interpretations of modal logic
- Results on the propositional \(\mu\)-calculus
- Sequent Calculus in the Topos of Trees
- Sequent calculi for induction and infinite descent
- Stream differential equations: specification formats and solution methods
- Strong functors and monoidal monads
- Structural induction and coinduction in a fibrational setting
- Terminal coalgebras in well-founded set theory
- The power of parameterization in coinductive proof
- Transfinite step-indexing: decoupling concrete and logical steps
- Truly modular (co)datatypes for Isabelle/HOL
- Universal coalgebra: A theory of systems
- Łukasiewicz \(\mu\)-calculus
This page was built for publication: Coinduction in Flow: The Later Modality in Fibrations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875348)
