Research

Items by Power, John

Up a level
Export as [feed] RSS 1.0 [feed] Atom [feed] RSS 2.0
Group by: Item Type | Date | No Grouping
Number of items: 85.

Book/s

Articles

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

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.

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

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.

Hyland, M., Levy, P. B., Plotkin, G. and Power, A., 2007. Combining algebraic effects with continuations. Theoretical Computer Science, 375 (1-3), pp. 20-40.

Power, J., 2007. Abstract Syntax: Substitution and Binders. Electronic Notes in Theoretical Computer Science, 173, pp. 3-16.

Hyland, M. and Power, J., 2007. The category theoretic understanding of universal algebra: Lawvere theories and monads. Electronic Notes in Theoretical Computer Science, 172, pp. 437-458.

Hyland, M., Nagayama, M., Power, J. and Rosolini, G., 2006. A Category Theoretic Formulation for Engeler-style Models of the Untyped λ-Calculus. Electronic Notes in Theoretical Computer Science, 161, pp. 43-57.

Power, J., 2006. Countable Lawvere Theories and Computational Effects. Electronic Notes in Theoretical Computer Science, 161, pp. 59-71.

Hyland, M., Plotkin, G. and Power, J., 2006. Combining effects: sum and tensor. Theoretical Computer Science, 357 (1-3), pp. 70-99.

Denney, E., Power, J. and Tourlas, K., 2006. Hiproofs: A Hierarchical Notion of Proof Tree. Electronic Notes in Theoretical Computer Science, 155, pp. 341-359.

Power, J., 2006. Semantics for Local Computational Effects. Electronic Notes in Theoretical Computer Science, 158, pp. 355-371.

Kick, M., Power, J. and Simpson, A., 2006. Coalgebraic semantics for timed processes. Information and Computation, 204 (4), pp. 588-609.

Tanaka, M. and Power, J., 2006. A unified category-theoretic semantics for binding signatures in substructural logics. Journal of Logic and Computation, 16 (1), pp. 5-25.

Hyland, M. and Power, J., 2006. Discrete Lawvere theories and computational effects. Theoretical Computer Science, 366 (1-2), pp. 144-162.

Power, J., 2006. Generic models for computational effects. Theoretical Computer Science, 364 (2), pp. 254-269.

Power, A. J. and Tanaka, M., 2006. Pseudo-distributive laws and axiomatics for variable binding. Higher-Order and Symbolic Computation, 19 (2/3), pp. 305-337.

Power, J. and Shkaravska, O., 2004. From comodels to coalgebras: state and arrays. Electronic Notes in Theoretical Computer Science, 106, pp. 297-314.

Kick, M. and Power, J., 2004. Modularity of behaviours for mathematical operational semantics. Electronic Notes in Theoretical Computer Science, 106, pp. 185-200.

Hyland, M. and Power, J., 2004. Symmetric Monoidal Sketches and Categories of Wirings. Electronic Notes in Theoretical Computer Science, 100, pp. 31-46.

Lenisa, M., Power, J. and Watanabe, H., 2004. Category theory for operational semantics. Theoretical Computer Science, 327 (1-2), pp. 135-154.

Plotkin, G. and Power, J., 2004. Computational Effects and Operations: An Overview. Electronic Notes in Theoretical Computer Science, 73, pp. 149-163.

Levy, P. B., Power, J. and Thielecke, H., 2003. Modelling environments in call-by-value programming languages. Information and Computation, 185 (2), pp. 182-210.

Power, J., 2003. Towards a theory of mathematical operational semantics. Electronic Notes in Theoretical Computer Science, 82 (1), pp. 257-272.

Power, J. and Tourlas, K., 2003. On the Geometric Modelling of Visual Languages. Electronic Notes in Theoretical Computer Science, 72 (3), pp. 1-12.

Plotkin, G. and Power, J., 2003. Algebraic operations and generic effects. Applied Categorical Structures, 11 (1), pp. 69-94.

Ghani, N., Lüth, C., De Marchi, F. and Power, J., 2003. Dualising initial algebras. Coalgebraic methods in computer science (Genova, 2001). Mathematical Structures in Computer Science, 13 (2), pp. 349-370.

Cheng, E., Hyland, M. and Power, J., 2003. Pseudo-distributive laws. Electronic Notes in Theoretical Computer Science, 83.

Hyland, M. and Power, J., 2002. Pseudo-commutative monads and pseudo-closed 2-categories. Journal of Pure and Applied Algebra, 175 (1-3), pp. 141-185.

Power, J. and Watanabe, H., 2002. Combining a monad and a comonad. Theoretical Computer Science, 280 (1-2), pp. 137-162.

Power, J. and Rosolini, G., 2002. Fixpoint operators for domain equations. Theoretical Computer Science, 278 (1-2), pp. 323-333.

Power, J., 2002. Premonoidal categories as categories with algebraic structure. Theoretical Computer Science, 278 (1-2), pp. 303-321.

Hermida, C., Makkai, M. and Power, J., 2002. On weak higher-dimensional categories. I. 3. Journal of Pure and Applied Algebra, 166 (1-2), pp. 83-104.

Anderson, S., Power, J. and Tourlas, K., 2002. Zooming-out on Higraph-based diagrams. Electronic Notes in Theoretical Computer Science, 61, pp. 201-211.

Ghani, N., Lüth, C., de Marchi, F. and Power, J., 2001. Algebras, Coalgebras, Monads and Comonads. Electronic Notes in Theoretical Computer Science, 44 (1), pp. 128-145.

