Follow
Stefan Milius
Stefan Milius
FAU Erlangen-Nürnberg
Verified email at stefan-milius.eu - Homepage
Title
Cited by
Cited by
Year
Infinite trees and completely iterative theories: a coalgebraic view
P Aczel, J Adámek, S Milius, J Velebil
Theoretical Computer Science 300 (1-3), 1-45, 2003
1392003
Completely iterative algebras and completely iterative monads
S Milius
Information and Computation 196 (1), 1-41, 2005
982005
Iterative algebras at work
J Adámek, S Milius, J Velebil
Mathematical Structures in Computer Science 16 (6), 1085-1131, 2006
912006
A sound and complete calculus for finite stream circuits
S Milius
2010 25th Annual IEEE Symposium on Logic in Computer Science, 421-430, 2010
712010
Elgot algebras
J Adámek, S Milius, J Velebil
Logical Methods in Computer Science 2, 2006
702006
Sound and complete axiomatizations of coalgebraic language equivalence
MM Bonsangue, S Milius, A Silva
ACM Transactions on Computational Logic (TOCL) 14 (1), 1-52, 2013
642013
A coalgebraic perspective on minimization and determinization
J Adámek, F Bonchi, M Hülsbusch, B König, S Milius, A Silva
Foundations of Software Science and Computational Structures: 15th …, 2012
642012
Free iterative theories: a coalgebraic view
JIRÍ ADÁMEK, S Milius, JIRÍ VELEBIL
Mathematical Structures in Computer Science 13 (2), 259, 2003
582003
On coalgebra based on classes
J Adámek, S Milius, J Velebil
Theoretical Computer Science 316 (1-3), 3-23, 2004
452004
Generic trace semantics and graded monads
S Milius, D Pattinson, L Schröder
6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015
442015
The category-theoretic solution of recursive program schemes
S Milius, LS Moss
Theoretical Computer Science 366 (1-2), 3-59, 2006
402006
Recursive coalgebras of finitary functors
J Adámek, D Lücke, S Milius
RAIRO-Theoretical Informatics and Applications 41 (4), 447-462, 2007
382007
Nominal automata with name binding
L Schröder, D Kozen, S Milius, T Wißmann
Foundations of Software Science and Computation Structures: 20th …, 2017
352017
Eilenberg Theorems for Free
H Urbat, J Adámek, LT Chen, S Milius
Mathematical Foundations of Computer Science 2017, 2016
35*2016
Generalized eilenberg theorem I: local varieties of languages
J Adámek, S Milius, RSR Myers, H Urbat
Foundations of Software Science and Computation Structures: 17th …, 2014
332014
Well-pointed coalgebras
J Adámek, S Milius, LS Moss, L Sousa
Logical Methods in Computer Science 9, 2013
322013
Terminal coalgebras and free iterative theories
S Milius
Information and Computation 204 (7), 1139-1172, 2006
312006
Abstract GSOS rules and a modular treatment of recursive definitions
S Milius, LS Moss, D Schwencke
Logical Methods in Computer Science 9, 2013
302013
Fixed points of functors
J Adámek, S Milius, LS Moss
Journal of Logical and Algebraic Methods in Programming 95, 41-81, 2018
292018
Semantics of higher-order recursion schemes
J Adamek, S Milius, J Velebil
Logical Methods in Computer Science 7, 2011
292011
The system can't perform the operation now. Try again later.
Articles 1–20