Relevant bibliographies by topics / Coinduction

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Coinduction'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Coinduction.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Coinduction"

1

KOZEN, DEXTER, and ALEXANDRA SILVA. "Practical coinduction." Mathematical Structures in Computer Science 27, no. 7 (2016): 1132–52. http://dx.doi.org/10.1017/s0960129515000493.

Full text
Abstract:
Induction is a well-established proof principle that is taught in most undergraduate programs in mathematics and computer science. In computer science, it is used primarily to reason about inductively defined datatypes such as finite lists, finite trees and the natural numbers. Coinduction is the dual principle that can be used to reason about coinductive datatypes such as infinite streams or trees, but it is not as widespread or as well understood. In this paper, we illustrate through several examples the use of coinduction in informal mathematical arguments. Our aim is to promote the princip
APA, Harvard, Vancouver, ISO, and other styles
2

Kidney, Donnacha Oisín, and Nicolas Wu. "Formalising Graph Algorithms with Coinduction." Proceedings of the ACM on Programming Languages 9, POPL (2025): 1657–86. https://doi.org/10.1145/3704892.

Full text
Abstract:
Graphs and their algorithms are fundamental to computer science, but they can be difficult to formalise, especially in dependently-typed proof assistants. Part of the problem is that graphs aren’t as well-behaved as inductive data types like trees or lists; another problem is that graph algorithms (at least in standard presentations) often aren’t structurally recursive. Instead of trying to find a way to make graphs behave like other familiar inductive types, this paper builds a formal theory of graphs and their algorithms where graphs are treated as coinductive structures from the beginning.
APA, Harvard, Vancouver, ISO, and other styles
3

MANTADELIS, THEOFRASTOS, RICARDO ROCHA, and PAULO MOURA. "Tabling, Rational Terms, and Coinduction Finally Together!" Theory and Practice of Logic Programming 14, no. 4-5 (2014): 429–43. http://dx.doi.org/10.1017/s147106841400012x.

Full text
Abstract:
AbstractTabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling often improves computational performance. Rational term are terms with one or more infinite sub-terms but with a finite representation. Rational terms can be generated in Prolog by omitting the occurs check when unifying two terms. Applications of rational terms include definite clause grammars, constraint handling systems, and coinduction. In this paper, we report our extension of YAP's Prolog tabling mechanism
APA, Harvard, Vancouver, ISO, and other styles
4

BARTELS, FALK. "Generalised coinduction." Mathematical Structures in Computer Science 13, no. 2 (2003): 321–48. http://dx.doi.org/10.1017/s0960129502003900.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bartels, F. "Generalised Coinduction." Electronic Notes in Theoretical Computer Science 44, no. 1 (2001): 67–87. http://dx.doi.org/10.1016/s1571-0661(04)80903-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

HINZE, RALF. "Concrete stream calculus: An extended study." Journal of Functional Programming 20, no. 5-6 (2010): 463–535. http://dx.doi.org/10.1017/s0956796810000213.

Full text
Abstract:
AbstractThis paper shows how to reason about streams concisely and precisely. Streams, infinite sequences of elements, live in a coworld: they are given by a coinductive datatype, operations on streams are implemented by corecursive programs, and proofs are typically concocted using coinduction. This paper offers an alternative to coinduction. Suitably restricted, stream equations possessunique solutions. This property gives rise to a simple and attractive proof technique, essentially bringing equational reasoning to the coworld. We redevelop the theory of recurrences, finite calculus and gene
APA, Harvard, Vancouver, ISO, and other styles
7

Upchurch, R. C. C., and A. P. Hall. "Propofol/midazolam coinduction." Anaesthesia 54, no. 6 (1999): 608–9. http://dx.doi.org/10.1046/j.1365-2044.1999.96794n.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Anderson, L., and H. Robb. "Propofol/midazolam coinduction." Anaesthesia 54, no. 6 (1999): 609. http://dx.doi.org/10.1046/j.1365-2044.1999.96794o.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lenisa, Marina. "From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems." Electronic Notes in Theoretical Computer Science 19 (1999): 2–22. http://dx.doi.org/10.1016/s1571-0661(05)80265-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yesua, I. Nyoman, Puger Rahardjo, and Pesta Parulian Maurid Edwar. "Keamanan Penggunaan Propofol Auto-Coinduction Dibandingkan Dengan Midazolam Coinduction Berdasarkan Perubahan Hemodinamik Pada Induksi Anestesi Pasien Yang Dilakukan General Anestesi." JAI (Jurnal Anestesiologi Indonesia) 11, no. 1 (2019): 1. http://dx.doi.org/10.14710/jai.v11i1.22039.