Power, J. and Tourlas, K., 2001. An Algebraic Foundation for Graph-based Diagrams in Computing. Electronic Notes in Theoretical Computer Science, 45, pp. 346-357.

Power, J., 2001. Models for the computational λ-calculus. Electronic Notes in Theoretical Computer Science, 40, pp. 288-301.

Johnstone, P., Power, J., Tsujishita, T., Watanabe, H. and Worrell, J., 2001. On the structure of categories of coalgebras. Theoretical Computer Science, 260 (1-2), pp. 87-117.

Hermida, C., Makkai, M. and Power, J., 2001. On weak higher-dimensional categories. I.2. Journal of Pure and Applied Algebra, 157 (2-3), pp. 247-277.

Hyland, M. and Power, J., 2001. Pseudo-commutative Monads. Electronic Notes in Theoretical Computer Science, 45, pp. 197-208.

Plotkin, G. and Power, J., 2001. Semantics for Algebraic Operations. Electronic Notes in Theoretical Computer Science, 45, pp. 332-345.

Hyland, M. and Power, J., 2001. Two-dimensional linear algebra. Electronic Notes in Theoretical Computer Science, 44 (1), pp. 227-240.

Hermida, C., Makkai, M. and Power, J., 2000. On weak higher dimensional categories I: Part 1. Journal of Pure and Applied Algebra, 154 (1-3), pp. 221-246.

Power, A. J., Cattani, G. L. and Winskel, G., 2000. A representation result for free cocompletions. Journal of Pure and Applied Algebra, 151 (3), pp. 273-286.

Lenisa, M., Power, J. and Watanabe, H., 2000. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Electronic Notes in Theoretical Computer Science, 33, pp. 230-260.

Conference or Workshop Items

Komendantskaya, E. and Power, J., 2011. Coalgebraic Derivations in Logic Programming. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 352-366. (Leibniz International Proceedings in Informatics (LIPIcs))

Komendantskaya, E. and Power, J., 2011. Coalgebraic semantics for derivations in logic programming. Heidelberg: Springer, pp. 268-282. (Lecture Notes in Computer Science; 6859)

Komendantskaya, E., McCusker, G. and Power, J., 2011. Coalgebraic semantics for parallel derivation strategies in logic programming. Springer, pp. 111-127. (Lecture Notes in Computer Science)

Power, J., 2011. Indexed Lawvere theories for local state. Rhode Island: American Mathematical Society, pp. 213-229. (CRM Proceedings & Lecture Notes; 53)

Komendantskaya, E. and Power, J., 2008. Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness. Heidelberg: Springer, pp. 258-271.

Power, J., 2007. Three dimensional monad theory. Providence, RI: Amer. Math. Soc., pp. 405-426. (Contemp. Math.)

Ghani, N. and Power, J., 2006. Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science (CMCS 2006). In: Eighth Workshop on Coalgebraic Methods in Computer Science (CMCS 2006), 2006-01-01, Amsterdam.

Power, J. and Tanaka, M., 2005. Binding signatures for generic contexts. Berlin: Springer, pp. 308-323. (Lecture Notes in Comput. Sci.)

Power, J., 2005. Discrete Lawvere theories. Berlin: Springer, pp. 348-363. (Lecture Notes in Comput. Sci.)

Denney, E. W., Tourlas, K. and Power, J., 2005. Hierarchical Proof Structures. Dresden: Technische Universität Dresden, pp. 144-157.

Power, J., 2004. Canonical models for computational effects. Berlin: Springer, pp. 438-452. (Lecture Notes in Comput. Sci.)

Hyland, M., Levy, P., Plotkin, G. D. and Power, J., 2004. Combining continuations with other effects.

Power, J., 2003. A universal embedding for the higher order structure of computational effects. Berlin: Springer, pp. 301-315. (Lecture Notes in Computer Science)

Power, J. and Tourlas, K., 2003. Abstraction in reasoning about higraph-based systems. Berlin: Springer, pp. 392-408. (Lecture Notes in Comput. Sci.)

Hyland, M., Plotkin, G. D. and Power, J., 2002. Combining Computational Effects: commutativity & sum. Kluwer, pp. 474-484.

Plotkin, G., Power, J., Sannella, D. and Tennent, R., 2002. Lax Logical Relations. (Lecture Notes in Computer Science)

Plotkin, G. and Power, J., 2002. Notions of computation determine monads. Berlin: Springer, pp. 342-356. (Lecture Notes in Computer Science)

Plotkin, G. and Power, J., 2001. Adequacy for algebraic effects. Berlin: Springer, pp. 1-24. (Lecture Notes in Comput. Sci.)

Power, J. and Tourlas, K., 2001. An algebraic foundation for higraphs. Berlin: Springer, pp. 145-159. (Lecture Notes in Computer Science)

Power, J. and Robinson, E., 2001. Logical Relations and Data Abstraction. Heidelberg: Springer, pp. 497-511.

Anderson, S., Power, J. and Tourlas, K., 2001. Reasoning in higraphs with loose edges. Piscataway, NJ: IEEE, pp. 23-29.

Kinoshita, Y. and Power, J., 2000. A General Completeness Result in Refinement. Heidelberg: Springer, pp. 201-218. (Lecture Notes in Computer Science)

Power, J. and Robinson, E., 2000. Logical relations, data abstraction, and structured fibrations. New York: ACM, pp. 15-23.

Hyland, M. and Power, J., 2000. Symmetric monoidal sketches. New York: ACM, pp. 280-288.

This list was generated on Sat Feb 6 05:06:02 2016 GMT.