Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,356,356 papers from all fields of science
Search
Sign In
Create Free Account
Coinduction
Known as:
Co-data (computer science)
, Co-induction
, Coinductive
Expand
In computer science, coinduction is a technique for defining and proving properties of systems of concurrent interacting objects. Coinduction is the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Anamorphism
Andrew D. Gordon
Apomorphism
Bisimulation
Expand
Broader (5)
Category theory
Functional programming
Logic programming
Mathematical induction
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Open Bisimulation for Quantum Processes
Yuxin Deng
,
Yuan Feng
IFIP TCS
2012
Corpus ID: 3013218
Quantum processes describe concurrent communicating systems that may involve quantum information. We propose a notion of open…
Expand
Highly Cited
2010
Highly Cited
2010
Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30 - June 3, 2010. Proceedings
H. Gilbert
International Conference on the Theory and…
2010
Corpus ID: 43826186
Cryptosystems I.- On Ideal Lattices and Learning with Errors over Rings.- Fully Homomorphic Encryption over the Integers…
Expand
2010
2010
A Hoare logic for the coinductive trace-based big-step semantics of While
Keiko Nakata
,
Tarmo Uustalu
Log. Methods Comput. Sci.
2010
Corpus ID: 3213095
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have…
Expand
Review
2007
Review
2007
Molecular Evolution of Bacteriocins in Gram-Negative Bacteria
Milind A. Chavan
,
M. Riley
2007
Corpus ID: 19850262
The study of molecular evolution has become a valuable tool in understanding the origin of life and the speciation of organisms…
Expand
2005
2005
Verifying haskell programs using constructive type theory
Andreas Abel
,
Marcin Benke
,
Ana Bove
,
John Hughes
,
U. Norell
ACM SIGPLAN Symposium/Workshop on Haskell
2005
Corpus ID: 3211085
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to…
Expand
Highly Cited
2004
Highly Cited
2004
Link homology and Frobenius extensions
M. Khovanov
2004
Corpus ID: 15398529
Author(s): Khovanov, Mikhail | Abstract: We explain how rank two Frobenius extensions of commutative rings lead to link homology…
Expand
Highly Cited
2004
Highly Cited
2004
A logical framework for reasoning about logical specifications
J. Hannan
,
Alwen Tiu
2004
Corpus ID: 122793570
We present a new logic, Linc, which is designed to be used as a framework for specifying and reasoning about operational…
Expand
1999
1999
Coinductive Models of Finite Computing Agents
P. Wegner
,
Dina Q. Goldin
International Workshop on Coalgebraic Methods in…
1999
Corpus ID: 15649713
Review
1994
Review
1994
A Tutorial on Co-induction and Functional Programming
A. Gordon
Functional Programming
1994
Corpus ID: 165946
Co-induction is an important tool for reasoning about unbounded structures. This tutorial explains the foundations of co…
Expand
Highly Cited
1994
Highly Cited
1994
A co-Induction Principle for Recursively Defined Domains
A. Pitts
Theoretical Computer Science
1994
Corpus ID: 18196095
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE