Thesis icon

Thesis

On the non-compositionality of monads via distributive laws

Abstract:

Monads are a useful tool in both computer science and mathematics: they model computational behaviour, describe data structures, and give access to Kleisli and Eilenberg-Moore categories. To utilise multiple monads simultaneously, monads can sometimes be composed to form composite monads. Distributive laws ensure that such composite monads capture the full behaviour of both their components, creating a lifting of the component monads to the appropriate Kleisli or Eilenberg-Moore categories...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Sub department:
Computer Science
Research group:
Quantum Group
Oxford college:
Worcester College
Role:
Author

Contributors

Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Sub department:
Computer Science
Oxford college:
Kellogg College
Role:
Supervisor
ORCID:
0000-0002-8426-9917
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Sub department:
Computer Science
Research group:
Quantum Group
Oxford college:
Wolfson College
Role:
Supervisor
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Sub department:
Computer Science
Research group:
Quantum Group
Role:
Supervisor
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Sub department:
Computer Science
Research group:
Quantum Group
Role:
Examiner
Institution:
McGill University
Role:
Examiner
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP