H. Peter Gumm

Affiliations:
  • Philipps University of Marburg, Department of Mathematics


According to our database1, H. Peter Gumm authored at least 28 papers between 1985 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Saturated Kripke Structures as Vietoris Coalgebras.
Proceedings of the Coalgebraic Methods in Computer Science, 2022

2020
Free-Algebra Functors from a Coalgebraic Perspective.
Proceedings of the Coalgebraic Methods in Computer Science, 2020

2019
Connected monads weakly preserve products.
CoRR, 2019

2016
Transitivity and Difunctionality of Bisimulations.
Proceedings of the Coalgebraic Methods in Computer Science, 2016

2014
Coalgebraic Simulations and Congruences.
Proceedings of the Coalgebraic Methods in Computer Science, 2014

2010
Presentation of Set Functors: A Coalgebraic Perspective.
J. Log. Comput., 2010

2009
Copower functors.
Theor. Comput. Sci., 2009

Einführung in die Informatik (8. Aufl.).
Oldenbourg, ISBN: 978-3-486-58724-1, 2009

2008
On Minimal Coalgebras.
Appl. Categorical Struct., 2008

2006
Einführung in die Informatik (7. Aufl.).
Oldenbourg, ISBN: 978-3-486-58115-7, 2006

2005
From <i>T</i>-Coalgebras to Filter Structures and Transition Systems.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004
Preface.
Theor. Comput. Sci., 2004

Einführung in die Informatik (6. Aufl.).
Oldenbourg, ISBN: 978-3-486-27389-2, 2004

2003
Distributivity of categories of coalgebras.
Theor. Comput. Sci., 2003

2002
Coalgebras Of Bounded Type.
Math. Struct. Comput. Sci., 2002

Einführung in die Informatik (5. Aufl.).
Oldenbourg, ISBN: 978-3-486-25635-2, 2002

2001
Covarieties and complete covarieties.
Theor. Comput. Sci., 2001

Equational and implicational classes of coalgebras.
Theor. Comput. Sci., 2001

Monoid-labeled transition systems.
Proceedings of the Coalgebraic Methods in Computer Science, 2001

2000
Coalgebraic structure from weak limit preserving functors.
Proceedings of the Coalgebraic Methods in Computer Science, 2000

1999
Generating Algebraic Laws from Imperative Programs.
Theor. Comput. Sci., 1999

Programmieren und Beweisen: Experimente mit dem Programmverifizierer NPPV.
Proceedings of the Informatik und Schule, 1999

1998
Equational and implicational classes of co-algebras.
Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1995
Einführung in die Informatik (2. Aufl.).
Addison-Wesley, ISBN: 978-3-89319-945-7, 1995

1993
Another Glance at the Alpern-Schneider Characterization of Safety and Liveness in Concurrent Executions.
Inf. Process. Lett., 1993

1992
MUNITY.
Proceedings of the Formale Methoden für verteilte Systeme, 1992

1988
Continuations of logic programs.
Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988

1985
A new class of check-digit methods for arbitrary number systems.
IEEE Trans. Inf. Theory, 1985


  Loading...