×

Found 155 Documents (Results 1–100)

Corecursion up-to via causal transformations. (English) Zbl 07628070

Hansen, Helle Hvid (ed.) et al., Coalgebraic methods in computer science. 16th IFIP WG 1.3 international workshop, CMCS 2022, colocated with ETAPS 2022, Munich, Germany, April 2–3, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13225, 133-154 (2022).
MSC:  68Q65
PDF BibTeX XML Cite
Full Text: DOI

Session coalgebras: a coalgebraic view on session types and communication protocols. (English) Zbl 1473.68114

Yoshida, Nobuko (ed.), Programming languages and systems. 30th European symposium on programming, ESOP 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12648, 375-403 (2021).
MSC:  68Q85 68Q65
PDF BibTeX XML Cite
Full Text: DOI arXiv

First-order guarded coinduction in Coq. (English) Zbl 07649963

Harrison, John (ed.) et al., 10th international conference on interactive theorem proving, ITP 2019, September 9–12, 2019, Portland, OR, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 141, Article 14, 18 p. (2019).
MSC:  68T15
PDF BibTeX XML Cite
Full Text: DOI

Coinduction in flow: the later modality in fibrations. (English) Zbl 07649891

Roggenbach, Markus (ed.) et al., 8th conference on algebra and coalgebra in computer science, CALCO 2019, London, United Kingdom, June 3–6, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 139, Article 8, 22 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Coinduction: automata, formal proof, companions (invited paper). (English) Zbl 07649887

Roggenbach, Markus (ed.) et al., 8th conference on algebra and coalgebra in computer science, CALCO 2019, London, United Kingdom, June 3–6, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 139, Article 4, 4 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Sequence types for hereditary permutators. (English) Zbl 07559299

Geuvers, Herman (ed.), 4th international conference on formal structures for computation and deduction, FSCD 2019, Dortmund, Germany, June 24–30, 2019. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 131, Article 33, 15 p. (2019).
MSC:  03B70 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Guarded recursion in Agda via sized types. (English) Zbl 07559298

Geuvers, Herman (ed.), 4th international conference on formal structures for computation and deduction, FSCD 2019, Dortmund, Germany, June 24–30, 2019. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 131, Article 32, 19 p. (2019).
MSC:  03B70 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points. (English) Zbl 1435.03088

Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 317-334 (2019).
MSC:  03F52 03F07 68Q17
PDF BibTeX XML Cite
Full Text: DOI HAL

Infinets: the parallel syntax for non-wellfounded proof-theory. (English) Zbl 1468.03032

Cerrito, Serenella (ed.) et al., Automated reasoning with analytic tableaux and related methods. 28th international conference, TABLEAUX 2019, London, UK, September 3–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11714, 297-316 (2019).
MSC:  03B70 03F52
PDF BibTeX XML Cite
Full Text: DOI HAL

Local validity for circular proofs in linear logic with fixed points. (English) Zbl 07533360

Ghica, Dan R. (ed.) et al., 27th EACSL annual conference on computer science logic, CSL 2018, Birmingham, United Kingdom, September 4–8, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 119, Article 35, 23 p. (2018).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

Almost sure productivity. (English) Zbl 1499.68198

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 113, 15 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

The clocks they are adjunctions. Denotational semantics for clocked type theory. (English) Zbl 1462.68023

Kirchner, Hélène (ed.), 3rd international conference on formal structures for computation and deduction, FSCD 2018, July 9–12, 2018, Oxford, United Kingdom. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 108, Article 23, 17 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Sound up-to techniques and complete abstract domains. (English) Zbl 1497.68107

Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM). 175-184 (2018).
MSC:  68N30
PDF BibTeX XML Cite
Full Text: DOI arXiv

Coinductive soundness of corecursive type class resolution. (English) Zbl 1485.68041

Hermenegildo, Manuel V. (ed.) et al., Logic-based program synthesis and transformation. 26th international symposium, LOPSTR 2016, Edinburgh, UK, September 6–8, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10184, 311-327 (2017).
MSC:  68N18 03B70 68N17
PDF BibTeX XML Cite
Full Text: DOI arXiv

A productivity checker for logic programming. (English) Zbl 1485.68037

