Practical coinduction
From MaRDI portal
Recommendations
Cites work
- A fixpoint theorem for complete categories
- Circular coinduction: a proof theoretical foundation
- Co-induction in relational semantics
- Computing with capsules
- Efficient recursive subtyping
- Expressivity of coalgebraic modal logic: the limits and beyond
- Foundations of Software Science and Computational Structures
- Generic Trace Semantics via Coinduction
- scientific article; zbMATH DE number 1183236 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- Mechanizing coinduction and corecursion in higher-order logic
- Rank-1 Modal Logics Are Coalgebraic
- Specifying coalgebras with modal logic
- Structural induction and coinduction in a fibrational setting
- Universal coalgebra: A theory of systems
Cited in
(31)- Co-induction in relational semantics
- A co-induction principle for recursively defined domains
- Composition and decomposition of multiparty sessions
- Non-well-founded deduction for induction and coinduction
- Integrating induction and coinduction via closure operators and proof cycles
- How to reason coinductively informally
- Relational graph models at work
- A coinductive approach to real analysis
- Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
- Coinduction All the Way Up
- Shall we juggle, coinductively?
- Polymorphic higher-order termination
- A new coinductive confluence proof for infinitary lambda calculus
- scientific article; zbMATH DE number 7168147 (Why is no real title available?)
- Coinductive Proof Principles for Stochastic Processes
- Proof methods for corecursive programs
- Compositional coinduction with sized types
- Coinduction: automata, formal proof, companions (invited paper)
- scientific article; zbMATH DE number 7649963 (Why is no real title available?)
- A Theory of Formal Choreographic Languages
- Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
- Partially Typed Multiparty Sessions
- System \(F^\mu_\omega\) with context-free session types
- Partially typed multiparty sessions with internal delegation
- Monoidal streams for dataflow programming
- Checking equivalence in a non-strict language
- Coinductive streams in monoidal categories
- A contextual formalization of structural coinduction
- Open compliance in multiparty sessions with partial typing
- Strong induction is an up-to technique
- Computation by infinite descent made explicit
This page was built for publication: Practical coinduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361147)