Full text
Abstract:
Latar Belakang: Pemilihan obat anestesi untuk induksi bagi seorang ahli anestesi merupakan hal yang krusial dan didasarkan atas efek farmakodinamik terhadap sistem kardiovaskular.Tujuan: Menganalisa apakah penggunaan propofol auto-coinduction (pre-dosing propofol) dapat digunakan sebagai alternatif midazolam sebagai obat coinduction, dilihat dari segi keamanan pasien (perubahan hemodinamik yang terjadi) dan biaya yang dikeluarkan.Metode: Penelitian eksperimental dengan desain pre-posttest single blind group ini melibatkan 52 pasien yang menjalani operasi elektif dengan anestesi umum di Kamar O
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Coinduction"

1

DAGNINO, FRANCESCO. "Flexible Coinduction." Doctoral thesis, Università degli studi di Genova, 2021. http://hdl.handle.net/11567/1035050.

Full text
Abstract:
Recursive definitions of predicates by means of inference rules are ubiquitous in computer science. They are usually interpreted inductively or coinductively, however there are situations where none of these two options provides the expected meaning. In the thesis we propose a flexible form of coinductive interpretation, based on the notion of corules, able to deal with such situations. In the first part, we define such flexible coinductive interpretation as a fixed point of the standard inference operator lying between the least and the greatest one, and we provide several equivalent pro
APA, Harvard, Vancouver, ISO, and other styles
2

Dennis, Louise. "Proof planning coinduction." Thesis, University of Edinburgh, 1998. http://hdl.handle.net/1842/534.

Full text
Abstract:
Coinduction is a proof rule which is the dual of induction. It allows reasoning about non-well-founded sets and is of particular use for reasoning about equivalences. In this thesis I present an automation of coinductive theorem proving. This automation is based on the ideas of proof planning [Bundy 88]. Proof planning as the name suggests, plans the higher level steps in a proof without performing the formal checking which is also required for a verification. The automation has focused on the use of coinduction to prove the equivalence of programs in a small lazy functional language which is
APA, Harvard, Vancouver, ISO, and other styles
3

Fumex, Clèment. "Induction and coinduction schemes in category theory." Thesis, University of Strathclyde, 2012. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=18195.

Full text
Abstract:
This thesis studies induction and coinduction schemes from the point of view of category theory. We start from the account of inductive and coinductive types given by initial algebra semantics and final coalgebra semantics, respectively. We then use fibrations as a generic setting describing a logic for a type theory to study induction and coinduction. As our starting point we consider the seminal work of Hermida and Jacobs [Her93, HJ98], who pioneered the fibrational approach. We extend their induction and coinduction schemes to give provably sound generic induction and coinduction schemes fo
APA, Harvard, Vancouver, ISO, and other styles
4

Picard, Celia. "Représentation coinductive des graphes." Phd thesis, Université Paul Sabatier - Toulouse III, 2012. http://tel.archives-ouvertes.fr/tel-00862507.

Full text
Abstract:
Nous nous intéressons à la représentation de graphes dans le prouveur Coq. Nous avons choisi de les représenter par des types coinductifs dont nous voulions explorer l'utilisation. Ceux-ci permettent de rendre succincte et élégante la représentation et d'obtenir la navigabilité par construction. Nous avons dû contourner la condition de garde dont le but est d'assurer la validité des opérations effectuées sur les objets coinductifs. Son implantation dans Coq est restrictive et interdit parfois des définitions sémantiquement correctes. Une formalisation canonique des graphes dépasse ainsi l'expr
APA, Harvard, Vancouver, ISO, and other styles
5

Pirog, Maciej Adam. "Completely iterative monads in semantics of coinductive programs." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:9957b2f8-b08c-40fd-9bf1-b815b9abd25a.

Full text
Abstract:
Some programs are not merely sets of batch instructions performed in isolation. They interact, either directly with the user, or with other threads and resources. This dissertation tackles the problem of mathematical description (denotational semantics) of the observable behaviour of such programs. In the tradition of denotational semantics and functional programming, one can distinguish between pure computations, which are regarded as mathematical functions, and effectful ones, like those generating behaviour. Both effects in general and behaviour of interactive systems have been thoroughly s
APA, Harvard, Vancouver, ISO, and other styles
6

