Premonoidal categories and notions of computation

Authors:
John Power;Edmund Robinson
Affiliations:
Department of Computer Science, University of Edinburgh, King's Buildings, Edinburgh EH9 3JZ, Scotland;Department of Computer Science, Queen Mary and Westfield College, University of London, Mile End Road, London E1 4NS, UK
Venue:
Mathematical Structures in Computer Science
Year:
1997

Citing 6
Cited 61

Notions of computation and monads

Information and Computation
Axiomatic domain theory in categories of partial maps

Axiomatic domain theory in categories of partial maps
A representable approach to finite nondeterminism

MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Fibrational Control Structures

CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Elementary Control Structures

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Control Structures

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science

Logical relations, data abstraction, and structured fibrations

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
A new notation for arrows

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Premonoidal categories as categories with algebraic structure

Theoretical Computer Science
Dynamic connectors for concurrency

Theoretical Computer Science
Axioms for Recursion in Call-by-Value

Higher-Order and Symbolic Computation
Comparing logics for rewriting: rewriting logic, action calculi and tile logic

Theoretical Computer Science - Rewriting logic and its applications
Normal forms for algebras of connections

Theoretical Computer Science
A functorial semantics for multi-algebras and partial algebras, with applications to syntax

Theoretical Computer Science
Call-by-Push-Value: A Subsuming Paradigm

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Normal Forms for Partitions and Relations

WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Guarded Transitions in Evolving Specifications

AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Axioms for Recursion in Call-by-Value

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Varieties of Effects

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Data-Refinement for Call-By-Value Programming Languages

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Duality between Call-by-Name Recursion and Call-by-Value Iteration

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Ideal models for pointwise relational and state-free imperative programming

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Modelling environments in call-by-value programming languages

Information and Computation
Control categories and duality: on the categorical semantics of the lambda-mu calculus

Mathematical Structures in Computer Science
On the call-by-value CPS transform and its semantics

Information and Computation
Generic models for computational effects

Theoretical Computer Science - Logic, language, information and computation
Parameterizations and Fixed-Point Operators on Control Categories

Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Applicative programming with effects

Journal of Functional Programming
Comonadic Notions of Computation

Electronic Notes in Theoretical Computer Science (ENTCS)
Axiomatics for Data Refinement in Call by Value Programming Languages

Electronic Notes in Theoretical Computer Science (ENTCS)
Parameterised notions of computation

Journal of Functional Programming
Categorical semantics for arrows

Journal of Functional Programming
On the algebraic structure of declarative programming languages

Theoretical Computer Science
Asynchronous Games 3 An Innocent Model of Linear Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Arrows, like Monads, are Monoids

Electronic Notes in Theoretical Computer Science (ENTCS)
The arrow calculus

Journal of Functional Programming
Categorical semantics of control

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Parameterizations and fixed-point operators on control categories

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
A universal embedding for the higher order structure of computational effects

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Coalgebraic components in a many-sorted microcosm

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A semantical approach to equilibria and rationality

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Categorifying Computations into Components via Arrows as Profunctors

Electronic Notes in Theoretical Computer Science (ENTCS)
Arrows are strong monads

Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
Game semantics for call-by-value polymorphism

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Monad transformers as monoid transformers

Theoretical Computer Science
Cartesian effect categories are Freyd-categories

Journal of Symbolic Computation
What is a Categorical Model of Arrows?

Electronic Notes in Theoretical Computer Science (ENTCS)
Linearly-used state in models of call-by-value

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Game semantics for higher-order concurrency

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
The essence of dataflow programming

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs

PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Programming with arrows

AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
Monads need not be endofunctors

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Parameterised notions of computation

MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Freyd is Kleisli, for arrows

MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Correct looping arrows from cyclic terms

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Parameterizations and Fixed-Point Operators on Control Categories

Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Functional semantics of parsing actions, and left recursion elimination as continuation passing

Proceedings of the 14th symposium on Principles and practice of declarative programming
Categorical views on computations on trees

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Causality for free!: parametricity implies causality for functional reactive programs

PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
The sequential semantics of producer effect systems

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universal properties of impure programming languages

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The compiler forest

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Game semantics for interface middleweight Java

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Normalization by Evaluation and Algebraic Effects

Electronic Notes in Theoretical Computer Science (ENTCS)
Freyd categories are Enriched Lawvere Theories

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce the notions of premonoidal category and premonoidal functor, and show how these can be used in the denotational semantics of programming languages. We characterize the semantic definitions of Eugenio Moggi's monads as notions of computation, exhibit a representation theorem for our premonoidal setting in terms of monads, and give a fibrational setting for the structure.