# Dr John Power

## Profile

### Research interests

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.

### Publications

Power, A. and Komendantskaya, E., 2016. Forthcoming. Category theoretic semantics for theorem proving in logic programming: embracing the laxness. Springer.

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.

Kinoshita, Y. and Power, J., 2014. Category theoretic structure of setoids. *Theoretical Computer Science*, 546, pp. 145-163.

Komendantskaya, E., Power, J. and Schmidt, M., 2014. Coalgebraic logic programming:from semantics to implementation. *Journal of Logic and Computation*, 26 (2), 745 - 783.

Power, J. and Wingfield, C., 2014. Preface. *Electronic Notes in Theoretical Computer Science*, 303, pp. 1-2.

McCusker, G., Power, J. and Wingfield, C., 2012. A graphical foundation for schedules. *Electronic Notes in Theoretical Computer Science*, 286, pp. 273-289.

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 Derivations in Logic Programming. *In*: Bezem, M., ed. *Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL.* Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 352-366.

Power, J., 2011. Unicity of Enrichment over Cat or Gpd. *Applied Categorical Structures*, 19 (1), pp. 293-299.

Komendantskaya, E. and Power, J., 2011. Coalgebraic semantics for derivations in logic programming. *In*: Corradini, A., Kin, B. and Cirstea, C., eds. *Algebra and Coalgebra in Computer Science: 4th International Conference, CALCO 2011, Winchetser, UK, August 30 - September 2, 2011. Proceedings.* Heidelberg: Springer, pp. 268-282.

Komendantskaya, E., McCusker, G. and Power, J., 2011. Coalgebraic semantics for parallel derivation strategies in logic programming. *In*: Johnson, M. and Pavlovic, D., eds. *Algebraic Methodology and Software Technology.Vol. 6486.* Springer, pp. 111-127.

Power, J., 2011. Indexed Lawvere theories for local state. *In*: Hart, B., Kucera, T. G., Pillay, A., Scott, P. J. and Seely, R. A. G., eds. *Models, Logics and Higher-Dimensional Categories: A Tribute to the Work of Mihály Makkai.* Rhode Island: American Mathematical Society, pp. 213-229.

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.

Nishizawa, K. and Power, J., 2009. Lawvere theories enriched over a general base. *Journal of Pure and Applied Algebra*, 213 (3), pp. 377-386.

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.

Johnson, M., Naumann, D. and Power, J., 2009. Category Theoretic Models of Data Refinement. *Electronic Notes in Theoretical Computer Science*, 225, pp. 21-38.

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. *In*: *Logics in Artificial Intelligence 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings.Vol. 5293.* Heidelberg: Springer, pp. 258-271.

McCusker, G. and Power, J., 2008. Logic Programs as Coalgebras.