Hermenegildo, Manuel V. (ed.) et al., Logic-based program synthesis and transformation. 26th international symposium, LOPSTR 2016, Edinburgh, UK, September 6–8, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10184, 168-186 (2017).
MSC:  68N17
PDF BibTeX XML Cite
Full Text: DOI arXiv

Coinduction all the way up. (English) Zbl 1394.68352

Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 307-316 (2016).
MSC:  68T15 03B35 06B23 68N30
PDF BibTeX XML Cite
Full Text: DOI HAL

Formal languages, formally and coinductively. (English) Zbl 1387.68161

Kesner, Delia (ed.) et al., 1st international conference on formal structures for computation and deduction, FSCD 2016, Porto, Portugal, June 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-010-1). LIPIcs – Leibniz International Proceedings in Informatics 52, Article 31, 17 p. (2016).
MSC:  68Q45 68Q65 68T15
PDF BibTeX XML Cite
Full Text: DOI

Indexed codata types. (English) Zbl 1360.68342

Garrigue, Jacques (ed.) et al., Proceedings of the 21st ACM SIGPLAN international conference on functional programming, ICFP ’16, Nara, Japan, September 18–22, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4219-3). 351-363 (2016).
PDF BibTeX XML Cite
Full Text: DOI

A coinductive framework for infinitary rewriting and equational reasoning. (English) Zbl 1366.68114

Fernández, Maribel (ed.), 26th international conference on rewriting techniques and applications, RTA’13, Warsaw, Poland, June 29 – July 1, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-85-9). LIPIcs – Leibniz International Proceedings in Informatics 36, 143-159 (2015).
MSC:  68Q42 03B70 68T15
PDF BibTeX XML Cite
Full Text: DOI

Confluence of nearly orthogonal infinitary term rewriting systems. (English) Zbl 1366.68111

Fernández, Maribel (ed.), 26th international conference on rewriting techniques and applications, RTA’13, Warsaw, Poland, June 29 – July 1, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-85-9). LIPIcs – Leibniz International Proceedings in Informatics 36, 106-126 (2015).
MSC:  68Q42
PDF BibTeX XML Cite
Full Text: DOI

Wild \(\omega\)-categories for the homotopy hypothesis in type theory. (English) Zbl 1433.03031

Altenkirch, Thorsten (ed.), 13th international conference on typed lambda calculi and applications, TLCA’15, Warsaw, Poland, July 1–3, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 38, 226-240 (2015).
PDF BibTeX XML Cite
Full Text: DOI

Finitary corecursion for the infinitary lambda calculus. (English) Zbl 1366.03172

Moss, Lawrence S. (ed.) et al., 6th conference on algebra and coalgebra in computer science, CALCO’15, Nijmegen, Netherlands, June 24–26, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-84-2). LIPIcs – Leibniz International Proceedings in Informatics 35, 336-351 (2015).
MSC:  03B40 03G30
PDF BibTeX XML Cite
Full Text: DOI arXiv

Structures for structural recursion. (English) Zbl 1360.68361

Proceedings of the 20th ACM SIGPLAN international conference on functional programming, ICFP ’15, Vancouver, Canada, September 1–3, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3669-7). 127-139 (2015).
MSC:  68N30 03B70 68N18
PDF BibTeX XML Cite
Full Text: DOI

Unguarded recursion on coinductive resumptions. (English) Zbl 1351.68074

Ghica, Dan (ed.), Proceedings of the 31st conference on the mathematical foundations of programming semantics (MFPS XXXI), Nijmegen, The Netherlands, June 22–25, 2015. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 319, 183-198, electronic only (2015).
MSC:  68N30 18C20
PDF BibTeX XML Cite
Full Text: DOI

Equations, contractions, and unique solutions. (English) Zbl 1346.68139

Proceedings of the 42nd ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’15, Mumbai, India, January 12–18, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3300-9). 421-432 (2015).
MSC:  68Q85 68Q60
PDF BibTeX XML Cite
Full Text: DOI HAL

On applicative similarity, sequentiality, and full abstraction. (English) Zbl 1444.68116

Meyer, Roland (ed.) et al., Correct system design. Symposium in honor of Ernst-Rüdiger Olderog on the occasion of his 60th birthday, Oldenburg, Germany, September 8–9, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9360, 65-82 (2015).
MSC:  68Q85 68N18
PDF BibTeX XML Cite
Full Text: DOI Link

