Jirí Adámek

CoRR, 2023

On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls).

[BibT_eX]

[DOI]

Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

Strongly Finitary Monads for Varieties of Quantitative Algebras.

[BibT_eX]

[DOI]

Matej Dostál

Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science, 2023

2022

A categorical view of varieties of ordered algebras.

[BibT_eX]

[DOI]

Matej Dostál

Math. Struct. Comput. Sci., April, 2022

Varieties of Quantitative Algebras and Their Monads.

[BibT_eX]

[DOI]

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

Reiterman's Theorem on Finite Algebras for a Monad.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2021

Finitary monads on the category of posets.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2021

On the behaviour of coalgebras with side effects and algebras with effectful iteration.

[BibT_eX]

[DOI]

J. Log. Comput., 2021

Algebraic cocompleteness and finitary functors.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

An Initial Algebra Theorem Without Iteration.

[BibT_eX]

[DOI]

CoRR, 2021

Which Categories Are Varieties? ((Co)algebraic pearls).

[BibT_eX]

[DOI]

Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

Initial Algebras Without Iteration ((Co)algebraic pearls).

[BibT_eX]

[DOI]

Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020

On Well-Founded and Recursive Coalgebras.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2020

On Free Completely Iterative Algebras.

[BibT_eX]

[DOI]

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

Approximate Coalgebra Homomorphisms and Approximate Solutions.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2020

2019

Generalized Eilenberg Theorem: Varieties of Languages in a Category.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2019

On functors preserving coproducts and algebras with iterativity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

On Terminal Coalgebras Derived from Initial Algebras.

[BibT_eX]

[DOI]

Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018

A Categorical Approach to Syntactic Monoids.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

Fixed points of functors.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2018

A Formula for Codensity Monads and Density Comonads.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2018

On Algebras with Effectful Iteration.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017

Eilenberg Theorems for Free.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On Corecursive Algebras for Functors Preserving Coproducts.

[BibT_eX]

[DOI]

Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

2016

One Eilenberg Theorem to Rule Them All.

[BibT_eX]

[DOI]

CoRR, 2016

Fixed Points of Set Functors: How Many Iterations are Needed?

[BibT_eX]

[DOI]

Thorsten Palm

Appl. Categorical Struct., 2016

Profinite Monads, Profinite Equations, and Reiterman's Theorem.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2016

Fixed Points of Functors - A Short Abstract.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2016

2015

Coalgebraic constructions of canonical nondeterministic automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Kan injectivity in order-enriched categories.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

On finitary functors and their presentations.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2015

Varieties of Languages in a Category.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Syntactic Monoids in a Category.

[BibT_eX]

[DOI]

Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014

Base modules for parametrized iterativity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On Continuous Nondeterminism and State Minimality.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

Corecursive Algebras, Corecursive Monads and Bloom Monads.

[BibT_eX]

[DOI]

Mahdieh Haddadi

Log. Methods Comput. Sci., 2014

Colimits of Monads.

[BibT_eX]

[DOI]

CoRR, 2014

Generalized Eilenberg Theorem I: Local Varieties of Languages.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2014

Canonical Nondeterministic Automata.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2014

2013

How iterative reflections of monads are constructed.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Well-Pointed Coalgebras

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

2012

Coproducts of Monads on Set.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Well-Pointed Coalgebras (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

A Coalgebraic Perspective on Minimization and Determinization.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

On Finitary Functors and Their Presentations.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

Theoretische Informatik.

[BibT_eX]

[DOI]

Roland Vollmar

Dietmar Wätjen

Proceedings of the 40 Jahre Informatik an der Technischen Universität Braunschweig, 1972, 2012

2011

On second-order iterative monads.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Initial algebras and terminal coalgebras in many-sorted sets.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2011

Elgot theories: a new perspective on the equational properties of iteration.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2011

Semantics of Higher-Order Recursion Schemes

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2011

Power-Set Functors and Saturated Trees.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2011

From Corecursive Algebras to Corecursive Monads.

[BibT_eX]

[DOI]

Mahdieh Haddadi

Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010

Iterative reflections of monads.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2010

Presentation of Set Functors: A Coalgebraic Perspective.

[BibT_eX]

[DOI]

H. Peter Gumm

J. Log. Comput., 2010

Equational properties of iterative monads.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Recursive Program Schemes and Context-Free Monads.

[BibT_eX]

[DOI]

Proceedings of the Tenth Workshop on Coalgebraic Methods in Computer Science, 2010

2009

Automated Construction of Reasonable Environment for Java Components.

[BibT_eX]

[DOI]

Pavel Parízek

Tomas Kalibera

Proceedings of the Sixth International Workshop on Formal Engineering approches to Software Components and Architectures, 2009

Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

The Orthogonal Subcategory Problem and the Small Object Argument.

[BibT_eX]

[DOI]

Michel Hébert

Appl. Categorical Struct., 2009

A Description of Iterative Reflections of Monads (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2009

Abstract and Concrete Categories - The Joy of Cats.

[BibT_eX]

[DOI]

Horst Herrlich

George E. Strecker

Dover Publications, ISBN: 978-0-486-46934-8, 2009

2008

On Algebras with Iteration.

[BibT_eX]

[DOI]

Stephen L. Bloom

J. Log. Comput., 2008

Bases for parametrized iterativity.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Preface.

[BibT_eX]

[DOI]

Clemens Kupke

Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science, 2008

Checking Session-Oriented Interactions between Web Services.

[BibT_eX]

[DOI]

Pavel Parízek

Proceedings of the 34th Euromicro Conference on Software Engineering and Advanced Applications, 2008

Carmen: Software Component Model Checker.

[BibT_eX]

[DOI]

Ales Plsek

Proceedings of the Quality of Software Architectures. Models and Architectures, 2008

Perspectives in component-based software engineering.

[BibT_eX]

[DOI]

Petr Hnetynka

Proceedings of the 2008 International Workshop on Software Engineering in East and South Europe, 2008

2007

Algebras with parametrized iterativity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Recursive coalgebras of finitary functors.

[BibT_eX]

[DOI]

Dominik Lücke

RAIRO Theor. Informatics Appl., 2007

What Are Iteration Theories?

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

The intersection of algebra and coalgebra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Iterative algebras at work.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2006

Elgot Algebras.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2006

Terminal coalgebras and free iterative theories.

[BibT_eX]

[DOI]

Inf. Comput., 2006

Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004.

[BibT_eX]

[DOI]

Inf. Comput., 2006

How Iterative are Iterative Algebras?

[BibT_eX]

[DOI]

Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, 2006

Addressing Unbounded Parallelism in Verification of Software Components.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Software Engineering, 2006

2005

Component composition errors and update atomicity: static analysis.

[BibT_eX]

[DOI]

J. Softw. Maintenance Res. Pract., 2005

A general final coalgebra theorem.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2005

Elgot Algebras: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

Behavior Assembly and Composition of Use Cases - UML 2.0 Perspective.

[BibT_eX]

Vladimir Mencl

Proceedings of the IASTED International Conference on Software Engineering, 2005

A Logic of Coequations.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Algebra 'cap' Coalgebra = Presheaves.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004

On tree coalgebras and coalgebra presentations.

[BibT_eX]

[DOI]

Hans-E. Porst

Theor. Comput. Sci., 2004

On coalgebra based on classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On quasivarieties and varieties as categories.

[BibT_eX]

[DOI]

Stud Logica, 2004

Iterative Algebras for a Base.

[BibT_eX]

[DOI]

Proceedings of the 10th Conference on Category Theory in Computer Science, 2004

From Iterative Algebras to Iterative Theories (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

Preface.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

Erroneous architecture is a relative concept.

[BibT_eX]

Proceedings of the IASTED Conference on Software Engineering and Applications, 2004

Partial Bindings of Components - Any Harm?.

[BibT_eX]

[DOI]

Proceedings of the 11th Asia-Pacific Software Engineering Conference (APSEC 2004), 30 November, 2004

2003

Preface.

[BibT_eX]

[DOI]

Martín Hötzel Escardó

Martin Hofmann

Theor. Comput. Sci., 2003

On final coalgebras of continuous functors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Infinite trees and completely iterative theories: a coalgebraic view.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On Varieties and Covarieties in a Category.

[BibT_eX]

[DOI]

Hans-E. Porst

Math. Struct. Comput. Sci., 2003

Free Iterative Theories: A Coalgebraic View.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2003

On a Description of Terminal Coalgebras and Iterative Theories.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Coalgebraic Methods in Computer Science, 2003

Some Remarks on Finitary and Iterative Monads.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2003

Static analysis of component systems using behavior protocols.

[BibT_eX]

[DOI]

Proceedings of the Companion of the 18th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2003

2002

On abstract data types presented by multiequations.

[BibT_eX]

[DOI]

Michel Hébert

Theor. Comput. Sci., 2002

Final Coalgebras are Ideal Completions of Initial Algebras.

[BibT_eX]

[DOI]

J. Log. Comput., 2002

On Rational Monads and Free Iterative Theories.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 2002

Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2002

Weak Factorization Systems and Topological Functors.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2002

Parametric corecursion and completely iterative monads.

[BibT_eX]

Proceedings of the Fixed Points in Computer Science, 2002

2001

From Varieties of Algebras to Covarieties of Coalgebras.

[BibT_eX]

[DOI]

Hans-E. Porst

Proceedings of the Coalgebraic Methods in Computer Science, 2001

A Coalgebraic View of Infinite Trees and Iteration.

[BibT_eX]

[DOI]

Peter Aczel

Proceedings of the Coalgebraic Methods in Computer Science, 2001

Constructions of Solid Hulls.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2001

2000

Morita Equivalence of Sketches.

[BibT_eX]

[DOI]

Francis Borceux

Appl. Categorical Struct., 2000

1997

A Categorical Generalization of Scott Domains.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1997

Finitary Sketches.

[BibT_eX]

[DOI]

J. Symb. Log., 1997

1996

On geometric and finitary sketches.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 1996

A remark on fixed points of functors in topological categories.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 1996

1995

Recursive Data Types in Algebraically omega-Complete Categories

[BibT_eX]

[DOI]

Inf. Comput., May, 1995

On the Greatest Fixed Point of a Set Functor.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Finitary Sketches and Finitely Accessible Categories.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1995

Continuous Algebras Revisited.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

1994

Banach's Fixed-Point Theorem as a base for data-type equations.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 1994

1992

On orthogonal subcategories of locally presentable categories.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

Foundations of coding - theory and applications of error-correcting codes with an introduction to cryptography and information theory.

[BibT_eX]

Wiley, ISBN: 978-0-471-62187-4, 1991

1988

On the logic of continuous algebras.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1988

1986

Continuous Semilattices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

1985

Cartesian Closed Categories, Quasitopoi and Topological Universes.

[BibT_eX]

[DOI]

Horst Herrlich

Proceedings of the Mathematical Foundations of Programming Semantics, 1985

1983

Separately Continuous Algebras.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

Theory of Mathematical Structures.

[BibT_eX]

[DOI]

Reidel, ISBN: 978-90-277-1459-6, 1983

1982

Tree Constructions of Free Continuous Algebras.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

1981

Observability and Nerode Equivalence in Concrete C5ategories.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

On an equivalence of system-theoretical and categorical concepts.

[BibT_eX]

[DOI]

Hartmut Ehrig

Kybernetika, 1980

1979

Least Fixed Point of a Functor.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1979

Tree-group automata.

[BibT_eX]

Proceedings of the Fundamentals of Computation Theory, 1979

1977

Functorial algebras and automata.

[BibT_eX]

[DOI]

Kybernetika, 1977

On Languages, Accepted by Machines in the Category of Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

Recognizable and Regular Languages in a Category.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

Remarks on Fixed Points of Functors.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1975

Automata and Categories: Finiteness Contra Minimality.

[BibT_eX]

[DOI]