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… 
2012
2012
Relation Transition Systems (RTSs) have recently been proposed as a foundation for reasoning effectively about program… 
2010
2010
Coinduction is a major technique employed to prove behavioral properties of systems, such as behavioral equivalence. Its… 
2009
2009
Pola is a functional style programming language—currently under development—whose type sys-tem guarantees that all its programs… 
2006
2006
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generation… 
2005
2005
Constraint Logic Programming has been successful as a programming language, and more recently, as a model of executable… 
2003
2003
Combining Higher Order Abstract Syntax (HOAS) and (co)- induction is well known to be problematic. In previous work [1] we have… 
2003
2003
  • J. GoguenKai Lin
  • 2003
  • Corpus ID: 9650781
Following a brief introduction to classical and behavioral algebraic specification, this paper discusses the verification of…