An infinitary model of linear logic. (English) Zbl 1459.03025

Pitts, Andrew (ed.), Foundations of software science and computation structures. 18th international conference, FOSSACS 2015, held as part of the European joint conferences on theory and practice of software, ETAPS 2015, London, UK, April 11–18, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9034, 41-55 (2015).
MSC:  03B47 68Q60
PDF BibTeX XML Cite
Full Text: DOI arXiv

Foundations of total functional data-flow programming. (English) Zbl 1464.68065

Levy, Paul (ed.) et al., Proceedings of the fifth workshop on mathematically structured functional programming, MSFP 2014, Grenoble, France, April 12, 2014. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 153, 143-167 (2014).
MSC:  68N18 68N15
PDF BibTeX XML Cite
Full Text: arXiv Link

Exploiting parallelism in coalgebraic logic programming. (English) Zbl 1337.68054

Power, John (ed.) et al., Proceedings of the workshop on algebra, coalgebra and topology (WACT 2013), Bath, UK, March 1, 2013. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 303, 121-148, electronic only (2014).
MSC:  68N17
PDF BibTeX XML Cite
Full Text: DOI arXiv

On probabilistic applicative bisimulation and call-by-value \(\lambda \)-calculi. (English) Zbl 1405.68076

Shao, Zhong (ed.), Programming languages and systems. 23rd European symposium on programming, ESOP 2014, held as part of the European joint conferences on theory and practice of software, ETAPS 2014, Grenoble, France, April 5–13, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54832-1/pbk). Lecture Notes in Computer Science 8410, 209-228 (2014).
MSC:  68N30 68N18
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

On coinductive equivalences for higher-order probabilistic functional programs. (English) Zbl 1284.68424

Proceedings of the 41st ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’14, San Diego, CA, USA, January 22–24, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2544-8). 297-308 (2014).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Type-based productivity of stream definitions in the calculus of constructions. (English) Zbl 1366.68254

Proceedings of the 2013 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, Tulane University, New Orleans, LA, USA, June 25–28, 2013. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-5020-6). 233-242 (2013).
MSC:  68T15 03B70
PDF BibTeX XML Cite
Full Text: DOI

Verification of redecoration for infinite triangular matrices using coinduction. (English) Zbl 1354.68184

Danielsson, Nils Anders (ed.) et al., 18th international workshop on types for proofs and programs. Papers from the workshop (TYPES 2011), Bergen, Norway, September 8–11, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-49-1). LIPIcs – Leibniz International Proceedings in Informatics 19, 55-69 (2013).
MSC:  68Q65 68T15
PDF BibTeX XML Cite
Full Text: DOI

Infinitary rewriting coinductively. (English) Zbl 1354.03008

Danielsson, Nils Anders (ed.) et al., 18th international workshop on types for proofs and programs. Papers from the workshop (TYPES 2011), Bergen, Norway, September 8–11, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-49-1). LIPIcs – Leibniz International Proceedings in Informatics 19, 16-27 (2013).
MSC:  03B40 68Q42 68T15
PDF BibTeX XML Cite
Full Text: DOI

Wellfounded recursion with copatterns: a unified approach to termination and productivity. (English) Zbl 1323.68087

Proceedings of the 18th ACM SIGPLAN international conference on functional programming, ICFP ’13, Boston, MA, USA, September 25–27, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2326-0). ACM SIGPLAN Notices 48, No. 9, 185-196 (2013).
MSC:  68N18 03B70 68P05
PDF BibTeX XML Cite
Full Text: DOI

Checking NFA equivalence with bisimulations up to congruence. (English) Zbl 1301.68169

Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’13, Rome, Italy, January 23–25, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1832-7). 457-468 (2013).
MSC:  68Q45 68Q85
PDF BibTeX XML Cite
Full Text: DOI HAL

The power of parameterization in coinductive proof. (English) Zbl 1301.68220

Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’13, Rome, Italy, January 23–25, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1832-7). 193-206 (2013).
MSC:  68T15 06B99 68N18 68N30
PDF BibTeX XML Cite
Full Text: DOI

Copatterns, programming infinite structures by observations. (English) Zbl 1301.68080

Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’13, Rome, Italy, January 23–25, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1832-7). 27-38 (2013).
MSC:  68N18 68N15
PDF BibTeX XML Cite
Full Text: DOI

