| Higher Inductive Types in Programming H Basold, H Geuvers, N van der Weide Journal of Universal Computer Science 23 (1), 63-88, 2017 | 29 | 2017 |
| Coinduction in uniform: Foundations for corecursive proof search with Horn clauses H Basold, E Komendantskaya, Y Li European Symposium on Programming, 783-813, 2019 | 17 | 2019 |
| Mixed Inductive-Coinductive Reasoning: Types, Programs and Logic H Basold Radboud University Nijmegen, 2018 | 16 | 2018 |
| Monoidal Company for Accessible Functors H Basold, D Pous, J Rot CALCO, 2017 | 11 | 2017 |
| Type Theory based on Dependent Inductive and Coinductive Types H Basold, H Geuvers Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 11 | 2016 |
| Higher Inductive Types N van der Weide, H Basold, H Geuvers Master’s thesis, Radboud University, Nijmegen, 2016 | 9 | 2016 |
| Well-definedness and observational equivalence for inductive–coinductive programs H Basold, HH Hansen Journal of Logic and Computation, exw091, 2016 | 8 | 2016 |
| Newton series, coinductively: a comparative study of composition H Basold, HH Hansen, JÉ Pin, J Rutten Mathematical Structures in Computer Science 29 (1), 38-66, 2019 | 6 | 2019 |
| An Open Alternative for SMT-based Verification of SCADE Models H Basold, H Günther, M Huhn, S Milius International Workshop on Formal Methods for Industrial Critical Systems …, 2014 | 6 | 2014 |
| (Co) Algebraic Characterizations of Signal Flow Graphs H Basold, M Bonsangue, HH Hansen, J Rutten Horizons of the Mind. A Tribute to Prakash Panangaden, 124-145, 2014 | 6 | 2014 |
| (Co) Algebraic Characterizations of Signal Flow Graphs H Basold, M Bonsangue, HH Hansen, J Rutten Horizons of the Mind. A Tribute to Prakash Panangaden, 124-145, 2014 | 6 | 2014 |
| Newton series, coinductively H Basold, HH Hansen, JÉ Pin, J Rutten International Colloquium on Theoretical Aspects of Computing, 91-109, 2015 | 5 | 2015 |
| Session coalgebras: a coalgebraic view on session types and communication protocols AC Keizer, H Basold, JA Pérez European Symposium on Programming, 375-403, 2021 | 4 | 2021 |
| The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them E Komendantskaya, D Rozplokhas, H Basold Theory and Practice of Logic Programming 20 (6), 990-1005, 2020 | 3 | 2020 |
| Breaking the Loop: Recursive Proofs for Coinductive Predicates in Fibrations H Basold arXiv preprint arXiv:1802.07143, 2018 | 2 | 2018 |
| Models of inductive-coinductive logic programs H Basold, E Komendantskaya Pre-Proceedings of the Workshop on Coalgebra, Horn Clause Logic Programming …, 2016 | 2 | 2016 |
| Dependent Inductive and Coinductive Types are Fibrational Dialgebras H Basold arXiv preprint arXiv:1508.06779, 2015 | 2 | 2015 |
| Transformation von Scade-Modellen zur SMT-basierten Verifikation H Basold arXiv preprint arXiv:1403.2752, 2014 | 2 | 2014 |
| Coinduction in Flow: The Later Modality in Fibrations H Basold 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019), 2019 | 1 | 2019 |
| Type Theory: M-types and Bisimulation D Otten, H Basold, PJ Bruin Leiden University, 2020 | | 2020 |
Helle Hvid HansenAssociate Professor at University of GroningenVerified email at rug.nl
