Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Coinduction

Known as: Co-data (computer science), Co-induction, Coinductive 
In computer science, coinduction is a technique for defining and proving properties of systems of concurrent interacting objects. Coinduction is the… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Induction is a well-established proof principle that is taught in most undergraduate programs in mathematics and computer science… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Cryptosystems I.- On Ideal Lattices and Learning with Errors over Rings.- Fully Homomorphic Encryption over the Integers… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The origins of bisimulation and bisimilarity are examined, in the three fields where they have been independently discovered… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Trace semantics has been defined for various kinds of state-based systems, notably with different forms of branching such as non… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper introduces $\lambda^\widehat$, a simply typed lambda calculus supporting inductive types and recursive function… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Author(s): Khovanov, Mikhail | Abstract: We explain how rank two Frobenius extensions of commutative rings lead to link homology… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present a logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems. In addition… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We present a categorical logic formulation of induction and coinduction principles for reasoning about inductively and… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Abstract Morris-style contextual equivalence — invariance of termination under any context of ground type — is the usual notion… Expand
Is this relevant?