Durier, Adrien. "Unique solution techniques for processes and functions." Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN016.

Full text
Abstract:
La méthode de preuve par bisimulation est un pilier de la théorie de la concurrence et des langages de programmation. Cette technique permet d’établir que deux programmes, ou deux protocoles distribués, sont égaux, au sens où l’on peut substituer l’un par l’autre sans affecter le comportement global du système. Les preuves par bisimulation sont souvent difficiles et techniquement complexes. De ce fait, diverses techniques ont été proposées pour faciliter de telles preuve. Dans cette thèse, nous étudions une telle technique de preuve pour la bisimulation, fondée sur l’unicité des solutions d’éq
APA, Harvard, Vancouver, ISO, and other styles
7

Vallée, Thierry. "Map Theory et Antifondation." Phd thesis, Université Paris-Diderot - Paris VII, 2001. http://tel.archives-ouvertes.fr/tel-00001298.

Full text
Abstract:
Map Theory est une extension équationnelle du lambda-calcul non-typé conçue par Klaus Grue pour être une fondation commune de l'informatique et des mathématiques. Elle permet en particulier une interprétation complète du calcul des prédicats et de ZFC+FA, où ZFC est la théorie de Zermelo-Fraenkel, et FA est l'axiome de bonne fondation usuel. Toutes les notions primitives de la logique du premier ordre et de la théorie des ensembles, valeurs de vérité, connecteurs, quantificateurs, appartenance et égalité, y sont traduites par des termes du lambda-calcul enrichi de quelques constantes. De plus,
APA, Harvard, Vancouver, ISO, and other styles
8

Alberti, Michele. "On operational properties of quantitative extensions of lambda-calculus." Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4076/document.

Full text
Abstract:
Cette thèse porte sur les propriétés opérationnelles de deux extensions quantitatives du λ-calcul pur : le λ-calcul algébrique et le λ-calcul probabiliste.Dans la première partie, nous étudions la théorie de la β-réduction dans le λ-calcul algébrique. Ce calcul permet la formation de combinaisons linéaires finies de λ-termes. Bien que le système obtenu jouisse de la propriété de Church-Rosser, la relation de réduction devient triviale en présence de coefficients négatifs, ce qui la rend impropre à définir une notion de forme normale. Nous proposons une solution qui permet la définition d'une r
APA, Harvard, Vancouver, ISO, and other styles
9

Spadotti, Régis. "Une théorie mécanisée des arbres réguliers en théorie des types dépendants." Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30178/document.

Full text
Abstract:
Nous proposons deux caractérisations des arbres réguliers. La première est sémantique et s'appuie sur les types co-inductifs. La seconde est syntaxique et repose sur une représentation des arbres réguliers par des termes cycliques. Nous prouvons que ces deux caractérisations sont isomorphes.Ensuite, nous étudions le problème de la définition de morphisme d'arbres préservant la propriété de régularité. Nous montrons en utilisant le formalisme des transducteurs d'arbres, l'existence d'un critère syntaxique garantissant la préservation de cette propriété. Enfin, nous considérons des applications
APA, Harvard, Vancouver, ISO, and other styles
10

Craciunescu, Sorin. "Vérification des programmes logiques." Phd thesis, Ecole Polytechnique X, 2004. http://pastel.archives-ouvertes.fr/pastel-00000864.

Full text
Abstract:
Le but de ce travail est de proposer un système formel pour prouver que l'ensemble des succès d'un programme logique est inclus dans l'ensemble correspondant d'un autre programme. Cela permet de prouver que deux programmes logiques, un qui représente la spécification et un représentant l'implantation sont équivalents. Le langage logique considéré est CLPforall qui est le langage le langage de programmation logique avec contraintes (CLP) auquel est ajouté le quantificateur universel. Nous présentons les sémantiques des succès finis et infinis et montrons qu'elles sont données par le plus petit
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Coinduction"

1

Sangiorgi, Davide, and Jan Rutten, eds. Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, 2009. http://dx.doi.org/10.1017/cbo9780511792588.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sangiorgi, Davide. Advanced topics in bisimulation and coinduction. Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sangiorgi, Davide. Introduction to Bisimulation and Coinduction. Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sangiorgi, Davide. Introduction to Bisimulation and Coinduction. Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sangiorgi, Davide. Introduction to Bisimulation and Coinduction. Cambridge University Press, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sangiorgi, Davide. Introduction to Bisimulation and Coinduction. Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

