Henning Basold

Orcid: 0000-0001-7610-8331

According to our database1, Henning Basold authored at least 21 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
1
1
1
2
1
1
1
3
1
1
2
1
1
2
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Directed Van Kampen Theorem in Lean.
Proceedings of the 15th International Conference on Interactive Theorem Proving, 2024

Enriching Diagrams with Algebraic Operations.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

Irrationality of Process Replication for Higher-Dimensional Automata.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2024

2023
Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication.
CoRR, 2023

Composition and Recursion for Causal Structures.
Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022
Session Coalgebras: A Coalgebraic View on Regular and Context-free Session Types.
ACM Trans. Program. Lang. Syst., 2022

2021
Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols.
Proceedings of the Programming Languages and Systems, 2021

2020
The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them.
Theory Pract. Log. Program., 2020

2019
Newton series, coinductively: a comparative study of composition.
Math. Struct. Comput. Sci., 2019

Well-definedness and observational equivalence for inductive-coinductive programs.
J. Log. Comput., 2019

Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses.
Proceedings of the Programming Languages and Systems, 2019

Coinduction in Flow: The Later Modality in Fibrations.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
Breaking the Loop: Recursive Proofs for Coinductive Predicates in Fibrations.
CoRR, 2018

2017
Higher Inductive Types in Programming.
J. Univers. Comput. Sci., 2017

Monoidal Company for Accessible Functors.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016
Type Theory based on Dependent Inductive and Coinductive Types.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Dependent Inductive and Coinductive Types are Fibrational Dialgebras.
Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

Newton Series, Coinductively.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

2014
Transformation von Scade-Modellen zur SMT-basierten Verifikation.
CoRR, 2014

An Open Alternative for SMT-Based Verification of Scade Models.
Proceedings of the Formal Methods for Industrial Critical Systems, 2014

(Co)Algebraic Characterizations of Signal Flow Graphs.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014


  Loading...