Quotienting the delay monad by weak bisimilarity
The delay datatype was introduced by Capretta (Logical Methods in Computer Science, 1(2), article 1, 2005) as a means to deal with partial functions (as in computability theory) in Martin-Löf type theory. The delay datatype is a monad. It is often desirable to consider two delayed computations equal...
Saved in:
| Published in: | Mathematical structures in computer science Vol. 29; no. 1; pp. 67 - 92 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cambridge, UK
Cambridge University Press
01.01.2019
|
| Subjects: | |
| ISSN: | 0960-1295, 1469-8072 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!