An introduction to bisimulation and coinduction. Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sangiorgi, Davide, and Jan Rutten. Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sangiorgi, Davide, and Jan Rutten. Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sangiorgi, Davide, and Jan Rutten. Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Coinduction"

1

Cohen, Liron. "Non-well-founded Deduction for Induction and Coinduction." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_1.

Full text
Abstract:
AbstractInduction and coinduction are both used extensively within mathematics and computer science. Algebraic formulations of these principles make the duality between them apparent, but do not account well for the way they are commonly used in deduction. Generally, the formalization of these reasoning methods employs inference rules that express a general explicit (co)induction scheme. Non-well-founded proof theory provides an alternative, more robust approach for formalizing implicit (co)inductive reasoning. This approach has been extremely successful in recent years in supporting implicit
APA, Harvard, Vancouver, ISO, and other styles
2

Moore, Brandon, Lucas Peña, and Grigore Rosu. "Program Verification by Coinduction." In Programming Languages and Systems. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89884-1_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Goriac, Eugen-Ioan, Dorel Lucanu, and Grigore Roşu. "Automating Coinduction with Case Analysis." In Formal Methods and Software Engineering. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16901-4_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fumex, Clément, Neil Ghani, and Patricia Johann. "Indexed Induction and Coinduction, Fibrationally." In Algebra and Coalgebra in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22944-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Abel, Andreas. "Compositional Coinduction with Sized Types." In Coalgebraic Methods in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40370-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lucanu, Dorel, and Grigore Roşu. "Circular Coinduction with Special Contexts." In Formal Methods and Software Engineering. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10373-5_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Roşu, Grigore, and Dorel Lucanu. "Circular Coinduction: A Proof Theoretical Foundation." In Algebra and Coalgebra in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03741-2_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Miao, Decheng, and Jianqing Xi. "Indexed Coinduction in a Fibrational Setting." In Algorithms and Architectures for Parallel Processing. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05234-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bubel, Richard, Crystal Chang Din, Reiner Hähnle, and Keiko Nakata. "A Dynamic Logic with Traces and Coinduction." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24312-2_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rutten, J. J. M. M. "Automata and coinduction (an exercise in coalgebra)." In CONCUR'98 Concurrency Theory. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055624.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Coinduction"

1

Mastorou, Lykourgos, Nikolaos Papaspyrou, and Niki Vazou. "Coinduction inductively: mechanizing coinductive proofs in Liquid Haskell." In Haskell '22: 15th ACM SIGPLAN International Haskell Symposium. ACM, 2022. http://dx.doi.org/10.1145/3546189.3549922.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pous, Damien. "Coinduction All the Way Up." In LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. ACM, 2016. http://dx.doi.org/10.1145/2933575.2934564.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lucanu, Dorel. "Proving Reachability Properties by Coinduction (Extended Abstract)." In 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2018. http://dx.doi.org/10.1109/synasc.2018.00066.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bonchi, Filippo, Daniela Petrişan, Damien Pous, and Jurriaan Rot. "Coinduction up-to in a fibrational setting." In CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC. ACM, 2014. http://dx.doi.org/10.1145/2603088.2603149.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zakowski, Yannick, Paul He, Chung-Kil Hur, and Steve Zdancewic. "An equational theory for weak bisimulation via generalized parameterized coinduction." In POPL '20: 47th Annual ACM SIGPLAN Symposium on Principles of Programming Languages. ACM, 2020. http://dx.doi.org/10.1145/3372885.3373813.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Goguen, J., K. Lin, and C. Rosu. "Circular coinductive rewriting." In Proceedings of ASE 2000 15th IEEE International Automated Software Engineering Conference. IEEE, 2000. http://dx.doi.org/10.1109/ase.2000.873657.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pattinson, Dirk, and Lutz Schröder. "Program Equivalence is Coinductive." In LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. ACM, 2016. http://dx.doi.org/10.1145/2933575.2934506.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Howard, Brian T. "Inductive, coinductive, and pointed types." In the first ACM SIGPLAN international conference. ACM Press, 1996. http://dx.doi.org/10.1145/232627.232640.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pous, Damien. "Coinductive techniques, from automata to coalgebra." In the Programming Languages Mentoring Workshop. ACM Press, 2015. http://dx.doi.org/10.1145/2792434.2792440.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Barthe, Gilles, and Tarmo Uustalu. "CPS translating inductive and coinductive types." In the 2002 ACM SIGPLAN workshop. ACM Press, 2002. http://dx.doi.org/10.1145/503032.503043.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Coinduction' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography