- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j34 |      | Jirí Adámek, Stefan Milius, Jiri Velebil: How iterative reflections of monads are constructed. Inf. Comput. 225: 83-118 (2013) |
| j33 | | Marcello M. Bonsangue, Stefan Milius, Alexandra Silva: Sound and Complete Axiomatizations of Coalgebraic Language Equivalence. ACM Trans. Comput. Log. 14(1): 7 (2013) |
| 2012 | ||
| c19 | | Jirí Adámek, Stefan Milius, Lawrence S. Moss: On Finitary Functors and Their Presentations. CMCS 2012: 51-70 |
| c18 | | 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 |
| c17 | | Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa: Well-Pointed Coalgebras (Extended Abstract). FoSSaCS 2012: 89-103 |
| c16 | | Jirí Adámek, Stefan Milius, Nathan Bowler, Paul Blain Levy: Coproducts of Monads on Set. LICS 2012: 45-54 |
| c15 |  | Stefan Milius, Henning Günther, Jan Peleska, Oliver Möller, Helge Löding, Martin Sulzmann, Ramin Hedayati, Axel Zechner: A framework for formal verification of systems of synchronous components. MBEES 2012: 145-154 |
| c14 | | Henning Günther, Stefan Milius, Oliver Möller: On the Formal Verification of Systems of Synchronous Software Components. SAFECOMP 2012: 291-304 |
| c13 | | Marcello M. Bonsangue, Stefan Milius, Jurriaan Rot: On the specification of operations on the rational behaviour of systems. DCM 2012: 3-18 |
| 2011 | ||
| j32 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Semantics of Higher-Order Recursion Schemes. Logical Methods in Computer Science 7(1) (2011) |
| j31 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Elgot theories: a new perspective on the equational properties of iteration. Mathematical Structures in Computer Science 21(2): 417-480 (2011) |
| j30 | | Jirí Adámek, Stefan Milius, Jiri Velebil: On second-order iterative monads. Theor. Comput. Sci. 412(38): 4969-4988 (2011) |
| c12 | | Jirí Adámek, Mahdieh Haddadi, Stefan Milius: From Corecursive Algebras to Corecursive Monads. CALCO 2011: 55-69 |
| c11 | | Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa: Power-Set Functors and Saturated Trees. CSL 2011: 5-19 |
| c10 | | Ilyas Daskaya, Michaela Huhn, Stefan Milius: Formal Safety Analysis in Industrial Practice. FMICS 2011: 68-84 |
| i4 | | Marcello M. Bonsangue, Stefan Milius, Alexandra Silva: Sound and complete axiomatizations of coalgebraic language equivalence. CoRR abs/1104.2803 (2011) |
| 2010 | ||
| j29 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Recursive Program Schemes and Context-Free Monads. Electr. Notes Theor. Comput. Sci. 264(2): 3-23 (2010) |
| j28 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Equational properties of iterative monads. Inf. Comput. 208(12): 1306-1348 (2010) |
| j27 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Iterative reflections of monads. Mathematical Structures in Computer Science 20(3): 419-452 (2010) |
| c9 | | Stefan Milius, Lawrence S. Moss, Daniel Schwencke: CIA Structures and the Semantics of Recursion. FOSSACS 2010: 312-327 |
| c8 | | |
| 2009 | ||
| j26 | | 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) |
| c7 | | Stefan Milius, Thorsten Palm, Daniel Schwencke: Complete Iterativity for Algebras with Effects. CALCO 2009: 34-48 |
| c6 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Semantics of Higher-Order Recursion Schemes. CALCO 2009: 49-63 |
| c5 | | Jirí Adámek, Stefan Milius, Jiri Velebil: A Description of Iterative Reflections of Monads (Extended Abstract). FOSSACS 2009: 152-166 |
| i3 | | Stefan Milius, Lawrence S. Moss: The Category Theoretic Solution of Recursive Program Schemes. CoRR abs/0904.2385 (2009) |
| 2008 | ||
| j25 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Bases for parametrized iterativity. Inf. Comput. 206(8): 966-1002 (2008) |
| j24 | | Jirí Adámek, Stephen L. Bloom, Stefan Milius: On Algebras with Iteration. J. Log. Comput. 18(6): 1047-1085 (2008) |
| j23 | | Stefan Milius, Lawrence S. Moss: Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59]. Theor. Comput. Sci. 403(2-3): 409-415 (2008) |
| c4 | | Stefan Milius, Uwe Steinke: Modelbasierte Softwareentwicklung mit SCADE in der Eisenbahnautomatisierung. MBEES 2008: 68-77 |
| 2007 | ||
| j22 | | Jirí Adámek, Dominik Lücke, Stefan Milius: Recursive coalgebras of finitary functors. ITA 41(4): 447-462 (2007) |
| j21 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Algebras with parametrized iterativity. Theor. Comput. Sci. 388(1-3): 130-151 (2007) |
| c3 | | |
| 2006 | ||
| j20 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Elgot Algebras: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 155: 87-109 (2006) |
| j19 | | Jirí Adámek, Stefan Milius, Jiri Velebil: How Iterative are Iterative Algebras? Electr. Notes Theor. Comput. Sci. 164(1): 157-175 (2006) |
| j18 | | Jirí Adámek, Stefan Milius: Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004. Inf. Comput. 204(4): 435-436 (2006) |
| j17 | | Jirí Adámek, Stefan Milius: Terminal coalgebras and free iterative theories. Inf. Comput. 204(7): 1139-1172 (2006) |
| j16 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Elgot Algebras. Logical Methods in Computer Science 2(5) (2006) |
| j15 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Iterative algebras at work. Mathematical Structures in Computer Science 16(6): 1085-1131 (2006) |
| j14 | | Stefan Milius, Lawrence S. Moss: The category-theoretic solution of recursive program schemes. Theor. Comput. Sci. 366(1-2): 3-59 (2006) |
| i2 | | |
| 2005 | ||
| b1 | | Stefan Milius: Coalgebras, monads and semantics. TU Braunschweig 2005 |
| j13 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Iterative Algebras for a Base. Electr. Notes Theor. Comput. Sci. 122: 147-170 (2005) |
| j12 | | Stefan Milius: Completely iterative algebras and completely iterative monads. Inf. Comput. 196(1): 1-41 (2005) |
| j11 | | Jirí Adámek, Stefan Milius, Jiri Velebil: A general final coalgebra theorem. Mathematical Structures in Computer Science 15(3): 409-432 (2005) |
| c2 | | Stefan Milius, Lawrence S. Moss: The Category Theoretic Solution of Recursive Program Schemes. CALCO 2005: 293-312 |
| 2004 | ||
| j10 | | |
| j9 | | Jirí Adámek, Stefan Milius, Jiri Velebil: From Iterative Algebras to Iterative Theories (Extended Abstract). Electr. Notes Theor. Comput. Sci. 106: 3-24 (2004) |
| j8 | | Jirí Adámek, Stefan Milius, Jiri Velebil: On coalgebra based on classes. Theor. Comput. Sci. 316(1): 3-23 (2004) |
| 2003 | ||
| j7 | | Stefan Milius: On Colimits in Categories of Relations. Applied Categorical Structures 11(3): 287-312 (2003) |
| j6 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Some Remarks on Finitary and Iterative Monads. Applied Categorical Structures 11(6): 521-541 (2003) |
| j5 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Free Iterative Theories: A Coalgebraic View. Mathematical Structures in Computer Science 13(2): 259-320 (2003) |
| j4 | | 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) |
| i1 | | |
| 2002 | ||
| j3 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors. Electr. Notes Theor. Comput. Sci. 65(1): 1-28 (2002) |
| j2 | | Jirí Adámek, Stefan Milius, Jiri Velebil: On Rational Monads and Free Iterative Theories. Electr. Notes Theor. Comput. Sci. 69: 23-46 (2002) |
| j1 | | |
| c1 | | Jirí Adámek, Stefan Milius, Jiri Velebil: Parametric corecursion and completely iterative monads. FICS 2002: 2-5 |
Colors in the list of coauthors
Last update Thu May 23 13:56:24 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page