![]() |
A. John Power
List of publications from the DBLP Bibliography Server - FAQ
| 2009 | ||
|---|---|---|
| 91 | EE | Michael Johnson, David Naumann, John Power: Category Theoretic Models of Data Refinement. Electr. Notes Theor. Comput. Sci. 225: 21-38 (2009) |
| 90 | EE | John Power, Miki Tanaka: Axiomatics for Data Refinement in Call by Value Programming Languages. Electr. Notes Theor. Comput. Sci. 225: 281-302 (2009) |
| 2008 | ||
| 89 | EE | Ekaterina Komendantskaya, John Power: Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness. JELIA 2008: 258-271 |
| 88 | EE | Gordon D. Plotkin, John Power: Tensors of Comodels and Models for Operational Semantics. Electr. Notes Theor. Comput. Sci. 218: 295-311 (2008) |
| 87 | EE | John Power, Miki Tanaka: Category Theoretic Semantics for Typed Binding Signatures with Recursion. Fundam. Inform. 84(2): 221-240 (2008) |
| 2007 | ||
| 86 | EE | Martin Hyland, John Power: The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads. Electr. Notes Theor. Comput. Sci. 172: 437-458 (2007) |
| 85 | EE | John Power: Abstract Syntax: Substitution and Binders: Invited Address. Electr. Notes Theor. Comput. Sci. 173: 3-16 (2007) |
| 84 | EE | 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 | ||
| 83 | EE | Ewen Denney, John Power, Konstantinos Tourlas: Hiproofs: A Hierarchical Notion of Proof Tree. Electr. Notes Theor. Comput. Sci. 155: 341-359 (2006) |
| 82 | EE | John Power: Semantics for Local Computational Effects. Electr. Notes Theor. Comput. Sci. 158: 355-371 (2006) |
| 81 | EE | 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) |
| 80 | EE | John Power: Countable Lawvere Theories and Computational Effects. Electr. Notes Theor. Comput. Sci. 161: 59-71 (2006) |
| 79 | EE | Neil Ghani, John Power: Preface. Electr. Notes Theor. Comput. Sci. 164(1): 1-2 (2006) |
| 78 | EE | Miki Tanaka, John Power: Pseudo-distributive laws and axiomatics for variable binding. Higher-Order and Symbolic Computation 19(2-3): 305-337 (2006) |
| 77 | EE | Marco Kick, John Power, Alex Simpson: Coalgebraic semantics for timed processes. Inf. Comput. 204(4): 588-609 (2006) |
| 76 | EE | Miki Tanaka, John Power: A Unified Category-theoretic Semantics for Binding Signatures in Substructural Logics. J. Log. Comput. 16(1): 5-25 (2006) |
| 75 | EE | Martin Hyland, Gordon D. Plotkin, John Power: Combining effects: Sum and tensor. Theor. Comput. Sci. 357(1-3): 70-99 (2006) |
| 74 | EE | John Power: Generic models for computational effects. Theor. Comput. Sci. 364(2): 254-269 (2006) |
| 73 | EE | Martin Hyland, John Power: Discrete Lawvere theories and computational effects. Theor. Comput. Sci. 366(1-2): 144-162 (2006) |
| 2005 | ||
| 72 | EE | John Power: Discrete Lawvere Theories. CALCO 2005: 348-363 |
| 71 | EE | Miki Tanaka, John Power: A unified category-theoretic formulation of typed binding signatures. MERLIN 2005: 13-24 |
| 70 | EE | John Power, Miki Tanaka: Binding Signatures for Generic Contexts. TLCA 2005: 308-323 |
| 2004 | ||
| 69 | EE | John Power: Canonical Models for Computational Effects. FoSSaCS 2004: 438-452 |
| 68 | EE | Martin Hyland, John Power: Symmetric Monoidal Sketches and Categories of Wirings. Electr. Notes Theor. Comput. Sci. 100: 31-46 (2004) |
| 67 | EE | Marco Kick, A. John Power: Modularity of Behaviours for Mathematical Operational Semantics. Electr. Notes Theor. Comput. Sci. 106: 185-200 (2004) |
| 66 | EE | A. John Power, Olha Shkaravska: From Comodels to Coalgebras: State and Arrays. Electr. Notes Theor. Comput. Sci. 106: 297-314 (2004) |
| 65 | EE | Gordon D. Plotkin, A. John Power: Computational Effects and Operations: An Overview. Electr. Notes Theor. Comput. Sci. 73: 149-163 (2004) |
| 64 | EE | Marina Lenisa, John Power, Hiroshi Watanabe: Category theory for operational semantics. Theor. Comput. Sci. 327(1-2): 135-154 (2004) |
| 2003 | ||
| 63 | EE | John Power, Konstantinos Tourlas: Abstraction in Reasoning about Higraph-Based Systems. FoSSaCS 2003: 392-408 |
| 62 | EE | Gordon D. Plotkin, John Power: Logic for Computational Effects: Work in Progress. IWFM 2003 |
| 61 | EE | John Power: A unified category theoretic approach to variable binding. MERLIN 2003 |
| 60 | EE | John Power: A Universal Embedding for the Higher Order Structure of Computational Effects. TLCA 2003: 301-315 |
| 59 | EE | Gordon D. Plotkin, John Power: Algebraic Operations and Generic Effects. Applied Categorical Structures 11(1): 69-94 (2003) |
| 58 | EE | John Power, Konstantinos Tourlas: On the Geometric Modelling of Visual Languages. Electr. Notes Theor. Comput. Sci. 72(3): (2003) |
| 57 | EE | John Power: Towards a theory of mathematical operational semantics. Electr. Notes Theor. Comput. Sci. 82(1): (2003) |
| 56 | EE | Paul Blain Levy, John Power, Hayo Thielecke: Modelling environments in call-by-value programming languages. Inf. Comput. 185(2): 182-210 (2003) |
| 55 | Neil Ghani, Christoph Lüth, Federico De Marchi, John Power: Dualising Initial Algebras. Mathematical Structures in Computer Science 13(2): 349-370 (2003) | |
| 2002 | ||
| 54 | EE | Gordon D. Plotkin, John Power: Notions of Computation Determine Monads. FoSSaCS 2002: 342-356 |
| 53 | Martin Hyland, Gordon D. Plotkin, John Power: Combining Computational Effects: commutativity & sum. IFIP TCS 2002: 474-484 | |
| 52 | EE | Stuart Anderson, John Power, Konstantinos Tourlas: Zooming-out on Higraph-based diagrams - Syntactic and Semantic Issues. Electr. Notes Theor. Comput. Sci. 61: (2002) |
| 51 | EE | John Power: Premonoidal categories as categories with algebraic structure. Theor. Comput. Sci. 278(1-2): 303-321 (2002) |
| 50 | EE | John Power, Giuseppe Rosolini: Fixpoint operators for domain equations. Theor. Comput. Sci. 278(1-2): 323-333 (2002) |
| 49 | EE | John Power, Hiroshi Watanabe: Combining a monad and a comonad. Theor. Comput. Sci. 280(1-2): 137-162 (2002) |
| 2001 | ||
| 48 | EE | John Power, Konstantinos Tourlas: An Algebraic Foundation for Higraphs. CSL 2001: 145-159 |
| 47 | EE | Gordon D. Plotkin, John Power: Adequacy for Algebraic Effects. FoSSaCS 2001: 1-24 |
| 46 | EE | Stuart Anderson, John Power, Konstantinos Tourlas: Reasoning in Higraphs with Loose Edges. HCC 2001: 23-29 |
| 45 | EE | Neil Ghani, Christoph Lüth, Federico De Marchi, John Power: Algebras, Coalgebras, Monads and Comonads. Electr. Notes Theor. Comput. Sci. 44(1): (2001) |
| 44 | EE | Martin Hyland, John Power: Two-dimensional linear algebra. Electr. Notes Theor. Comput. Sci. 44(1): (2001) |
| 43 | EE | John Power, Konstantinos Tourlas: An Algebraic Foundation for Graph-based Diagrams in Computing. Electr. Notes Theor. Comput. Sci. 45: (2001) |
| 42 | EE | Martin Hyland, John Power: Pseudo-commutative Monads. Electr. Notes Theor. Comput. Sci. 45: (2001) |
| 41 | EE | Gordon D. Plotkin, John Power: Semantics for Algebraic Operations. Electr. Notes Theor. Comput. Sci. 45: (2001) |
| 40 | EE | 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) |
| 2000 | ||
| 39 | EE | John Power, Edmund Robinson: Logical Relations and Data Abstraction. CSL 2000: 497-511 |
| 38 | EE | Gordon D. Plotkin, John Power, Donald Sannella, Robert D. Tennent: Lax Logical Relations. ICALP 2000: 85-102 |
| 37 | EE | John Power, Edmund Robinson: Logical relations, data abstraction, and structured fibrations. PPDP 2000: 15-23 |
| 36 | EE | Martin Hyland, John Power: Symmetric monoidal sketches. PPDP 2000: 280-288 |
| 35 | EE | Yoshiki Kinoshita, John Power: Data Refinement and Algebraic Structure. Acta Inf. 36(9/10): 693-719 (2000) |
| 34 | EE | Marina Lenisa, John Power, Hiroshi Watanabe: Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Electr. Notes Theor. Comput. Sci. 33: (2000) |
| 33 | EE | John Power: Models for the computational lambda-calculus. Electr. Notes Theor. Comput. Sci. 40: (2000) |
| 1999 | ||
| 32 | Yoshiki Kinoshita, John Power: Data-Refinement for Call-By-Value Programming Languages. CSL 1999: 562-576 | |
| 31 | EE | John Power, Hayo Thielecke: Closed Freyd- and kappa-categories. ICALP 1999: 625-634 |
| 30 | Yoshiki Kinoshita, John Power: A General Completeness Result in Refinement. WADT 1999: 201-218 | |
| 29 | EE | John Power, Hiroshi Watanabe: Distributivity for a monad and a comonad. Electr. Notes Theor. Comput. Sci. 19: (1999) |
| 28 | EE | John Power, Edmund Robinson: Modularity and Dyads. Electr. Notes Theor. Comput. Sci. 20: (1999) |
| 27 | EE | John Power, Daniele Turi: A Coalgebraic Foundation for Linear Time Semantics. Electr. Notes Theor. Comput. Sci. 29: (1999) |
| 26 | EE | 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) |
| 25 | EE | 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) |
| 1998 | ||
| 24 | EE | Gian Luca Cattani, John Power, Glynn Winskel: A Categorical Axiomatics for Bisimulation. CONCUR 1998: 581-596 |
| 23 | EE | John Power, Giuseppe Rosolini: A Modular Approach to Denotational Semantics. ICALP 1998: 351-362 |
| 22 | Claudio Hermida, Michael Makkai, John Power: Higher Dimensional Multigraphs. LICS 1998: 199-206 | |
| 21 | Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell: An Axiomatics for Categories of Transition Systems as Coalgebras. LICS 1998: 207-213 | |
| 20 | EE | John Power, Hiroshi Watanabe: An axiomatics for categories of coalgebras. Electr. Notes Theor. Comput. Sci. 11: (1998) |
| 1997 | ||
| 19 | A. John Power: Categories with Algebraic Structure. CSL 1997: 389-405 | |
| 18 | EE | Marcelo P. Fiore, Gordon D. Plotkin, A. John Power: Complete Cuboidal Sets in Axiomatic Domain Theory. LICS 1997: 268-279 |
| 17 | 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 | |
| 16 | John Power, Hayo Thielecke: Environments, Continuation Semantics and Indexed Categories. TACS 1997: 391-414 | |
| 15 | EE | John Power: Modularity in denotational semantics. Electr. Notes Theor. Comput. Sci. 6: (1997) |
| 14 | EE | Yoshiki Kinoshita, John Power, Makoto Takeyama: Sketches. Electr. Notes Theor. Comput. Sci. 6: (1997) |
| 13 | John Power, Edmund Robinson: Premonoidal Categories and Notions of Computation. Mathematical Structures in Computer Science 7(5): 453-468 (1997) | |
| 12 | EE | S. O. Anderson, John Power: A Representable Approach to Finite Nondeterminism. Theor. Comput. Sci. 177(1): 3-25 (1997) |
| 1996 | ||
| 11 | John Power: Elementary Control Structures. CONCUR 1996: 115-130 | |
| 10 | Yoshiki Kinoshita, A. John Power: A Fibrational Semantics for Logic Programs. ELP 1996: 177-191 | |
| 1995 | ||
| 9 | Claudio Hermida, John Power: Fibrational Control Structures. CONCUR 1995: 117-129 | |
| 8 | Alex Mifsud, Robin Milner, A. John Power: Control Structures LICS 1995: 188-198 | |
| 7 | EE | Peter J. Freyd, Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama: Bireflectivity. Electr. Notes Theor. Comput. Sci. 1: (1995) |
| 6 | EE | Peter W. O'Hearn, John Power, Robert D. Tennent, Makoto Takeyama: Syntactic control of interference revisited. Electr. Notes Theor. Comput. Sci. 1: (1995) |
| 5 | A. John Power: Why Tricategories? Inf. Comput. 120(2): 251-262 (1995) | |
| 1992 | ||
| 4 | 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 | ||
| 3 | A. John Power, Leon Sterling: A Notion of Map between Logic Programs. ICLP 1990: 390-404 | |
| 1989 | ||
| 2 | A. John Power: An Abstract Formulation for Rewrite Systems. Category Theory and Computer Science 1989: 300-312 | |
| 1 | A. John Power: An Algebraic Formulation for Data Refinement. Mathematical Foundations of Programming Semantics 1989: 390-401 | |