A simple case of rationality of escalation. (English) Zbl 1395.91062

Heckel, Reiko (ed.) et al., Algebra and coalgebra in computer science. 5th international conference, CALCO 2013, Warsaw, Poland, September 3–6, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40205-0/pbk). Lecture Notes in Computer Science 8089, 191-204 (2013).
MSC:  91A26
PDF BibTeX XML Cite
Full Text: DOI arXiv

Computational soundness of coinductive symbolic security under active attacks. (English) Zbl 1315.94079

Sahai, Amit (ed.), Theory of cryptography. 10th theory of cryptography conference, TCC 2013, Tokyo, Japan, March 3–6, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36593-5/pbk). Lecture Notes in Computer Science 7785, 539-558 (2013).
MSC:  94A60 68M12
PDF BibTeX XML Cite
Full Text: DOI

Operational semantics using the partiality monad. (English) Zbl 1291.68114

Proceedings of the 17th ACM SIGPLAN international conference on functional programming, ICFP ’12, Copenhagen, Denmark, September 9–15, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1054-3). ACM SIGPLAN Notices 47, No. 9, 127-138 (2012).
MSC:  68N18
PDF BibTeX XML Cite
Full Text: DOI

Advanced topics in bisimulation and coinduction. (English) Zbl 1264.68009

Cambridge Tracts in Theoretical Computer Science 52. Cambridge: Cambridge University Press (ISBN 978-1-107-00497-9/hbk). xiii, 326 p. (2012).
PDF BibTeX XML Cite

Weak bisimulations for coalgebras over ordered functors. (English) Zbl 1362.68201

Baeten, Jos C. M. (ed.) et al., Theoretical computer science. 7th IFIP TC 1/WG 2.2 international conference, TCS 2012, Amsterdam, The Netherlands, September 26–28, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33474-0/pbk). Lecture Notes in Computer Science 7604, 87-103 (2012).
MSC:  68Q85
PDF BibTeX XML Cite
Full Text: DOI

Realization of coinductive types. (English) Zbl 1342.68217

Mislove, Michael (ed.) et al., Proceedings of the 27th conference on the mathematical foundations of programming semantics (MFPS XXVII), Pittsburgh, PA, USA, May 25–28, 2011. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 276, 237-246 (2011).
MSC:  68Q65
PDF BibTeX XML Cite
Full Text: DOI

Regular expression containment, coinductive axiomatization and computational interpretation. (English) Zbl 1284.68353

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’11, Austin, TX, USA, January 26–28, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0490-0). 385-398 (2011).
MSC:  68Q45 03B70
PDF BibTeX XML Cite
Full Text: DOI

Coalgebraic derivations in logic programming. (English) Zbl 1247.68044

Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12–15, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPIcs – Leibniz International Proceedings in Informatics 12, 352-366, electronic only (2011).
MSC:  68N17 68N19 68Q55
PDF BibTeX XML Cite
Full Text: DOI Link

Coalgebraic semantics for parallel derivation strategies in logic programming. (English) Zbl 1308.68029

Johnson, Michael (ed.) et al., Algebraic methodology and software technology. 13th international conference, AMAST 2010, Lac-Beauport, QC, Canada, June 23–25, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-17795-8/pbk). Lecture Notes in Computer Science 6486, 111-127 (2011).
MSC:  68N17 68Q65
PDF BibTeX XML Cite
Full Text: DOI Link

Total parser combinators. (English) Zbl 1323.68330

Proceedings of the 15th ACM SIGPLAN international conference on functional programming, ICFP ’10, Baltimore, MD, USA, September 27–29, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-794-3). ACM SIGPLAN Notices 45, No. 9, 285-296 (2010).
MSC:  68Q42 68N18 68N20
PDF BibTeX XML Cite
Full Text: DOI

Proofs, programs, processes. (English) Zbl 1280.68077

Ferreira, Fernando (ed.) et al., Programs, proofs, processes. 6th conference on computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30–July 4, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13961-1/pbk). Lecture Notes in Computer Science 6158, 39-48 (2010).
MSC:  68N30 03F25 68N18
PDF BibTeX XML Cite
Full Text: DOI Link

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software