 | 2009 |
|---|
| 72 |       | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Semantics of Higher-Order Recursion Schemes.
CALCO 2009: 49-63 |
| 71 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
A Description of Iterative Reflections of Monads (Extended Abstract).
FOSSACS 2009: 152-166 |
| 70 | | Jirí Adámek,
Michel Hébert,
Lurdes Sousa:
The Orthogonal Subcategory Problem and the Small Object Argument.
Applied Categorical Structures 17(3): 211-246 (2009) |
| 69 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 249: 407-427 (2009) |
| 68 | | Pavel Parizek,
Jirí Adámek,
Tomás Kalibera:
Automated Construction of Reasonable Environment for Java Components.
Electr. Notes Theor. Comput. Sci. 253(1): 145-160 (2009) |
| 2008 |
|---|
| 67 | | Ales Plsek,
Jirí Adámek:
Carmen: Software Component Model Checker.
QoSA 2008: 71-85 |
| 66 | | Pavel Parizek,
Jirí Adámek:
Checking Session-Oriented Interactions between Web Services.
SEAA 2008: 3-10 |
| 65 | | Jirí Adámek,
Clemens Kupke:
Preface.
Electr. Notes Theor. Comput. Sci. 203(5): 1-2 (2008) |
| 64 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Bases for parametrized iterativity.
Inf. Comput. 206(8): 966-1002 (2008) |
| 63 | | Jirí Adámek,
Stephen L. Bloom,
Stefan Milius:
On Algebras with Iteration.
J. Log. Comput. 18(6): 1047-1085 (2008) |
| 2007 |
|---|
| 62 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
What Are Iteration Theories?
MFCS 2007: 240-252 |
| 61 | | Jirí Adámek,
Dominik Lücke,
Stefan Milius:
Recursive coalgebras of finitary functors.
ITA 41(4): 447-462 (2007) |
| 60 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Algebras with parametrized iterativity.
Theor. Comput. Sci. 388(1-3): 130-151 (2007) |
| 2006 |
|---|
| 59 | | Jirí Adámek:
Addressing Unbounded Parallelism in Verification of Software Components.
SNPD 2006: 49-56 |
| 58 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Elgot Algebras
CoRR abs/cs/0609040: (2006) |
| 57 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Elgot Algebras: (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 155: 87-109 (2006) |
| 56 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
How Iterative are Iterative Algebras?
Electr. Notes Theor. Comput. Sci. 164(1): 157-175 (2006) |
| 55 | | Jirí Adámek,
Stefan Milius:
Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004.
Inf. Comput. 204(4): 435-436 (2006) |
| 54 | | Jirí Adámek,
Stefan Milius:
Terminal coalgebras and free iterative theories.
Inf. Comput. 204(7): 1139-1172 (2006) |
| 53 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Elgot Algebras.
Logical Methods in Computer Science 2(5): (2006) |
| 52 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Iterative algebras at work.
Mathematical Structures in Computer Science 16(6): 1085-1131 (2006) |
| 51 | | Jirí Adámek:
The intersection of algebra and coalgebra.
Theor. Comput. Sci. 366(1-2): 82-97 (2006) |
| 2005 |
|---|
| 50 | | Jirí Adámek:
Algebra 'cap' Coalgebra = Presheaves.
CALCO 2005: 67-82 |
| 49 | | Jirí Adámek:
A Logic of Coequations.
CSL 2005: 70-86 |
| 48 |  | 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 |
| 47 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Iterative Algebras for a Base.
Electr. Notes Theor. Comput. Sci. 122: 147-170 (2005) |
| 46 | | Jirí Adámek,
Frantisek Plasil:
Component composition errors and update atomicity: static analysis.
Journal of Software Maintenance 17(5): 363-377 (2005) |
| 45 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
A general final coalgebra theorem.
Mathematical Structures in Computer Science 15(3): 409-432 (2005) |
| 2004 |
|---|
| 44 | | Jirí Adámek,
Frantisek Plasil:
Partial Bindings of Components - Any Harm?.
APSEC 2004: 632-639 |
| 43 | | Jirí Adámek,
Frantisek Plasil:
Erroneous architecture is a relative concept.
IASTED Conf. on Software Engineering and Applications 2004: 715-720 |
| 42 | | Jirí Adámek,
Stefan Milius:
Preface.
Electr. Notes Theor. Comput. Sci. 106: 1-2 (2004) |
| 41 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
From Iterative Algebras to Iterative Theories (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 106: 3-24 (2004) |
| 40 | | Jirí Adámek:
On quasivarieties and varieties as categories.
Studia Logica 78(1-2): 7-33 (2004) |
| 39 | | Jirí Adámek,
Hans-E. Porst:
On tree coalgebras and coalgebra presentations.
Theor. Comput. Sci. 311(1-3): 257-283 (2004) |
| 38 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
On coalgebra based on classes.
Theor. Comput. Sci. 316(1): 3-23 (2004) |
| 2003 |
|---|
| 37 | | Jirí Adámek:
Static analysis of component systems using behavior protocols.
OOPSLA Companion 2003: 116-117 |
| 36 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Some Remarks on Finitary and Iterative Monads.
Applied Categorical Structures 11(6): 521-541 (2003) |
| 35 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
On coalgebra based on classes
CoRR cs.LO/0306118: (2003) |
| 34 | | Jirí Adámek:
On a Description of Terminal Coalgebras and Iterative Theories.
Electr. Notes Theor. Comput. Sci. 82(1): (2003) |
| 33 | | Jirí Adámek,
Hans-E. Porst:
On Varieties and Covarieties in a Category.
Mathematical Structures in Computer Science 13(2): 201-232 (2003) |
| 32 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Free Iterative Theories: A Coalgebraic View.
Mathematical Structures in Computer Science 13(2): 259-320 (2003) |
| 31 | | Jirí Adámek,
Martín Hötzel Escardó,
Martin Hofmann:
Preface.
Theor. Comput. Sci. 294(1/2): 1 (2003) |
| 30 | | Jirí Adámek:
On final coalgebras of continuous functors.
Theor. Comput. Sci. 294(1/2): 3-29 (2003) |
| 29 | | 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) |
| 2002 |
|---|
| 28 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Parametric corecursion and completely iterative monads.
FICS 2002: 2-5 |
| 27 | | Jirí Adámek,
Horst Herrlich,
Jirí Rosický,
Walter Tholen:
Weak Factorization Systems and Topological Functors.
Applied Categorical Structures 10(3): 237-249 (2002) |
| 26 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors.
Electr. Notes Theor. Comput. Sci. 65(1): (2002) |
| 25 | | Jirí Adámek,
Stefan Milius,
Jiri Velebil:
On Rational Monads and Free Iterative Theories.
Electr. Notes Theor. Comput. Sci. 69: (2002) |
| 24 | | Jirí Adámek:
Final Coalgebras are Ideal Completions of Initial Algebras.
J. Log. Comput. 12(2): 217-242 (2002) |
| 23 | | Jirí Adámek,
Michel Hébert,
Jirí Rosický:
On abstract data types presented by multiequations.
Theor. Comput. Sci. 275(1-2): 427-462 (2002) |
| 2001 |
|---|
| 22 | | Jirí Adámek,
Lurdes Sousa:
Constructions of Solid Hulls.
Applied Categorical Structures 9(1): 1-13 (2001) |
| 21 | | Peter Aczel,
Jirí Adámek,
Jiri Velebil:
A Coalgebraic View of Infinite Trees and Iteration.
Electr. Notes Theor. Comput. Sci. 44(1): (2001) |
| 20 | | Jirí Adámek,
Hans-E. Porst:
From Varieties of Algebras to Covarieties of Coalgebras.
Electr. Notes Theor. Comput. Sci. 44(1): (2001) |
| 2000 |
|---|
| 19 | | Jirí Adámek,
Francis Borceux:
Morita Equivalence of Sketches.
Applied Categorical Structures 8(3): 503-517 (2000) |
| 1997 |
|---|
| 18 | | Jirí Adámek,
Peter T. Johnstone,
Johann A. Makowsky,
Jirí Rosický:
Finitary Sketches.
J. Symb. Log. 62(3): 699-707 (1997) |
| 17 | | Jirí Adámek:
A Categorical Generalization of Scott Domains.
Mathematical Structures in Computer Science 7(5): 419-443 (1997) |
| 1995 |
|---|
| 16 | | Jirí Adámek:
Recursive Data Types in Algebraically omega-Complete Categories
Inf. Comput. 118(2): 181-190 (1995) |
| 15 | | Jirí Adámek,
Evelyn Nelson,
Jan Reiterman:
Continuous Algebras Revisited.
J. Comput. Syst. Sci. 51(3): 460-471 (1995) |
| 14 | | Jirí Adámek,
Jirí Rosický:
Finitary Sketches and Finitely Accessible Categories.
Mathematical Structures in Computer Science 5(3): 315-322 (1995) |
| 13 | | Jirí Adámek,
Václav Koubek:
On the Greatest Fixed Point of a Set Functor.
Theor. Comput. Sci. 150(1): 57-75 (1995) |
| 1992 |
|---|
| 12 | | Jirí Adámek,
Jirí Rosický:
On orthogonal subcategories of locally presentable categories.
Discrete Mathematics 108(1-3): 133-137 (1992) |
| 1986 |
|---|
| 11 | | Jirí Adámek,
Jan Reiterman,
Evelyn Nelson:
Continuous Semilattices.
Theor. Comput. Sci. 43: 293-313 (1986) |
| 1985 |
|---|
| 10 | | Jirí Adámek,
Horst Herrlich:
Cartesian Closed Categories, Quasitopoi and Topological Universes.
Mathematical Foundations of Programming Semantics 1985: 20-41 |
| 1983 |
|---|
| 9 | | Jirí Adámek,
Evelyn Nelson:
Separately Continuous Algebras.
Theor. Comput. Sci. 27: 225-231 (1983) |
| 1982 |
|---|
| 8 | | Jirí Adámek,
Evelyn Nelson,
Jan Reiterman:
Tree Constructions of Free Continuous Algebras.
J. Comput. Syst. Sci. 24(1): 114-146 (1982) |
| 1981 |
|---|
| 7 | | Jirí Adámek:
Observability and Nerode Equivalence in Concrete C5ategories.
FCT 1981: 1-15 |
| 1979 |
|---|
| 6 | | Vera Trnková,
Jirí Adámek:
Tree-group automata.
FCT 1979: 462-468 |
| 5 | | Jirí Adámek,
Václav Koubek:
Least Fixed Point of a Functor.
J. Comput. Syst. Sci. 19(2): 163-178 (1979) |
| 1977 |
|---|
| 4 | | Jirí Adámek,
Václav Koubek:
Remarks on Fixed Points of Functors.
FCT 1977: 199-205 |
| 3 | | Jirí Adámek,
Vera Trnková:
Recognizable and Regular Languages in a Category.
FCT 1977: 206-211 |
| 2 | | Vera Trnková,
Jirí Adámek:
On Languages, Accepted by Machines in the Category of Sets.
MFCS 1977: 523-531 |
| 1975 |
|---|
| 1 | | Jirí Adámek:
Automata and Categories: Finiteness Contra Minimality.
MFCS 1975: 160-166 |
