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.

2013

We introduce a coinductive definition of infinitary term rewriting. The setup is surprisingly simple, and has in contrast to the…

2012

We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses…

2011

In recent work we have proposed a novel approach to define idealized type systems for object-oriented languages, based on…

2010

It is possible to provide a proof for a coinductive type using a corecursive function coupled with a guardedness condition. The…

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…

2006

2005

Parametric polymorphism in functional programming languages with explicit polymorphism is the property that polymorphic programs…

1999

1996

We will present a syntactical proof of correctness and completeness of shared reduction. This work is an application of type…

1993

The consistency of the dynamic and static semantics for a small functional programming language was informally proved by R.Milner…