A. John Power
List of publications from the DBLP Bibliography Server - FAQ| 2012 | ||
|---|---|---|
| j62 | Mike Behrisch, Sebastian Kerkhoff, John Power: Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What? Electr. Notes Theor. Comput. Sci. 286: 5-16 (2012) | |
| j61 | Guy McCusker, John Power, Cai Wingfield: A Graphical Foundation for Schedules. Electr. Notes Theor. Comput. Sci. 286: 273-289 (2012) | |
| 2011 | ||
| j60 | John Power: Unicity of Enrichment over Cat or Gpd. Applied Categorical Structures 19(1): 293-299 (2011) | |
| c40 | Ekaterina Komendantskaya, John Power: Coalgebraic Semantics for Derivations in Logic Programming. CALCO 2011: 268-282 | |
| c39 | Ekaterina Komendantskaya, John Power: Coalgebraic Derivations in Logic Programming. CSL 2011: 352-366 | |
| 2010 | ||
| j59 | Guy McCusker, John Power: Modelling Local Variables: Possible Worlds and Object Spaces. Electr. Notes Theor. Comput. Sci. 265: 389-402 (2010) | |
| j58 | 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. Reconfig. Comp. 2010 (2010) | |
| c38 | Ekaterina Komendantskaya, Guy McCusker, John Power: Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming. AMAST 2010: 111-127 | |
| 2009 | ||
| j57 | Michael Johnson, David A. Naumann, John Power: Category Theoretic Models of Data Refinement. Electr. Notes Theor. Comput. Sci. 225: 21-38 (2009) | |
| j56 | John Power, Miki Tanaka: Axiomatics for Data Refinement in Call by Value Programming Languages. Electr. Notes Theor. Comput. Sci. 225: 281-302 (2009) | |
| j55 | Stephen Lack, John Power: Gabriel-Ulmer duality and Lawvere theories enriched over a general base. J. Funct. Program. 19(3-4): 265-286 (2009) | |
| c37 | 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 | ||
| j54 | Christian Rubino, John Power: Level design optimization guidelines for game artists using the epic games: Unreal editor and unreal engine 2. Computers in Entertainment 6(4) (2008) | |
| j53 | Gordon D. Plotkin, John Power: Tensors of Comodels and Models for Operational Semantics. Electr. Notes Theor. Comput. Sci. 218: 295-311 (2008) | |
| j52 | John Power, Miki Tanaka: Category Theoretic Semantics for Typed Binding Signatures with Recursion. Fundam. Inform. 84(2): 221-240 (2008) | |
| c36 | Ekaterina Komendantskaya, John Power: Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness. JELIA 2008: 258-271 | |
| 2007 | ||
| j51 | Martin Hyland, John Power: The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads. Electr. Notes Theor. Comput. Sci. 172: 437-458 (2007) | |
| j50 | John Power: Abstract Syntax: Substitution and Binders: Invited Address. Electr. Notes Theor. Comput. Sci. 173: 3-16 (2007) | |
| j49 | Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power: Combining algebraic effects with continuations. Theor. Comput. Sci. 375(1-3): 20-40 (2007) | |
| 2006 | ||
| j48 | Ewen Denney, John Power, Konstantinos Tourlas: Hiproofs: A Hierarchical Notion of Proof Tree. Electr. Notes Theor. Comput. Sci. 155: 341-359 (2006) | |
| j47 | John Power: Semantics for Local Computational Effects. Electr. Notes Theor. Comput. Sci. 158: 355-371 (2006) | |
| j46 | Martin Hyland, Misao Nagayama, John Power, Giuseppe Rosolini: A Category Theoretic Formulation for Engeler-style Models of the Untyped lambda. Electr. Notes Theor. Comput. Sci. 161: 43-57 (2006) | |
| j45 | John Power: Countable Lawvere Theories and Computational Effects. Electr. Notes Theor. Comput. Sci. 161: 59-71 (2006) | |
| j44 | ||
| j43 | Marco Kick, John Power, Alex Simpson: Coalgebraic semantics for timed processes. Inf. Comput. 204(4): 588-609 (2006) | |
| j42 | Miki Tanaka, John Power: Pseudo-distributive laws and axiomatics for variable binding. Higher-Order and Symbolic Computation 19(2-3): 305-337 (2006) | |
| j41 | Miki Tanaka, John Power: A Unified Category-theoretic Semantics for Binding Signatures in Substructural Logics. J. Log. Comput. 16(1): 5-25 (2006) | |
| j40 | Martin Hyland, Gordon D. Plotkin, John Power: Combining effects: Sum and tensor. Theor. Comput. Sci. 357(1-3): 70-99 (2006) | |
| j39 | ||
| j38 | Martin Hyland, John Power: Discrete Lawvere theories and computational effects. Theor. Comput. Sci. 366(1-2): 144-162 (2006) | |
| 2005 | ||
| c35 | ||
| c34 | Miki Tanaka, John Power: A unified category-theoretic formulation of typed binding signatures. MERLIN 2005: 13-24 | |
| c33 | ||
| 2004 | ||
| j37 | Gordon D. Plotkin, A. John Power: Computational Effects and Operations: An Overview. Electr. Notes Theor. Comput. Sci. 73: 149-163 (2004) | |
| j36 | Martin Hyland, John Power: Symmetric Monoidal Sketches and Categories of Wirings. Electr. Notes Theor. Comput. Sci. 100: 31-46 (2004) | |
| j35 | Marco Kick, A. John Power: Modularity of Behaviours for Mathematical Operational Semantics. Electr. Notes Theor. Comput. Sci. 106: 185-200 (2004) | |
| j34 | A. John Power, Olha Shkaravska: From Comodels to Coalgebras: State and Arrays. Electr. Notes Theor. Comput. Sci. 106: 297-314 (2004) | |
| j33 | Marina Lenisa, John Power, Hiroshi Watanabe: Category theory for operational semantics. Theor. Comput. Sci. 327(1-2): 135-154 (2004) | |
| c32 | ||
| 2003 | ||
| j32 | Gordon D. Plotkin, John Power: Algebraic Operations and Generic Effects. Applied Categorical Structures 11(1): 69-94 (2003) | |
| j31 | John Power, Konstantinos Tourlas: On the Geometric Modelling of Visual Languages. Electr. Notes Theor. Comput. Sci. 72(3): 1-12 (2003) | |
| j30 | John Power: Towards a theory of mathematical operational semantics. Electr. Notes Theor. Comput. Sci. 82(1): 257-272 (2003) | |
| j29 | Paul Blain Levy, John Power, Hayo Thielecke: Modelling environments in call-by-value programming languages. Inf. Comput. 185(2): 182-210 (2003) | |
| j28 | Neil Ghani, Christoph Lüth, Federico De Marchi, John Power: Dualising Initial Algebras. Mathematical Structures in Computer Science 13(2): 349-370 (2003) | |
| c31 | John Power, Konstantinos Tourlas: Abstraction in Reasoning about Higraph-Based Systems. FoSSaCS 2003: 392-408 | |
| c30 | ||
| c29 | ||
| c28 | John Power: A Universal Embedding for the Higher Order Structure of Computational Effects. TLCA 2003: 301-315 | |
| 2002 | ||
| j27 | Stuart Anderson, John Power, Konstantinos Tourlas: Zooming-out on Higraph-based diagrams - Syntactic and Semantic Issues. Electr. Notes Theor. Comput. Sci. 61: 201-211 (2002) | |
| j26 | John Power: Premonoidal categories as categories with algebraic structure. Theor. Comput. Sci. 278(1-2): 303-321 (2002) | |
| j25 | John Power, Giuseppe Rosolini: Fixpoint operators for domain equations. Theor. Comput. Sci. 278(1-2): 323-333 (2002) | |
| j24 | John Power, Hiroshi Watanabe: Combining a monad and a comonad. Theor. Comput. Sci. 280(1-2): 137-162 (2002) | |
| c27 | ||
| c26 | Martin Hyland, Gordon D. Plotkin, John Power: Combining Computational Effects: commutativity & sum. IFIP TCS 2002: 474-484 | |
| 2001 | ||
| j23 | Neil Ghani, Christoph Lüth, Federico De Marchi, John Power: Algebras, Coalgebras, Monads and Comonads. Electr. Notes Theor. Comput. Sci. 44(1): 128-145 (2001) | |
| j22 | Martin Hyland, John Power: Two-dimensional linear algebra. Electr. Notes Theor. Comput. Sci. 44(1): 227-240 (2001) | |
| j21 | Martin Hyland, John Power: Pseudo-commutative Monads. Electr. Notes Theor. Comput. Sci. 45: 197-208 (2001) | |
| j20 | Gordon D. Plotkin, John Power: Semantics for Algebraic Operations. Electr. Notes Theor. Comput. Sci. 45: 332-345 (2001) | |
| j19 | John Power, Konstantinos Tourlas: An Algebraic Foundation for Graph-based Diagrams in Computing. Electr. Notes Theor. Comput. Sci. 45: 346-357 (2001) | |
| j18 | Peter 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) | |
| c25 | ||
| c24 | ||
| c23 | Stuart Anderson, John Power, Konstantinos Tourlas: Reasoning in Higraphs with Loose Edges. HCC 2001: 23-29 | |
| 2000 | ||
| j17 | Yoshiki Kinoshita, John Power: Data Refinement and Algebraic Structure. Acta Inf. 36(9/10): 693-719 (2000) | |
| j16 | Marina Lenisa, John Power, Hiroshi Watanabe: Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Electr. Notes Theor. Comput. Sci. 33: 230-260 (2000) | |
| j15 | John Power: Models for the computational lambda-calculus. Electr. Notes Theor. Comput. Sci. 40: 288-301 (2000) | |
| c22 | ||
| c21 | Gordon D. Plotkin, John Power, Donald Sannella, Robert D. Tennent: Lax Logical Relations. ICALP 2000: 85-102 | |
| c20 | John Power, Edmund Robinson: Logical relations, data abstraction, and structured fibrations. PPDP 2000: 15-23 | |
| c19 | ||
| 1999 | ||
| j14 | John Power, Hiroshi Watanabe: Distributivity for a monad and a comonad. Electr. Notes Theor. Comput. Sci. 19: 102 (1999) | |
| j13 | John Power, Edmund Robinson: Modularity and Dyads. Electr. Notes Theor. Comput. Sci. 20: 467-480 (1999) | |
| j12 | John Power, Daniele Turi: A Coalgebraic Foundation for Linear Time Semantics. Electr. Notes Theor. Comput. Sci. 29: 259-274 (1999) | |
| j11 | 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) | |
| j10 | 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) | |
| c18 | Yoshiki Kinoshita, John Power: Data-Refinement for Call-By-Value Programming Languages. CSL 1999: 562-576 | |
| c17 | ||
| c16 | ||
| 1998 | ||
| j9 | John Power, Hiroshi Watanabe: An axiomatics for categories of coalgebras. Electr. Notes Theor. Comput. Sci. 11: 158-175 (1998) | |
| c15 | Gian Luca Cattani, John Power, Glynn Winskel: A Categorical Axiomatics for Bisimulation. CONCUR 1998: 581-596 | |
| c14 | ||
| c13 | ||
| c12 | Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell: An Axiomatics for Categories of Transition Systems as Coalgebras. LICS 1998: 207-213 | |
| 1997 | ||
| j8 | Yoshiki Kinoshita, John Power, Makoto Takeyama: Sketches - Dedicated to Michael Barr on the occasion of his 60th birthday. Electr. Notes Theor. Comput. Sci. 6: 235-248 (1997) | |
| j7 | John Power: Modularity in denotational semantics. Electr. Notes Theor. Comput. Sci. 6: 293-307 (1997) | |
| j6 | John Power, Edmund Robinson: Premonoidal Categories and Notions of Computation. Mathematical Structures in Computer Science 7(5): 453-468 (1997) | |
| j5 | S. O. Anderson, John Power: A Representable Approach to Finite Nondeterminism. Theor. Comput. Sci. 177(1): 3-25 (1997) | |
| c11 | ||
| c10 | Marcelo P. Fiore, Gordon D. Plotkin, A. John Power: Complete Cuboidal Sets in Axiomatic Domain Theory. LICS 1997: 268-278 | |
| c9 | 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 | |
| c8 | John Power, Hayo Thielecke: Environments, Continuation Semantics and Indexed Categories. TACS 1997: 391-414 | |
| 1996 | ||
| c7 | ||
| c6 | ||
| 1995 | ||
| j4 | Peter J. Freyd, Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama: Bireflectivity. Electr. Notes Theor. Comput. Sci. 1: 199-213 (1995) | |
| j3 | Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama: Syntactic control of interference revisited. Electr. Notes Theor. Comput. Sci. 1: 447-486 (1995) | |
| j2 | ||
| c5 | ||
| c4 | ||
| 1992 | ||
| j1 | A. John Power, Charles Wells: A Formalism for the Specification of Essentially Algebraic Structures in 2-Categories. Mathematical Structures in Computer Science 2(1): 1-28 (1992) | |
| 1990 | ||
| c3 | ||
| 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 | |
Colors in the list of coauthors
Last update Tue May 21 13:55:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page