Back to homepage.

Preprints:

Accepted papers:

Published papers:

  1. M. Bílková, A. Kurz, D. Petrişan, J. Velebil: Relation liftings on preorders, in: Proceedings of CALCO 2011, LNCS 6859 (A. Corradini, B. Klin, C. Cirstea, eds.), Springer, 115--129

  2. P. Karazeris, A. Matzaris, J. Velebil: Final coalgebras in accessible categories, Math. Structures Comput. Sci. 21 (2011), 1067--1108

  3. J. Adámek, S. Milius, J. Velebil: On second-order iterative monads, Theoret. Comput. Sci. 412 (2011), 4969--4988

  4. J. Adámek, S. Milius, J. Velebil: Semantics of higher-order recursion schemes, Log. Methods Comput. Sci. Vol. 7 (2011), 1--43

  5. J. Velebil, A. Kurz: Equational presentations of functors and monads, Math. Structures Comput. Sci. 21 (2011), 363--381

  6. J. Adámek, S. Milius, J. Velebil: Elgot theories: A new perspective on the equational properties of iteration, Math. Structures Comput. Sci. 21 (2011), 417--480

  7. M. Bílková, J. Velebil, Y. Venema: On monotone modalities and adjointness, Math. Structures Comput. Sci. 21 (2011), 383--416

  8. J. Adámek, S. Milius, J. Velebil: Equational Properties of Iterative Monads , Inform. and Comput. 208 (2010), 1306--1348

  9. J. Adámek, S. Milius, J. Velebil: Recursive Program Schemes and Context-Free Monads , Proceedings CMCS 2010, Electron. Notes Theor. Comput. Sci. 264 (2010), 3--23

  10. K. Kapulkin, A. Kurz, J. Velebil: Expressivity of coalgebraic logic over posets, In: CWI Research Report SEN-1004 (B.P.F. Jacobs, M. Niqui, J.J.M.M. Rutten, A. Silva, eds.), 2010, 16--17

  11. J. Adámek, S. Milius, J. Velebil: Iterative Reflections of Monads , Math. Structures Comput. Sci., 20.3 (2010), 419--452

  12. J. Adámek, S. Milius, J. Velebil: Semantics of higher-order recursion schemes , Proceedings of CALCO 2009, LNCS 5728 (A. Kurz, M. Lenisa, and A. Tarlecki, eds.), Springer, 49--63

  13. J. Adámek, S. Milius, J. Velebil: Elgot Theories: A new Perspective of Iteration Theories , Electron. Notes Theor. Comput. Sci., 249 (2009), 407--427

  14. P. Karazeris, J. Velebil: Representability Relative to a Doctrine, Cah. Topol. Géom. Différ. Catég. L-1 (2009), 3--22

  15. J. Adámek, S. Milius, J. Velebil: A Description of Iterative Reflections of Monads, Proceedings of FoSSaCS 2009 (L. de Alfaro, ed.), LNCS 5504, Springer, 152--166

  16. J. Adámek, J. Velebil: Analytic Functors and Weak Pullbacks, Theory Appl. Categ. Vol. 21 (2008), 191--209

  17. J. Adámek, S. Milius, J. Velebil: Bases for Parametrized Iterativity, Inform. and Comput., 206.8 (2008), 966--1002

  18. J. Adámek, R. Börger, S. Milius, J. Velebil: Iterative Algebras: How Iterative Are They?, Theory Appl. Categ., Vol. 19 (2008), 61--92

  19. J. Adámek, S. Milius, J. Velebil: Algebras with Parametrized Iterativity, Theoret. Comput. Sci. 388 (2007), 130--151

  20. J. Adámek, S. Milius, J. Velebil: What are Iteration Theories?, Proceedings of MFCS 2007 (L. Kučera and A. Kučera, eds.), LNCS 4708, Springer, 240--252

  21. P. Karazeris, J. Velebil: Dense Morphisms of Monads , Theory Appl. Categ., Vol. 18 (2007), 372-399

  22. J. Adámek, S. Milius, J. Velebil: Iterative Algebras at Work, Math. Structures Comput. Sci., 16.6 (2006), 1085--1131

  23. J. Adámek, S. Milius, J. Velebil: Elgot Algebras, Log. Methods Comput. Sci., Vol. 2(5:4) (2006), 1--31

  24. J. Adámek, S. Milius, J. Velebil: How Iterative are Iterative Algebras?, Electron. Notes Theor. Comput. Sci., 164.1 (2006), 157--175

  25. J. Adámek, S. Milius, J. Velebil: Elgot Algebras (Extended Abstract), Electron. Notes Theor. Comput. Sci., 155 (2006), 87--109

  26. J. Adámek, S. Milius, J. Velebil: A General Final Coalgebra Theorem, Math. Structures Comput. Sci., 15.3 (2005), 409--432

  27. J. Adámek, S. Milius, J. Velebil: Iterative Algebras for a Base, Electron. Notes Theor. Comput. Sci., 122 (2005), 147--170

  28. P. Karazeris, J. Rosický, J. Velebil: Completeness of Cocompletions, J. Pure Appl. Algebra, 196 (2005), 229--250

  29. J. Adámek, S. Milius, J. Velebil: From Iterative Algebras to Iterative Theories (Extended Abstract), Electron. Notes Theor. Comput. Sci., 106 (2004), 3--24

  30. J. Adámek, S. Milius, J. Velebil: On Coalgebra Based on Classes, Theoret. Comput. Sci., 316 (2004), 3--23

  31. J. Adámek, S. Milius, J. Velebil: Some Remarks on Finitary and Iterative Monads, Appl. Categ. Structures, 11 (2003), 521--541

  32. P. Aczel, J. Adámek, S. Milius, J. Velebil: Infinite Trees and Completely Iterative Theories --- A Coalgebraic View, (A Fundamental Study), Theoret. Comput. Sci, 300 (2003), 1--45

  33. J. Adámek, S. Milius, J. Velebil: Free Iterative Theories --- A Coalgebraic View, Math. Structures Comput. Sci., 13 (2003), 259--320

  34. J. Adámek, S. Milius, J. Velebil: On Rational Monads and Free Iterative Theories, Electron. Notes Theor. Comput. Sci. 69 (2003)

  35. R. El Bashir, J. Velebil: Simultaneously Reflective and Coreflective Subcategories of Presheaves, Theory Appl. Categ. Vol.10 (2002), 410--423

  36. J. Adámek, S. Milius, J. Velebil: Final Coalgebras and a Solution Theorem for Arbitrary Endofunctors, Electron. Notes Theor. Comput. Sci. 65.1 (2002)

  37. J. Velebil, J. Adámek: A Remark on Conservative Cocompletions of Categories, J. Pure Appl. Algebra 168 (2002), 107--124

  38. J. Adámek, R. El Bashir, M. Sobral, J. Velebil: On Functors Which Are Lax Epimorphisms, Theory Appl. Categ. Vol.8 (2001), 509--521

  39. P. Aczel, J. Adámek, J. Velebil: A Coalgebraic View of Infinite Trees and Iteration, Electron. Notes Theor. Comput. Sci. 44.1 (2001)

  40. J. Adámek, V. Koubek, J. Velebil: A Duality Between Infinitary Varieties and Algebraic Theories, Comment. Math. Univ. Carolin. 41,3 (2000), 529--541

  41. V. Trnková, J. Velebil: On Categories Generalizing Universal Domains, Math. Structures Comput. Sci. (1999), vol. 9, 159--175

  42. J. Velebil: Categorical Generalization of a Universal Domain, Appl. Categ. Structures 7 (1999), 209--226

  43. K. Richta, J. Velebil: Sémantika programovacích jazyků, lecture notes (in Czech), 169pp., Karolinum Publishing House, Praha 1996

PhD Thesis: