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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

Co-recursion is the ability of defining a function that produces some infinite data in terms of the function and the data itself…

2012

Relation Transition Systems (RTSs) have recently been proposed as a foundation for reasoning effectively about program…

2010

Coinduction is a major technique employed to prove behavioral properties of systems, such as behavioral equivalence. Its…

2009

Pola is a functional style programming language—currently under development—whose type sys-tem guarantees that all its programs…

2006

2005

Constraint Logic Programming has been successful as a programming language, and more recently, as a model of executable…

2004

2003

Combining Higher Order Abstract Syntax (HOAS) and (co)- induction is well known to be problematic. In previous work [1] we have…

2003

In this paper we study decision problems and invertibility for two notions of equivalence of recursive types. In particular, for…

1995

Abstract We prove a strong normalisation result for the linear term calculus of Benton, Bierman, Hyland and de Paiva. Rather than…