default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Power
A. John Power
Person information
- affiliation: University of Bath, UK
- affiliation (former): University of Edinburgh, Scotland, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j32]Arnau Albà
, Jimin Seok, Andreas Adelmann, Scott Doran, Gwanghui Ha, Soonhong Lee, Yinghu Piao, John Power, Maofei Qian, Eric Wisniewski, Joseph Xu, Alexander Zholents:
Benchmarking collective effects of electron interactions in a wiggler with OPAL-FEL. Comput. Phys. Commun. 280: 108475 (2022)
2010 – 2019
- 2018
- [j31]Ekaterina Komendantskaya, John Power:
Logic programming: Laxness and saturation. J. Log. Algebraic Methods Program. 101: 1-21 (2018) - [j30]Richard Garner, John Power:
An enriched view on the extended finitary monad-Lawvere theory correspondence. Log. Methods Comput. Sci. 14(1) (2018) - [c81]Thomas Cottrell, Soichiro Fujii, John Power:
Higher Dimensional Categories: Induction on Extensivity. MFPS 2018: 73-90 - 2017
- [e3]Ekaterina Komendantskaya, John Power:
Proceedings of the First Workshop on Coalgebra, Horn Clause Logic Programming and Types, CoALP-Ty 2016, Edinburgh, UK, 28-29 November 2016. EPTCS 258, 2017 [contents] - 2016
- [j29]Ekaterina Komendantskaya, John Power, Martin Schmidt:
Coalgebraic logic programming: from Semantics to Implementation. J. Log. Comput. 26(2): 745-783 (2016) - [c80]Ekaterina Komendantskaya, John Power:
Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness. CMCS 2016: 94-113 - [i3]Ekaterina Komendantskaya, John Power:
Category theoretic semantics for theorem proving in logic programming: embracing the laxness. CoRR abs/1602.05400 (2016) - [i2]Ekaterina Komendantskaya, John Power:
Logic programming: laxness and saturation. CoRR abs/1608.07708 (2016) - 2014
- [j28]Yoshiki Kinoshita, John Power:
Category theoretic structure of setoids. Theor. Comput. Sci. 546: 145-163 (2014) - [e2]John Power, Cai Wingfield:
Proceedings of the Workshop on Algebra, Coalgebra and Topology, WACT 2013, Bath, UK, March 1, 2013. Electronic Notes in Theoretical Computer Science 303, Elsevier 2014 [contents] - 2013
- [c79]John Power, Cai Wingfield:
Preface. WACT 2013: 1-2 - [i1]Ekaterina Komendantskaya, John Power, Martin Schmidt:
Coalgebraic Logic Programming: from Semantics to Implementation. CoRR abs/1312.6568 (2013) - 2012
- [c78]Mike Behrisch, Sebastian Kerkhoff, John Power:
Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What? MFPS 2012: 5-16 - [c77]Guy McCusker, John Power, Cai Wingfield:
A Graphical Foundation for Schedules. MFPS 2012: 273-289 - 2011
- [j27]John Power:
Unicity of Enrichment over Cat or Gpd. Appl. Categorical Struct. 19(1): 293-299 (2011) - [c76]Ekaterina Komendantskaya, John Power:
Coalgebraic Semantics for Derivations in Logic Programming. CALCO 2011: 268-282 - [c75]Ekaterina Komendantskaya, John Power:
Coalgebraic Derivations in Logic Programming. CSL 2011: 352-366 - 2010
- [j26]Zachary K. Baker, Mark E. Dunham, Keith Morgan, Michael Pigue, Matthew Stettler, Paul S. Graham, Eric N. Schmierer, John Power:
Space-Based FPGA Radio Receiver Design, Debug, and Development of a Radiation-Tolerant Computing System. Int. J. Reconfigurable Comput. 2010: 546217:1-546217:12 (2010) - [c74]Ekaterina Komendantskaya, Guy McCusker, John Power:
Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming. AMAST 2010: 111-127 - [c73]Guy McCusker, John Power:
Modelling Local Variables: Possible Worlds and Object Spaces. MFPS 2010: 389-402
2000 – 2009
- 2009
- [j25]Stephen Lack, John Power:
Gabriel-Ulmer duality and Lawvere theories enriched over a general base. J. Funct. Program. 19(3-4): 265-286 (2009) - [c72]Mark E. Dunham, Zachary K. Baker, Matthew Stettler, Michael Pigue, Paul S. Graham, Eric N. Schmierer, John Power:
High Efficiency Space-Based Software Radio Architectures: A Minimum Size, Weight, and Power TeraOps Processor. ReConFig 2009: 326-331 - 2008
- [j24]Christian Rubino, John Power:
Level design optimization guidelines for game artists using the epic games: Unreal editor and unreal engine 2. Comput. Entertain. 6(4): 55:1-55:36 (2008) - [j23]John Power, Miki Tanaka:
Category Theoretic Semantics for Typed Binding Signatures with Recursion. Fundam. Informaticae 84(2): 221-240 (2008) - [c71]Ekaterina Komendantskaya, John Power:
Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness. JELIA 2008: 258-271 - [c70]Gordon D. Plotkin, John Power:
Tensors of Comodels and Models for Operational Semantics. MFPS 2008: 295-311 - 2007
- [j22]Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power:
Combining algebraic effects with continuations. Theor. Comput. Sci. 375(1-3): 20-40 (2007) - [c69]John Power:
Abstract Syntax: Substitution and Binders: Invited Address. MFPS 2007: 3-16 - [c68]Martin Hyland, John Power:
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads. Computation, Meaning, and Logic 2007: 437-458 - 2006
- [j21]Marco Kick, John Power, Alex Simpson:
Coalgebraic semantics for timed processes. Inf. Comput. 204(4): 588-609 (2006) - [j20]Miki Tanaka, John Power:
Pseudo-distributive laws and axiomatics for variable binding. High. Order Symb. Comput. 19(2-3): 305-337 (2006) - [j19]Miki Tanaka, John Power:
A Unified Category-theoretic Semantics for Binding Signatures in Substructural Logics. J. Log. Comput. 16(1): 5-25 (2006) - [j18]Martin Hyland, Gordon D. Plotkin, John Power:
Combining effects: Sum and tensor. Theor. Comput. Sci. 357(1-3): 70-99 (2006) - [j17]John Power:
Generic models for computational effects. Theor. Comput. Sci. 364(2): 254-269 (2006) - [j16]Martin Hyland, John Power:
Discrete Lawvere theories and computational effects. Theor. Comput. Sci. 366(1-2): 144-162 (2006) - [c67]John Power:
The Universal Algebra of Computational Effects: Lawvere Theories and Monads. MSFP@MPC 2006 - [c66]Neil Ghani, John Power:
Preface. CMCS 2006: 1-2 - [c65]Michael Johnson, David A. Naumann, John Power:
Category Theoretic Models of Data Refinement. MFCSIT 2006: 21-38 - [c64]John Power, Miki Tanaka:
Axiomatics for Data Refinement in Call by Value Programming Languages. MFCSIT 2006: 281-302 - [c63]John Power:
Semantics for Local Computational Effects. MFPS 2006: 355-371 - [e1]Neil Ghani, John Power:
Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, CMCS 2006, Vienna, Austria, March 25-27, 2006. Electronic Notes in Theoretical Computer Science 164(1), Elsevier 2006 [contents] - 2005
- [c62]John Power:
Discrete Lawvere Theories. CALCO 2005: 348-363 - [c61]Miki Tanaka, John Power:
A unified category-theoretic formulation of typed binding signatures. MERLIN 2005: 13-24 - [c60]John Power, Miki Tanaka:
Binding Signatures for Generic Contexts. TLCA 2005: 308-323 - [c59]Ewen Denney, John Power, Konstantinos Tourlas:
Hiproofs: A Hierarchical Notion of Proof Tree. MFPS 2005: 341-359 - 2004
- [j15]Marina Lenisa, John Power, Hiroshi Watanabe:
Category theory for operational semantics. Theor. Comput. Sci. 327(1-2): 135-154 (2004) - [c58]John Power:
Canonical Models for Computational Effects. FoSSaCS 2004: 438-452 - [c57]Martin Hyland, Misao Nagayama, John Power, Giuseppe Rosolini:
A Category Theoretic Formulation for Engeler-style Models of the Untyped lambda. MFCSIT 2004: 43-57 - [c56]John Power:
Countable Lawvere Theories and Computational Effects. MFCSIT 2004: 59-71 - [c55]Marco Kick, A. John Power:
Modularity of Behaviours for Mathematical Operational Semantics. CMCS 2004: 185-200 - [c54]A. John Power, Olha Shkaravska:
From Comodels to Coalgebras: State and Arrays. CMCS 2004: 297-314 - 2003
- [j14]Gordon D. Plotkin, John Power:
Algebraic Operations and Generic Effects. Appl. Categorical Struct. 11(1): 69-94 (2003) - [j13]Paul Blain Levy, John Power, Hayo Thielecke:
Modelling environments in call-by-value programming languages. Inf. Comput. 185(2): 182-210 (2003) - [j12]Neil Ghani, Christoph Lüth, Federico De Marchi, John Power:
Dualising Initial Algebras. Math. Struct. Comput. Sci. 13(2): 349-370 (2003) - [c53]John Power, Konstantinos Tourlas:
Abstraction in Reasoning about Higraph-Based Systems. FoSSaCS 2003: 392-408 - [c52]John Power:
A unified category theoretic approach to variable binding. MERLIN 2003 - [c51]Gordon D. Plotkin, John Power:
Logic for Computational Effects: Work in Progress. IWFM 2003 - [c50]Eugenia Cheng, Martin Hyland, John Power:
Pseudo-distributive Laws. MFPS 2003: 227-245 - [c49]John Power:
A Universal Embedding for the Higher Order Structure of Computational Effects. TLCA 2003: 301-315 - [c48]Martin Hyland, John Power:
Symmetric Monoidal Sketches and Categories of Wirings. CMCIM/GETCO@CONCUR 2003: 31-46 - [c47]John Power:
Towards a theory of mathematical operational semantics. CMCS 2003: 257-272 - 2002
- [j11]John Power:
Premonoidal categories as categories with algebraic structure. Theor. Comput. Sci. 278(1-2): 303-321 (2002) - [j10]John Power, Giuseppe Rosolini:
Fixpoint operators for domain equations. Theor. Comput. Sci. 278(1-2): 323-333 (2002) - [j9]John Power, Hiroshi Watanabe:
Combining a monad and a comonad. Theor. Comput. Sci. 280(1-2): 137-162 (2002) - [c46]Gordon D. Plotkin, John Power:
Notions of Computation Determine Monads. FoSSaCS 2002: 342-356 - [c45]Martin Hyland, Gordon D. Plotkin, John Power:
Combining Computational Effects: commutativity & sum. IFIP TCS 2002: 474-484 - [c44]Zhong Lu, Charles Wicks Jr., John Power, Daniel Dzurisin, Wayne Thatcher, Timothy Masterlark:
Interferometric synthetic aperture radar studies of Alaska volcanoes. IGARSS 2002: 191-194 - [c43]John Power, Konstantinos Tourlas:
On the Geometric Modelling of Visual Languages. GT-VMT@ICGT 2002: 1-12 - [c42]Gordon D. Plotkin, A. John Power:
Computational Effects and Operations: An Overview. Workshop on Domains 2002: 149-163 - [c41]Stuart Anderson, John Power, Konstantinos Tourlas:
Zooming-out on Higraph-based diagrams - Syntactic and Semantic Issues. CATS 2002: 201-211 - 2001
- [j8]Peter T. Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell:
On the structure of categories of coalgebras. Theor. Comput. Sci. 260(1-2): 87-117 (2001) - [c40]John Power, Konstantinos Tourlas:
An Algebraic Foundation for Higraphs. CSL 2001: 145-159 - [c39]Gordon D. Plotkin, John Power:
Adequacy for Algebraic Effects. FoSSaCS 2001: 1-24 - [c38]Stuart Anderson, John Power, Konstantinos Tourlas:
Reasoning in Higraphs with Loose Edges. HCC 2001: 23-29 - [c37]Neil Ghani, Christoph Lüth, Federico De Marchi, John Power:
Algebras, Coalgebras, Monads and Comonads. CMCS 2001: 128-145 - [c36]Martin Hyland, John Power:
Pseudo-commutative Monads. MFPS 2001: 197-208 - [c35]Martin Hyland, John Power:
Two-dimensional linear algebra. CMCS 2001: 227-240 - [c34]Gordon D. Plotkin, John Power:
Semantics for Algebraic Operations. MFPS 2001: 332-345 - [c33]John Power, Konstantinos Tourlas:
An Algebraic Foundation for Graph-based Diagrams in Computing. MFPS 2001: 346-357 - 2000
- [j7]Yoshiki Kinoshita, John Power:
Data Refinement and Algebraic Structure. Acta Informatica 36(9/10): 693-719 (2000) - [c32]John Power, Edmund Robinson:
Logical Relations and Data Abstraction. CSL 2000: 497-511 - [c31]Gordon D. Plotkin, John Power, Donald Sannella, Robert D. Tennent:
Lax Logical Relations. ICALP 2000: 85-102 - [c30]John Power, Edmund Robinson:
Logical relations, data abstraction, and structured fibrations. PPDP 2000: 15-23 - [c29]Martin Hyland, John Power:
Symmetric monoidal sketches. PPDP 2000: 280-288 - [c28]Marina Lenisa, John Power, Hiroshi Watanabe:
Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. CMCS 2000: 230-260 - [c27]John Power:
Models for the computational lambda-calculus. MFCSIT 2000: 288-301
1990 – 1999
- 1999
- [j6]Peter J. Freyd, Peter W. O'Hearn, A. John Power, Makoto Takeyama, R. Street, Robert D. Tennent:
Bireflectivity. Theor. Comput. Sci. 228(1-2): 49-76 (1999) - [j5]Peter W. O'Hearn, John Power, Makoto Takeyama, Robert D. Tennent:
Syntactic Control of Interference Revisited. Theor. Comput. Sci. 228(1-2): 211-252 (1999) - [c26]Yoshiki Kinoshita, John Power:
Data-Refinement for Call-By-Value Programming Languages. CSL 1999: 562-576 - [c25]John Power, Hayo Thielecke:
Closed Freyd- and kappa-categories. ICALP 1999: 625-634 - [c24]Yoshiki Kinoshita, John Power:
A General Completeness Result in Refinement. WADT 1999: 201-218 - [c23]John Power, Hiroshi Watanabe:
Distributivity for a monad and a comonad. CMCS 1999: 102 - [c22]John Power, Edmund Robinson:
Modularity and Dyads. MFPS 1999: 467-480 - [c21]John Power, Daniele Turi:
A Coalgebraic Foundation for Linear Time Semantics. CTCS 1999: 259-274 - 1998
- [c20]Gian Luca Cattani, John Power, Glynn Winskel:
A Categorical Axiomatics for Bisimulation. CONCUR 1998: 581-596 - [c19]John Power, Giuseppe Rosolini:
A Modular Approach to Denotational Semantics. ICALP 1998: 351-362 - [c18]Claudio Hermida, Michael Makkai, John Power:
Higher Dimensional Multigraphs. LICS 1998: 199-206 - [c17]Peter T. Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell:
An Axiomatics for Categories of Transition Systems as Coalgebras. LICS 1998: 207-213 - [c16]John Power, Hiroshi Watanabe:
An axiomatics for categories of coalgebras. CMCS 1998: 158-175 - 1997
- [j4]John Power, Edmund Robinson:
Premonoidal Categories and Notions of Computation. Math. Struct. Comput. Sci. 7(5): 453-468 (1997) - [j3]Stuart Oliver Anderson, John Power:
A Representable Approach to Finite Nondeterminism. Theor. Comput. Sci. 177(1): 3-25 (1997) - [c15]A. John Power:
Categories with Algebraic Structure. CSL 1997: 389-405 - [c14]Marcelo P. Fiore, Gordon D. Plotkin, A. John Power:
Complete Cuboidal Sets in Axiomatic Domain Theory. LICS 1997: 268-278 - [c13]Yoshiki Kinoshita, Peter W. O'Hearn, John Power, Makoto Takeyama, Robert D. Tennent:
An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement. TACS 1997: 191-212 - [c12]John Power, Hayo Thielecke:
Environments, Continuation Semantics and Indexed Categories. TACS 1997: 391-414 - [c11]Yoshiki Kinoshita, John Power, Makoto Takeyama:
Sketches - Dedicated to Michael Barr on the occasion of his 60th birthday. MFPS 1997: 235-248 - [c10]John Power:
Modularity in denotational semantics. MFPS 1997: 293-307 - 1996
- [c9]John Power:
Elementary Control Structures. CONCUR 1996: 115-130 - [c8]Yoshiki Kinoshita, A. John Power:
A Fibrational Semantics for Logic Programs. ELP 1996: 177-191 - 1995
- [j2]A. John Power:
Why Tricategories? Inf. Comput. 120(2): 251-262 (1995) - [c7]Claudio Hermida, John Power:
Fibrational Control Structures. CONCUR 1995: 117-129 - [c6]Alex Mifsud, Robin Milner, A. John Power:
Control Structures. LICS 1995: 188-198 - [c5]Peter J. Freyd, Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
Bireflectivity. MFPS 1995: 199-213 - [c4]Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama:
Syntactic control of interference revisited. MFPS 1995: 447-486 - 1992
- [j1]A. John Power, Charles Wells:
A Formalism for the Specification of Essentially Algebraic Structures in 2-Categories. Math. Struct. Comput. Sci. 2(1): 1-28 (1992) - 1990
- [c3]A. John Power, Leon Sterling:
A Notion of Map between Logic Programs. ICLP 1990: 390-404
1980 – 1989
- 1989
- [c2]A. John Power:
An Abstract Formulation for Rewrite Systems. Category Theory and Computer Science 1989: 300-312 - [c1]A. John Power:
An Algebraic Formulation for Data Refinement. Mathematical Foundations of Programming Semantics 1989: 390-401
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
