John Power

According to our database1, John Power
  • authored at least 110 papers between 1989 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
Coalgebraic logic programming: from Semantics to Implementation.
J. Log. Comput., 2016

Logic programming: laxness and saturation.
CoRR, 2016

Category theoretic semantics for theorem proving in logic programming: embracing the laxness.
CoRR, 2016

Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness.
Proceedings of the Coalgebraic Methods in Computer Science, 2016

2014
Category theoretic structure of setoids.
Theor. Comput. Sci., 2014

Preface.
Electr. Notes Theor. Comput. Sci., 2014

2013
Coalgebraic Logic Programming: from Semantics to Implementation.
CoRR, 2013

2012
A Graphical Foundation for Schedules.
Electr. Notes Theor. Comput. Sci., 2012

Category Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What?
Electr. Notes Theor. Comput. Sci., 2012

2011
Unicity of Enrichment over Cat or Gpd.
Applied Categorical Structures, 2011

Coalgebraic Derivations in Logic Programming.
Proceedings of the Computer Science Logic, 2011

Coalgebraic Semantics for Derivations in Logic Programming.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Space-Based FPGA Radio Receiver Design, Debug, and Development of a Radiation-Tolerant Computing System.
Int. J. Reconfig. Comp., 2010

Modelling Local Variables: Possible Worlds and Object Spaces.
Electr. Notes Theor. Comput. Sci., 2010

Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming.
Proceedings of the Algebraic Methodology and Software Technology, 2010

2009
Gabriel-Ulmer duality and Lawvere theories enriched over a general base.
J. Funct. Program., 2009

Axiomatics for Data Refinement in Call by Value Programming Languages.
Electr. Notes Theor. Comput. Sci., 2009

Category Theoretic Models of Data Refinement.
Electr. Notes Theor. Comput. Sci., 2009

High Efficiency Space-Based Software Radio Architectures: A Minimum Size, Weight, and Power TeraOps Processor.
Proceedings of the ReConFig'09: 2009 International Conference on Reconfigurable Computing and FPGAs, 2009

2008
Category Theoretic Semantics for Typed Binding Signatures with Recursion.
Fundam. Inform., 2008

Tensors of Comodels and Models for Operational Semantics.
Electr. Notes Theor. Comput. Sci., 2008

Level design optimization guidelines for game artists using the epic games: Unreal editor and unreal engine 2.
Computers in Entertainment, 2008

Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

2007
Combining algebraic effects with continuations.
Theor. Comput. Sci., 2007

Abstract Syntax: Substitution and Binders: Invited Address.
Electr. Notes Theor. Comput. Sci., 2007

The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads.
Electr. Notes Theor. Comput. Sci., 2007

2006
Generic models for computational effects.
Theor. Comput. Sci., 2006

Combining effects: Sum and tensor.
Theor. Comput. Sci., 2006

Discrete Lawvere theories and computational effects.
Theor. Comput. Sci., 2006

A Unified Category-theoretic Semantics for Binding Signatures in Substructural Logics.
J. Log. Comput., 2006

Pseudo-distributive laws and axiomatics for variable binding.
Higher-Order and Symbolic Computation, 2006

Coalgebraic semantics for timed processes.
Inf. Comput., 2006

Countable Lawvere Theories and Computational Effects.
Electr. Notes Theor. Comput. Sci., 2006

Semantics for Local Computational Effects.
Electr. Notes Theor. Comput. Sci., 2006

A Category Theoretic Formulation for Engeler-style Models of the Untyped lambda.
Electr. Notes Theor. Comput. Sci., 2006

Preface.
Electr. Notes Theor. Comput. Sci., 2006

Hiproofs: A Hierarchical Notion of Proof Tree.
Electr. Notes Theor. Comput. Sci., 2006

The Universal Algebra of Computational Effects: Lawvere Theories and Monads.
Proceedings of the Workshop on Mathematically Structured Functional Programming, 2006

2005
Binding Signatures for Generic Contexts.
Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

A unified category-theoretic formulation of typed binding signatures.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2005

Discrete Lawvere Theories.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004
Category theory for operational semantics.
Theor. Comput. Sci., 2004

From Comodels to Coalgebras: State and Arrays.
Electr. Notes Theor. Comput. Sci., 2004

Computational Effects and Operations: An Overview.
Electr. Notes Theor. Comput. Sci., 2004

Modularity of Behaviours for Mathematical Operational Semantics.
Electr. Notes Theor. Comput. Sci., 2004

Symmetric Monoidal Sketches and Categories of Wirings.
Electr. Notes Theor. Comput. Sci., 2004

Canonical Models for Computational Effects.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Dualising Initial Algebras.
Mathematical Structures in Computer Science, 2003

Modelling environments in call-by-value programming languages.
Inf. Comput., 2003

On the Geometric Modelling of Visual Languages.
Electr. Notes Theor. Comput. Sci., 2003

