×

Found 42 Documents (Results 1–42)

Constructing initial algebras using inflationary iteration. (English) Zbl 07804574

Kishida, Kohei (ed.), Proceedings of the fourth international conference on applied category theory 2021, ACT 2021, Cambridge, UK, July 12–16, 2021. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 372, 88-102 (2022).
MSC:  18A40 03F65
PDFBibTeX XMLCite
Full Text: arXiv Link

Multi-dimensional arrays with levels. (English) Zbl 1511.68057

New, Max S. (ed.) et al., Proceedings of the eighth workshop on mathematically structured functional programming, MSFP 2020, Dublin, Ireland, April 25, 2020. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 317, 57-71 (2020).
MSC:  68N18 68P05
PDFBibTeX XMLCite
Full Text: arXiv Link

Deep induction: induction rules for (truly) nested types. (English) Zbl 07250946

Goubault-Larrecq, Jean (ed.) et al., Foundations of software science and computation structures. 23rd international conference, FOSSACS 2020, held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12077, 339-358 (2020).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Galois connections for recursive types. (English) Zbl 1440.68042

Di Pierro, Alessandra (ed.) et al., From lambda calculus to cybersecurity through program analysis. Essays dedicated to Chris Hankin on the occasion of his retirement. Cham: Springer. Lect. Notes Comput. Sci. 12065, 105-131 (2020).
PDFBibTeX XMLCite
Full Text: DOI

Decomposing comonad morphisms. (English) Zbl 07649897

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 14, 19 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

A syntax for higher inductive-inductive types. (English) Zbl 1462.68022

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 20, 18 p. (2018).
MSC:  68N18 03B38 55U35
PDFBibTeX XMLCite
Full Text: DOI

Variations on inductive-recursive definitions. (English) Zbl 1445.03010

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 63, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Friends with benefits. Implementing corecursion in foundational proof assistants. (English) Zbl 1485.68280

Yang, Hongseok (ed.), Programming languages and systems. 26th European symposium on programming, ESOP 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10201, 111-140 (2017).
MSC:  68V15
PDFBibTeX XMLCite
Full Text: DOI

Directed containers as categories. (English) Zbl 1477.68169

Atkey, Robert (ed.) et al., Proceedings of the sixth workshop on mathematically structured functional programming, MSFP 2016, Eindhoven, Netherlands, April 8, 2016. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 207, 89-98 (2016).
PDFBibTeX XMLCite
Full Text: arXiv Link

A coalgebraic view of bar recursion and bar induction. (English) Zbl 1474.03105

Jacobs, Bart (ed.) et al., Foundations of software science and computation structures. 19th international conference, FOSSACS 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2–8, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9634, 91-106 (2016).
MSC:  03D65 03B70
PDFBibTeX XMLCite
Full Text: DOI Link

Dependent inductive and coinductive types are fibrational dialgebras. (English) Zbl 1476.68157

Matthes, Ralph (ed.) et al., Proceedings of the tenth international workshop on fixed points in computer science, FICS 2015, Berlin, Germany, September 11–12, 2015. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 191, 3-17 (2015).
PDFBibTeX XMLCite
Full Text: arXiv Link

Coalgebraic update lenses. (English) Zbl 1337.68084

Jacobs, Bart (ed.) et al., Proceedings of the 30th conference on the mathematical foundations of programming semantics (MFPS XXX), Ithaca, NY, USA, June 12–15, 2014. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 308, 25-48, electronic only (2014).
MSC:  68P15 18C15 18C20
PDFBibTeX XMLCite
Full Text: DOI

Data types with symmetries and polynomial functors over groupoids. (English) Zbl 1342.68216

Berger, Ulrich (ed.) et al., Proceedings of the 28th conference on the mathematical foundations of programming semantics (MFPS XXVIII), Bath, UK, June 6–9, 2012. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 286, 351-365 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Proving properties about functions on lists involving element tests. (English) Zbl 1312.68076

Mossakowski, Till (ed.) et al., Recent trends in algebraic development techniques. 20th international workshop, WADT 2010, Etelsen, Germany, July 1–4, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28411-3/pbk). Lecture Notes in Computer Science 7137, 270-286 (2012).
MSC:  68P05 68N18
PDFBibTeX XMLCite
Full Text: DOI

Continuous functions on final coalgebras. (English) Zbl 1337.68070

Abramsky, Samson (ed.) et al., Proceedings of the 25th conference on the mathematical foundations of programming semantics (MFPS 2009), Oxford, UK, April 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 249, 3-18 (2009).
MSC:  68N30 68Q65
PDFBibTeX XMLCite
Full Text: DOI

Let’s see how things unfold: reconciling the infinite with the intensional (extended abstract). (English) Zbl 1239.68025

Kurz, Alexander (ed.) et al., Algebra and coalgebra in computer science. Third international conference, CALCO 2009, Udine, Italy, September 7–10, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03740-5/pbk). Lecture Notes in Computer Science 5728, 113-126 (2009).
MSC:  68N30 68N18
PDFBibTeX XMLCite
Full Text: DOI

Comonadic notions of computation. (English) Zbl 1279.68088

Adámek, J. (ed.) et al., Proceedings of the ninth workshop on coalgebraic methods in computer science (CMCS 2008), Budapest, Hungary, April 4–6, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 203, No. 5, 263-284 (2008).
MSC:  68Q05 03B40 18C20
PDFBibTeX XMLCite
Full Text: DOI

Constructive membership predicates as index types. (English) Zbl 1277.68054

Stump, Aron (ed.) et al., Proceedings of the programming languages meets program verification (PLPV 2006), Seattle, WA, USA, August 21, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 174, No. 7, 3-16 (2007).
MSC:  68N30 03B70
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software