A Calculus of Circular Proofs and Its Categorical Semantics
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Iteration Theories of Boolean Functions
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Recursion and corecursion have the same equational logic
Theoretical Computer Science - Category theory and computer science
Infinite trees and completely iterative theories: a coalgebraic view
Theoretical Computer Science
The multiplicative fragment of the Yanov equational theory
Theoretical Computer Science
An extension theorem with an application to formal tree series
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Free iterative theories: a coalgebraic view
Mathematical Structures in Computer Science
Geometry of Interaction and linear combinatory algebras
Mathematical Structures in Computer Science
Implementing collection classes with monads
Mathematical Structures in Computer Science
Theoretical Computer Science - Words, languages and combinatorics
*-μ-Semirings and *-μ-lamda;-semirings
Theoretical Computer Science
Terminal coalgebras and free iterative theories
Information and Computation
Ambiguous classes in µ-calculi hierarchies
Theoretical Computer Science - Foundations of software science and computation structures
The category-theoretic solution of recursive program schemes
Theoretical Computer Science - Algebra and coalgebra in computer science
A regular viewpoint on processes and algebra
Acta Cybernetica
Note: Schützenberger's theorem on formal power series follows from Kleene's theorem
Theoretical Computer Science
Calculating Colimits Compositionally
Concurrency, Graphs and Models
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Partial Conway and Iteration Semirings
Fundamenta Informaticae
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Cycle-Free Finite Automata in Partial Iterative Semirings
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Peano Structures and the Semantics of Iteration
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Modal fixed-point logic and changing models
Pillars of computer science
A semantical approach to equilibria and rationality
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
From Coalgebraic to Monoidal Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
Iterative reflections of monads
Mathematical Structures in Computer Science
Equational properties of iterative monads
Information and Computation
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Elgot theories: A new perspective on the equational properties of iteration
Mathematical Structures in Computer Science
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
From corecursive algebras to corecursive monads
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
The category theoretic solution of recursive program schemes
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Partial conway and iteration semiring-semimodule pairs
Algebraic Foundations in Computer Science
Fundamenta Informaticae
Partial Conway and Iteration Semirings
Fundamenta Informaticae
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
PROCESSES WITH MULTIPLE ENTRIES AND EXITS MODULO ISOMORPHISM AND MODULO BISIMULATION
Fundamenta Informaticae
Is observational congruence axiomatisable in equational horn logic?
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.01 |