Henning Basold


  1. Basold, H. (2018). Foundations for Proof Search in Coinductive Horn Clause Theories. [pdf]
  2. Basold, H. (2018). Breaking the Loop: Recursive Proofs for Coinductive Predicates. [pdf]
  3. Basold, H. (2018). Recursive Proofs for Coinductive Predicates: The Later Modality in Fibrations. [pdf]
  4. Basold, H. (2018). Inductive-Coinductive Reasoning: Computability and Type Theory. [pdf]
  5. Basold, H. (2018). Mixed Inductive-Coinductive Reasoning: Types, Programs and Logic. [pdf]
  6. Basold, H. (2017). A Recursive Logic for the Equivalence of Inductive-Coinductive Programs. [pdf]
  7. Basold, H. (2016). Inductive-Coinductive Reasoning: With an Eye Towards Reactive Systems. [pdf]
  8. Basold, H. (2016). Models of Inductive-Coinductive Logic Programs. [pdf]
  9. Basold, H. (2016). Dependent Inductive-Coinductive Types: Category Theoretical and Syntactic Perspectives. [pdf]
  10. Basold, H. (2016). Type Theory Based on Dependent Inductive and Coinductive Types - With an Eye Towards Cubical OTT. [pdf]
  11. Basold, H. (2016). Towards a Theoretic Foundation of Agda’s Data Types. [pdf]
  12. Basold, H. (2015). Using Coalgebras to Find the Productive Among the Lazy. [pdf]
  13. Basold, H. (2014). Programming on Intial Algebras/Final Coalgebras. [pdf]
  14. Basold, H. (2014). Programming on Intial Algebras/Final Coalgebras. [pdf]
  15. Basold, H. (2013). Polynomial-Based Calculi for Linear Circuits.