Abstract
It is shown that regular relations, which arise in a number of areas of programming theory, can be characterised in a variety of ways as pullbacks in Set; and up to isomorphism, as bicartesian squares in Set. © 1994.
| Original language | English |
|---|---|
| Pages (from-to) | 187-192 |
| Number of pages | 5 |
| Journal | Theoretical Computer Science |
| Volume | 129 |
| Issue number | 1 |
| Publication status | Published - 20 Jun 1994 |