| LDR | 01239cam a2200349Ia 4500 | ||
| 001 | 009499149 | ||
| 003 | MiAaHDL | ||
| 005 | 20110201000000.0 | ||
| 006 | m d | ||
| 007 | cr bn ---auaua | ||
| 008 | 920921s1990 enka b 000 0 eng d | ||
| 035 | ⊔ | ⊔ | ‡asdr-nrlfb167691806 |
| 035 | ⊔ | ⊔ | ‡a010731492 |
| 035 | ⊔ | ⊔ | ‡a.b12628438 ‡bnrlf ‡c- |
| 040 | ⊔ | ⊔ | ‡aCUZ ‡cCUZ |
| 049 | ⊔ | ⊔ | ‡aCUZC |
| 090 | ⊔ | ⊔ | ‡aQA248.C53 1990 |
| 035 | ⊔ | ⊔ | ‡a(OCoLC)26642588 |
| 100 | 1 | ⊔ | ‡aClarke, Thomas. |
| 245 | 1 | 4 | ‡aThe semantics and implementation of aggregates, or, How to express concurrency without destroying determinism / ‡cby Thomas Clarke. |
| 260 | ⊔ | ⊔ | ‡aCambridge, England : ‡bUniversity of Cambridge Computer Laboratory, ‡c[1990] |
| 300 | ⊔ | ⊔ | ‡a25 p. : ‡bill. ; ‡c21 cm. |
| 490 | 0 | ⊔ | ‡aTechnical report / University of Cambridge Computer Laboratory ; ‡vno. 197 |
| 538 | ⊔ | ⊔ | ‡aMode of access: Internet. |
| 650 | ⊔ | 0 | ‡aFormal languages ‡xSemantics. |
| 650 | ⊔ | 0 | ‡aSet theory. |
| 740 | 0 | 1 | ‡aHow to express concurrency without destroying determinism. |
| 740 | 0 | 1 | ‡aSemantics and implementation of aggregates. |
| CID | ⊔ | ⊔ | ‡a009499149 |
| DAT | 0 | ⊔ | ‡b20110201000000.0 |
| DAT | 1 | ⊔ | ‡a20190128140957.0 ‡b2023-06-15T18:01:21Z |
| CAT | ⊔ | ⊔ | ‡aSDR-NRLF ‡dIII - MILLENIUM ‡lprepare.pl-004-008 |
| FMT | ⊔ | ⊔ | ‡aBK |
| HOL | ⊔ | ⊔ | ‡0sdr-nrlfb167691806 ‡auc1 ‡bSDR ‡cNRLF ‡puc1.b5008750 ‡sUC ‡1b167691806 |
| 974 | ⊔ | ⊔ | ‡bUC ‡cNRLF ‡d20230615 ‡sgoogle ‡uuc1.b5008750 ‡y1990 ‡ric ‡qbib ‡tnon-US bib date1 >= 1929 |