Towards a theory of mathematical operational semantics.
Electr. Notes Theor. Comput. Sci., 2003

Algebraic Operations and Generic Effects.
Applied Categorical Structures, 2003

A Universal Embedding for the Higher Order Structure of Computational Effects.
Proceedings of the Typed Lambda Calculi and Applications, 6th International Conference, 2003

Logic for Computational Effects: Work in Progress.
Proceedings of the 6th International Workshop on Formal Methods, 2003

A unified category theoretic approach to variable binding.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

Abstraction in Reasoning about Higraph-Based Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
Combining a monad and a comonad.
Theor. Comput. Sci., 2002

Fixpoint operators for domain equations.
Theor. Comput. Sci., 2002

Premonoidal categories as categories with algebraic structure.
Theor. Comput. Sci., 2002

Zooming-out on Higraph-based diagrams - Syntactic and Semantic Issues.
Electr. Notes Theor. Comput. Sci., 2002

Combining Computational Effects: commutativity & sum.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Notions of Computation Determine Monads.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
On the structure of categories of coalgebras.
Theor. Comput. Sci., 2001

An Algebraic Foundation for Graph-based Diagrams in Computing.
Electr. Notes Theor. Comput. Sci., 2001

Semantics for Algebraic Operations.
Electr. Notes Theor. Comput. Sci., 2001

Two-dimensional linear algebra.
Electr. Notes Theor. Comput. Sci., 2001

Pseudo-commutative Monads.
Electr. Notes Theor. Comput. Sci., 2001

Algebras, Coalgebras, Monads and Comonads.
Electr. Notes Theor. Comput. Sci., 2001

Reasoning in Higraphs with Loose Edges.
Proceedings of the 2002 IEEE CS International Symposium on Human-Centric Computing Languages and Environments (HCC 2001), 2001

Adequacy for Algebraic Effects.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

An Algebraic Foundation for Higraphs.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
Models for the computational lambda-calculus.
Electr. Notes Theor. Comput. Sci., 2000

Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads.
Electr. Notes Theor. Comput. Sci., 2000

Data Refinement and Algebraic Structure.
Acta Inf., 2000

Logical relations, data abstraction, and structured fibrations.
PPDP, 2000

Symmetric monoidal sketches.
PPDP, 2000

Lax Logical Relations.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Logical Relations and Data Abstraction.
Proceedings of the Computer Science Logic, 2000

1999
A Coalgebraic Foundation for Linear Time Semantics.
Electr. Notes Theor. Comput. Sci., 1999

Syntactic Control of Interference Revisited.
Theor. Comput. Sci., 1999

Bireflectivity.
Theor. Comput. Sci., 1999

Distributivity for a monad and a comonad.
Electr. Notes Theor. Comput. Sci., 1999

Modularity and Dyads.
Electr. Notes Theor. Comput. Sci., 1999

A General Completeness Result in Refinement.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1999

Closed Freyd- and kappa-categories.
Proceedings of the Automata, 1999

Data-Refinement for Call-By-Value Programming Languages.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

1998
An axiomatics for categories of coalgebras.
Electr. Notes Theor. Comput. Sci., 1998

An Axiomatics for Categories of Transition Systems as Coalgebras.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Higher Dimensional Multigraphs.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

A Modular Approach to Denotational Semantics.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

A Categorical Axiomatics for Bisimulation.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997
A Representable Approach to Finite Nondeterminism.
Theor. Comput. Sci., 1997

Premonoidal Categories and Notions of Computation.
Mathematical Structures in Computer Science, 1997

Modularity in denotational semantics.
Electr. Notes Theor. Comput. Sci., 1997

Sketches - Dedicated to Michael Barr on the occasion of his 60th birthday.
Electr. Notes Theor. Comput. Sci., 1997

Environments, Continuation Semantics and Indexed Categories.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Complete Cuboidal Sets in Axiomatic Domain Theory.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

Categories with Algebraic Structure.
Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996
A Fibrational Semantics for Logic Programs.
Proceedings of the Extensions of Logic Programming, 5th International Workshop, 1996

Elementary Control Structures.
Proceedings of the CONCUR '96, 1996

1995
Why Tricategories?
Inf. Comput., August, 1995

Syntactic control of interference revisited.
Electr. Notes Theor. Comput. Sci., 1995

Bireflectivity.
Electr. Notes Theor. Comput. Sci., 1995

Control Structures
Proceedings of the Proceedings, 1995

Fibrational Control Structures.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1992
A Formalism for the Specification of Essentially Algebraic Structures in 2-Categories.
Mathematical Structures in Computer Science, 1992

1990
A Notion of Map between Logic Programs.
Proceedings of the Logic Programming, 1990

1989
An Algebraic Formulation for Data Refinement.
Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

An Abstract Formulation for Rewrite Systems.
Proceedings of the Category Theory and Computer Science, 1989


  Loading...