Conference item icon

Conference item

No-go theorems for distributive laws

Abstract:

Monads are commonplace in computer science, and can be composed using Beck's distributive laws. Unfortunately, finding distributive laws can be extremely difficult and error-prone. The literature contains some principles for constructing distributive laws. However, until now there have been no general techniques for establishing when no such law exists. We present two families of theorems for showing when there can be no distributive law for two monads. The first widely generalizes a counte...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Publisher copy:
10.1109/LICS.2019.8785707

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Nuffield College
Role:
Author
Publisher:
IEEE
Host title:
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Journal:
Symposium on Logic in Computer Science More from this journal
Publication date:
2019-08-05
Acceptance date:
2019-03-28
DOI:
ISBN:
9781728136080
Pubs id:
pubs:987522
UUID:
uuid:68a5d72f-7c72-4357-a409-edad6d1d4e33
Local pid:
pubs:987522
Source identifiers:
987522
Deposit date:
2019-04-04

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