Modeling Interaction by Sheaves and Geometric Logic
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On final coalgebras of continuous functors
Theoretical Computer Science - Category theory and computer science
Infinite trees and completely iterative theories: a coalgebraic view
Theoretical Computer Science
Categorical foundations for randomly timed automata
Theoretical Computer Science
On varieties and covarieties in a category
Mathematical Structures in Computer Science
Free iterative theories: a coalgebraic view
Mathematical Structures in Computer Science
Minimal realization in bicategories of automata
Mathematical Structures in Computer Science
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory
Theoretical Computer Science
On tree coalgebras and coalgebra presentations
Theoretical Computer Science
Theoretical Computer Science - Logic, semantics and theory of programming
Operations and equations for coalgebras
Mathematical Structures in Computer Science
Automata and fixed point logic: a coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Terminal coalgebras and free iterative theories
Information and Computation
The category-theoretic solution of recursive program schemes
Theoretical Computer Science - Algebra and coalgebra in computer science
Predicate Liftings Versus Nabla Modalities
Electronic Notes in Theoretical Computer Science (ENTCS)
Coequational Logic for Finitary Functors
Electronic Notes in Theoretical Computer Science (ENTCS)
A Bialgebraic Approach to Automata and Formal Language Theory
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
On the construction of free algebras for equational systems
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata and Fixed Point Logics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Functors Determined by Values on Objects
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Free modal algebras: a coalgebraic perspective
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Higher dimensional trees, algebraically
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Semantics of higher-order recursion schemes
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Free Heyting algebras: revisited
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Subsequential transducers: a coalgebraic perspective
Information and Computation
Presenting functors on many-sorted varieties and applications
Information and Computation
Coequational logic for accessible functors
Information and Computation
Automata for coalgebras: an approach using predicate liftings
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Equational presentations of functors and monads
Mathematical Structures in Computer Science
Initial algebras and terminal coalgebras in many-sorted sets
Mathematical Structures in Computer Science
Finitary functors: from set to preord and poset
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Computation of partial automata through span composition
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
The category theoretic solution of recursive program schemes
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Modalities in the Stone age: A comparison of coalgebraic logics
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
The Logic of Exact Covers: Completeness and Uniform Interpolation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |