1 West 4.58
Dept of Computer Science
Tel: +44 (0) 1225 38 4439
Dr John Power
Research interests lie in category theory, with particular focus on enriched categories, higher-dimensional categories, and categories with algebraic structure. This research involves work on a variety of topics within computer science, in principle any for which category theory, especially its more algebraic aspects, seems likely to be of value, such as computational effects and data refinement.
McCusker, G., Power, J. and Wingfield, C., 2015. A graphical foundation for interleaving in game semantics. Journal of Pure and Applied Algebra, 219 (4), pp. 1131-1174.
Komendantskaya, E., Power, J. and Schmidt, M., 2014. Coalgebraic logic programming:from semantics to implementation. Journal of Logic and Computation
Behrisch, M., Kerkhoff, S. and Power, J., 2012. Category theoretic understandings of universal algebra and its dual: monads and Lawvere theories, comonads and what? Electronic Notes in Theoretical Computer Science, 286, pp. 5-16.
Komendantskaya, E. and Power, J., 2011. Coalgebraic semantics for derivations in logic programming. Heidelberg: Springer, pp. 268-282.
Komendantskaya, E., McCusker, G. and Power, J., 2011. Coalgebraic semantics for parallel derivation strategies in logic programming. Springer, pp. 111-127.
McCusker, G. A. and Power, J., 2010. Modelling local variables: possible worlds and object spaces. Electronic Notes in Theoretical Computer Science, 265, pp. 389-402.
Lack, S. and Power, J., 2009. Gabriel-Ulmer duality and Lawvere theories enriched over a general base. Journal of Functional Programming, 19 (3-4), pp. 265-286.
Power, J. and Tanaka, M., 2009. Axiomatics for Data Refinement in Call by Value Programming Languages. Electronic Notes in Theoretical Computer Science, 225, pp. 281-302.
Plotkin, G. and Power, J., 2008. Tensors of comodels and models for operational semantics. Electronic Notes in Theoretical Computer Science, 218, pp. 295-311.
Power, J. and Tanaka, M., 2008. Category Theoretic Semantics for Typed Binding Signatures with Recursion. Fundamenta Informaticae, 84 (2), pp. 221-240.
Komendantskaya, E. and Power, J., 2008. Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness. Heidelberg: Springer, pp. 258-271.