Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJirí Adámek
Person information
- affiliation: Braunschweig University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[i17]Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat:
Reiterman's Theorem on Finite Algebras for a Monad. CoRR abs/2101.00942 (2021)- 2020
- [c54]Jirí Adámek:
Approximate Coalgebra Homomorphisms and Approximate Solutions. CMCS 2020: 11-31 - [c53]Jirí Adámek:
On Free Completely Iterative Algebras. CSL 2020: 7:1-7:21 - [c52]Jirí Adámek, Stefan Milius
, Lawrence S. Moss:
On Well-Founded and Recursive Coalgebras. FoSSaCS 2020: 17-36
2010 – 2019
- 2019
- [j66]Jirí Adámek, Stefan Milius:
On functors preserving coproducts and algebras with iterativity. Theor. Comput. Sci. 763: 66-87 (2019) - [j65]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem: Varieties of Languages in a Category. ACM Trans. Comput. Log. 20(1): 3:1-3:47 (2019) - [c51]Jirí Adámek:
On Terminal Coalgebras Derived from Initial Algebras. CALCO 2019: 12:1-12:21 - [i16]Jirí Adámek:
On free completely iterative algebras. CoRR abs/1906.11166 (2019) - [i15]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Well-Founded and Recursive Coalgebras. CoRR abs/1910.09401 (2019) - [i14]Stefan Milius, Jirí Adámek, Henning Urbat:
On the Behaviour of Coalgebras with Side Effects and Algebras with Effectful Iteration. CoRR abs/1911.06346 (2019) - [i13]Jirí Adámek:
On free completely iterative algebras. CoRR abs/1912.06467 (2019) - 2018
- [j64]Jirí Adámek, Lurdes Sousa:
A Formula for Codensity Monads and Density Comonads. Appl. Categorical Struct. 26(5): 855-872 (2018) - [j63]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
Fixed points of functors. J. Log. Algebraic Methods Program. 95: 41-81 (2018) - [j62]Jirí Adámek, Stefan Milius, Henning Urbat:
A Categorical Approach to Syntactic Monoids. Log. Methods Comput. Sci. 14(2) (2018) - [c50]Stefan Milius, Jirí Adámek, Henning Urbat:
On Algebras with Effectful Iteration. CMCS 2018: 144-166 - [i12]Jirí Adámek, Stefan Milius, Henning Urbat:
A Categorical Approach to Syntactic Monoids. CoRR abs/1804.03011 (2018) - 2017
- [c49]Jirí Adámek, Stefan Milius:
On Corecursive Algebras for Functors Preserving Coproducts. CALCO 2017: 3:1-3:15 - [c48]Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius:
Eilenberg Theorems for Free. MFCS 2017: 43:1-43:15 - [i11]Jirí Adámek, Stefan Milius:
On Corecursive Algebras for Functors Preserving Coproducts. CoRR abs/1703.07574 (2017) - 2016
- [j61]Jirí Adámek, Václav Koubek, T. Palm:
Fixed Points of Set Functors: How Many Iterations are Needed? Appl. Categorical Struct. 24(5): 649-661 (2016) - [c47]Jirí Adámek:
Fixed Points of Functors - A Short Abstract. CMCS 2016: 1-4 - [c46]Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat:
Profinite Monads, Profinite Equations, and Reiterman's Theorem. FoSSaCS 2016: 531-547 - [i10]Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius:
One Eilenberg Theorem to Rule Them All. CoRR abs/1602.05831 (2016) - 2015
- [j60]Jirí Adámek, Paul Blain Levy, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday. Appl. Categorical Struct. 23(4): 609-641 (2015) - [j59]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Henning Urbat:
On finitary functors and their presentations. J. Comput. Syst. Sci. 81(5): 813-833 (2015) - [j58]Jirí Adámek, Lurdes Sousa, Jiri Velebil:
Kan injectivity in order-enriched categories. Math. Struct. Comput. Sci. 25(1): 6-45 (2015) - [j57]Robert S. R. Myers, Jirí Adámek, Stefan Milius, Henning Urbat:
Coalgebraic constructions of canonical nondeterministic automata. Theor. Comput. Sci. 604: 81-101 (2015) - [c45]Jirí Adámek, Stefan Milius, Henning Urbat:
Syntactic Monoids in a Category. CALCO 2015: 1-16 - [c44]Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius:
Varieties of Languages in a Category. LICS 2015: 414-425 - [i9]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem I: Local Varieties of Languages. CoRR abs/1501.02834 (2015) - [i8]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Varieties of Languages in a Category. CoRR abs/1501.05180 (2015) - [i7]Jirí Adámek, Stefan Milius, Henning Urbat:
Syntactic Monoids in a Category. CoRR abs/1504.02694 (2015) - [i6]Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat:
Profinite Monads, Profinite Equations and Reiterman's Theorem. CoRR abs/1511.02147 (2015) - 2014
- [j56]Jirí Adámek, Mahdieh Haddadi, Stefan Milius:
Corecursive Algebras, Corecursive Monads and Bloom Monads. Log. Methods Comput. Sci. 10(3) (2014) - [j55]Jirí Adámek, Stefan Milius, Jiri Velebil:
Base modules for parametrized iterativity. Theor. Comput. Sci. 523: 56-85 (2014) - [c43]Robert S. R. Myers, Jirí Adámek, Stefan Milius, Henning Urbat:
Canonical Nondeterministic Automata. CMCS 2014: 189-210 - [c42]Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem I: Local Varieties of Languages. FoSSaCS 2014: 366-380 - [c41]Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius:
On Continuous Nondeterminism and State Minimality. MFPS 2014: 3-23 - [i5]Jirí Adámek, Nathan J. Bowler, Paul Blain Levy, Stefan Milius:
Coproducts of Monads on Set. CoRR abs/1409.3804 (2014) - [i4]Jirí Adámek:
Colimits of Monads. CoRR abs/1409.3805 (2014) - 2013
- [j54]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Well-Pointed Coalgebras. Log. Methods Comput. Sci. 9(3) (2013) - [j53]Jirí Adámek, Stefan Milius, Jiri Velebil:
How iterative reflections of monads are constructed. Inf. Comput. 225: 83-118 (2013) - [i3]Jirí Adámek, Lurdes Sousa, Jiri Velebil:
Kan injectivity in order-enriched categories. CoRR abs/1311.1721 (2013) - 2012
- [c40]Jirí Adámek, Roland Vollmar, Dietmar Wätjen:
Theoretische Informatik. 40 Jahre Informatik @ Braunschweig 2012: 76-83 - [c39]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Finitary Functors and Their Presentations. CMCS 2012: 51-70 - [c38]Jirí Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius, Alexandra Silva:
A Coalgebraic Perspective on Minimization and Determinization. FoSSaCS 2012: 58-73 - [c37]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Well-Pointed Coalgebras (Extended Abstract). FoSSaCS 2012: 89-103 - [c36]Jirí Adámek, Stefan Milius, Nathan J. Bowler, Paul Blain Levy:
Coproducts of Monads on Set. LICS 2012: 45-54 - 2011
- [j52]Jirí Adámek, Stefan Milius, Jiri Velebil:
Semantics of Higher-Order Recursion Schemes. Log. Methods Comput. Sci. 7(1) (2011) - [j51]Jirí Adámek, Stefan Milius, Jiri Velebil:
Elgot theories: a new perspective on the equational properties of iteration. Math. Struct. Comput. Sci. 21(2): 417-480 (2011) - [j50]Jirí Adámek, Vera Trnková:
Initial algebras and terminal coalgebras in many-sorted sets. Math. Struct. Comput. Sci. 21(2): 481-509 (2011) - [j49]Jirí Adámek, Stefan Milius, Jiri Velebil:
On second-order iterative monads. Theor. Comput. Sci. 412(38): 4969-4988 (2011) - [c35]Jirí Adámek, Mahdieh Haddadi, Stefan Milius:
From Corecursive Algebras to Corecursive Monads. CALCO 2011: 55-69 - [c34]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Power-Set Functors and Saturated Trees. CSL 2011: 5-19 - 2010
- [j48]Jirí Adámek, Clemens Kupke:
Preface. Inf. Comput. 208(12): 1305 (2010) - [j47]Jirí Adámek, Stefan Milius, Jiri Velebil:
Equational properties of iterative monads. Inf. Comput. 208(12): 1306-1348 (2010) - [j46]Jirí Adámek, H. Peter Gumm, Vera Trnková:
Presentation of Set Functors: A Coalgebraic Perspective. J. Log. Comput. 20(5): 991-1015 (2010) - [j45]Jirí Adámek, Stefan Milius, Jiri Velebil:
Iterative reflections of monads. Math. Struct. Comput. Sci. 20(3): 419-452 (2010) - [c33]Jirí Adámek, Stefan Milius, Jiri Velebil:
Recursive Program Schemes and Context-Free Monads. CMCS 2010: 3-23
2000 – 2009
- 2009
- [b3]Jirí Adámek, Horst Herrlich, George E. Strecker:
Abstract and Concrete Categories - The Joy of Cats. Dover Publications 2009, ISBN 978-0-486-46934-8, pp. 1-517 - [j44]Jirí Adámek, Michel Hébert, Lurdes Sousa:
The Orthogonal Subcategory Problem and the Small Object Argument. Appl. Categorical Struct. 17(3): 211-246 (2009) - [j43]Pavel Parízek, Jirí Adámek, Tomas Kalibera:
Automated Construction of Reasonable Environment for Java Components. Electron. Notes Theor. Comput. Sci. 253(1): 145-160 (2009) - [c32]Jirí Adámek, Stefan Milius, Jiri Velebil:
Semantics of Higher-Order Recursion Schemes. CALCO 2009: 49-63 - [c31]Jirí Adámek, Stefan Milius, Jiri Velebil:
A Description of Iterative Reflections of Monads (Extended Abstract). FoSSaCS 2009: 152-166 - [c30]Jirí Adámek, Stefan Milius, Jiri Velebil:
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract). MFPS 2009: 407-427 - 2008
- [j42]Jirí Adámek, Stefan Milius, Jiri Velebil:
Bases for parametrized iterativity. Inf. Comput. 206(8): 966-1002 (2008) - [j41]Jirí Adámek, Stephen L. Bloom, Stefan Milius:
On Algebras with Iteration. J. Log. Comput. 18(6): 1047-1085 (2008) - [c29]Ales Plsek, Jirí Adámek:
Carmen: Software Component Model Checker. QoSA 2008: 71-85 - [c28]Pavel Parízek, Jirí Adámek:
Checking Session-Oriented Interactions between Web Services. EUROMICRO-SEAA 2008: 3-10 - [c27]Jirí Adámek, Clemens Kupke:
Preface. CMCS 2008: 1-2 - [e2]Jirí Adámek, Clemens Kupke:
Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science, CMCS 2008, Budapest, Hungary, April 4-6, 2008. Electronic Notes in Theoretical Computer Science 203(5), Elsevier 2008 [contents] - 2007
- [j40]Jirí Adámek, Dominik Lücke, Stefan Milius:
Recursive coalgebras of finitary functors. RAIRO Theor. Informatics Appl. 41(4): 447-462 (2007) - [j39]Jirí Adámek, Stefan Milius, Jiri Velebil:
Algebras with parametrized iterativity. Theor. Comput. Sci. 388(1-3): 130-151 (2007) - [c26]Jirí Adámek, Stefan Milius, Jiri Velebil:
What Are Iteration Theories? MFCS 2007: 240-252 - 2006
- [j38]Jirí Adámek, Stefan Milius:
Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004. Inf. Comput. 204(4): 435-436 (2006) - [j37]Jirí Adámek, Stefan Milius:
Terminal coalgebras and free iterative theories. Inf. Comput. 204(7): 1139-1172 (2006) - [j36]Jirí Adámek, Stefan Milius, Jiri Velebil:
Elgot Algebras. Log. Methods Comput. Sci. 2(5) (2006) - [j35]Jirí Adámek, Stefan Milius, Jiri Velebil:
Iterative algebras at work. Math. Struct. Comput. Sci. 16(6): 1085-1131 (2006) - [j34]Jirí Adámek:
The intersection of algebra and coalgebra. Theor. Comput. Sci. 366(1-2): 82-97 (2006) - [c25]Jirí Adámek:
Addressing Unbounded Parallelism in Verification of Software Components. SNPD 2006: 49-56 - [c24]Jirí Adámek, Stefan Milius, Jiri Velebil:
How Iterative are Iterative Algebras? CMCS 2006: 157-175 - [i2]Jirí Adámek, Stefan Milius, Jiri Velebil:
Elgot Algebras. CoRR abs/cs/0609040 (2006) - 2005
- [j33]Jirí Adámek, Stefan Milius, Jiri Velebil:
A general final coalgebra theorem. Math. Struct. Comput. Sci. 15(3): 409-432 (2005) - [j32]Jirí Adámek, Frantisek Plasil:
Component composition errors and update atomicity: static analysis. J. Softw. Maintenance Res. Pract. 17(5): 363-377 (2005) - [c23]Jirí Adámek:
Algebra 'cap' Coalgebra = Presheaves. CALCO 2005: 67-82 - [c22]Jirí Adámek:
A Logic of Coequations. CSL 2005: 70-86 - [c21]Vladimir Mencl, Frantisek Plasil, Jirí Adámek:
Behavior Assembly and Composition of Use Cases - UML 2.0 Perspective. IASTED Conf. on Software Engineering 2005: 193-201 - [c20]Jirí Adámek, Stefan Milius, Jiri Velebil:
Elgot Algebras: (Extended Abstract). MFPS 2005: 87-109 - 2004
- [j31]Jirí Adámek:
On quasivarieties and varieties as categories. Stud Logica 78(1-2): 7-33 (2004) - [j30]Jirí Adámek, Hans-E. Porst:
On tree coalgebras and coalgebra presentations. Theor. Comput. Sci. 311(1-3): 257-283 (2004) - [j29]Jirí Adámek, Stefan Milius, Jiri Velebil:
On coalgebra based on classes. Theor. Comput. Sci. 316(1): 3-23 (2004) - [c19]Jirí Adámek, Frantisek Plasil:
Partial Bindings of Components - Any Harm?. APSEC 2004: 632-639 - [c18]Jirí Adámek, Frantisek Plasil:
Erroneous architecture is a relative concept. IASTED Conf. on Software Engineering and Applications 2004: 715-720 - [c17]Jirí Adámek, Stefan Milius:
Preface. CMCS 2004: 1-2 - [c16]Jirí Adámek, Stefan Milius, Jiri Velebil:
From Iterative Algebras to Iterative Theories (Extended Abstract). CMCS 2004: 3-24 - [c15]Jirí Adámek, Stefan Milius, Jiri Velebil:
Iterative Algebras for a Base. CTCS 2004: 147-170 - [e1]Jirí Adámek, Stefan Milius:
Proceedings of the Workshop on Coalgebraic Methods in Computer Science, CMCS 2004, Barcelona, Spain, March 27-29, 2004. Electronic Notes in Theoretical Computer Science 106, Elsevier 2004 [contents] - 2003
- [j28]Jirí Adámek, Stefan Milius, Jiri Velebil:
Some Remarks on Finitary and Iterative Monads. Appl. Categorical Struct. 11(6): 521-541 (2003) - [j27]Jirí Adámek, Hans-E. Porst:
On Varieties and Covarieties in a Category. Math. Struct. Comput. Sci. 13(2): 201-232 (2003) - [j26]Jirí Adámek, Stefan Milius, Jiri Velebil:
Free Iterative Theories: A Coalgebraic View. Math. Struct. Comput. Sci. 13(2): 259-320 (2003) - [j25]Jirí Adámek, Martín Hötzel Escardó, Martin Hofmann:
Preface. Theor. Comput. Sci. 294(1/2): 1 (2003) - [j24]Jirí Adámek:
On final coalgebras of continuous functors. Theor. Comput. Sci. 294(1/2): 3-29 (2003) - [j23]Peter Aczel, Jirí Adámek, Stefan Milius, Jiri Velebil:
Infinite trees and completely iterative theories: a coalgebraic view. Theor. Comput. Sci. 300(1-3): 1-45 (2003) - [c14]Jirí Adámek:
Static analysis of component systems using behavior protocols. OOPSLA Companion 2003: 116-117 - [c13]Jirí Adámek:
On a Description of Terminal Coalgebras and Iterative Theories. CMCS 2003: 1-16 - [i1]Jirí Adámek, Stefan Milius, Jiri Velebil:
On coalgebra based on classes. CoRR cs.LO/0306118 (2003) - 2002
- [j22]Jirí Adámek, Horst Herrlich, Jirí Rosický, Walter Tholen:
Weak Factorization Systems and Topological Functors. Appl. Categorical Struct. 10(3): 237-249 (2002) - [j21]Jirí Adámek:
Final Coalgebras are Ideal Completions of Initial Algebras. J. Log. Comput. 12(2): 217-242 (2002) - [j20]Jirí Adámek, Michel Hébert, Jirí Rosický:
On abstract data types presented by multiequations. Theor. Comput. Sci. 275(1-2): 427-462 (2002) - [c12]Jirí Adámek, Stefan Milius, Jiri Velebil:
Parametric corecursion and completely iterative monads. FICS 2002: 2-5 - [c11]Jirí Adámek, Stefan Milius, Jiri Velebil:
Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors. CMCS 2002: 1-28 - [c10]Jirí Adámek, Stefan Milius, Jiri Velebil:
On Rational Monads and Free Iterative Theories. CTCS 2002: 23-46 - 2001
- [j19]Jirí Adámek, Lurdes Sousa:
Constructions of Solid Hulls. Appl. Categorical Struct. 9(1): 1-13 (2001) - [c9]Peter Aczel, Jirí Adámek, Jiri Velebil:
A Coalgebraic View of Infinite Trees and Iteration. CMCS 2001: 1-26 - [c8]Jirí Adámek, Hans-E. Porst:
From Varieties of Algebras to Covarieties of Coalgebras. CMCS 2001: 27-46 - 2000
- [j18]Jirí Adámek, Francis Borceux:
Morita Equivalence of Sketches. Appl. Categorical Struct. 8(3): 503-517 (2000)
1990 – 1999
- 1997
- [j17]Jirí Adámek, Peter T. Johnstone, Johann A. Makowsky, Jirí Rosický:
Finitary Sketches. J. Symb. Log. 62(3): 699-707 (1997) - [j16]Jirí Adámek:
A Categorical Generalization of Scott Domains. Math. Struct. Comput. Sci. 7(5): 419-443 (1997) - 1996
- [j15]Jirí Adámek:
A remark on fixed points of functors in topological categories. Appl. Categorical Struct. 4(1): 121-126 (1996) - [j14]Jirí Adámek, Jirí Rosický:
On geometric and finitary sketches. Appl. Categorical Struct. 4(2-3): 227-240 (1996) - 1995
- [j13]Jirí Adámek:
Recursive Data Types in Algebraically omega-Complete Categories. Inf. Comput. 118(2): 181-190 (1995) - [j12]Jirí Adámek, Evelyn Nelson, Jan Reiterman:
Continuous Algebras Revisited. J. Comput. Syst. Sci. 51(3): 460-471 (1995) - [j11]Jirí Adámek, Jirí Rosický:
Finitary Sketches and Finitely Accessible Categories. Math. Struct. Comput. Sci. 5(3): 315-322 (1995) - [j10]Jirí Adámek, Václav Koubek:
On the Greatest Fixed Point of a Set Functor. Theor. Comput. Sci. 150(1): 57-75 (1995) - 1994
- [j9]Jirí Adámek, Jan Reiterman:
Banach's Fixed-Point Theorem as a base for data-type equations. Appl. Categorical Struct. 2(1): 77-90 (1994) - 1992
- [j8]Jirí Adámek, Jirí Rosický:
On orthogonal subcategories of locally presentable categories. Discret. Math. 108(1-3): 133-137 (1992) - 1991
- [b2]Jirí Adámek:
Foundations of coding - theory and applications of error-correcting codes with an introduction to cryptography and information theory. Wiley 1991, ISBN 978-0-471-62187-4, pp. I-XIII, 1-336
1980 – 1989
- 1988
- [j7]Jirí Adámek, Alan H. Mekler, Evelyn Nelson, Jan Reiterman:
On the logic of continuous algebras. Notre Dame J. Formal Log. 29(3): 365-380 (1988) - 1986
- [j6]Jirí Adámek, Jan Reiterman, Evelyn Nelson:
Continuous Semilattices. Theor. Comput. Sci. 43: 293-313 (1986) - 1985
- [c7]Jirí Adámek, Horst Herrlich:
Cartesian Closed Categories, Quasitopoi and Topological Universes. Mathematical Foundations of Programming Semantics 1985: 20-41 - 1983
- [b1]Jirí Adámek:
Theory of Mathematical Structures. Reidel 1983, ISBN 978-90-277-1459-6, pp. I-X, 1-317 - [j5]Jirí Adámek, Evelyn Nelson:
Separately Continuous Algebras. Theor. Comput. Sci. 27: 225-231 (1983) - 1982
- [j4]Jirí Adámek, Evelyn Nelson, Jan Reiterman:
Tree Constructions of Free Continuous Algebras. J. Comput. Syst. Sci. 24(1): 114-146 (1982) - 1981
- [c6]Jirí Adámek:
Observability and Nerode Equivalence in Concrete C5ategories. FCT 1981: 1-15 - 1980
- [j3]Jirí Adámek, Hartmut Ehrig, Vera Trnková:
On an equivalence of system-theoretical and categorical concepts. Kybernetika 16(5): 389-410 (1980)
1970 – 1979
- 1979
- [j2]