Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We introduce a coinductive definition of infinitary term rewriting. The setup is surprisingly simple, and has in contrast to the… 
2010
2010
It is possible to provide a proof for a coinductive type using a corecursive function coupled with a guardedness condition. The… 
2008
2008
In this paper we explore a shallow embedding of Cryptol in HOL-4 by providing a way to import Cryptol programs into HOL-4 so as… 
2007
2007
CIRC is an automated circular coinductive prover implemented as an extension of Maude. In this paper we extend CIRC with the… 
2005
2005
Parametric polymorphism in functional programming languages with explicit polymorphism is the property that polymorphic programs… 
1999
1997
1997
We extend Hagino's categorical datatypes with subtyping and a limited form of inheritance. The view of objects as coalgebras… 
1996
1996
We will present a syntactical proof of correctness and completeness of shared reduction. This work is an application of type… 
1993
1993
The consistency of the dynamic and static semantics for a small functional programming language was informally proved by R.Milner…