-
Notifications
You must be signed in to change notification settings - Fork 4
/
ambients.rdf
3045 lines (3042 loc) · 139 KB
/
ambients.rdf
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<rdf:RDF
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:z="http://www.zotero.org/namespaces/export#"
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:bib="http://purl.org/net/biblio#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:link="http://purl.org/rss/1.0/modules/link/"
xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
xmlns:vcard="http://nwalsh.com/rdf/vCard#">
<bib:Document rdf:about="https://martinfowler.com/eaaDev/EventSourcing.html">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website><dc:title>martinfowler.com</dc:title></z:Website>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Fowler</foaf:surname>
<foaf:givenname>Martin</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_697"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://martinfowler.com/eaaDev/EventSourcing.html</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>12.12.2005</dc:date>
<dcterms:dateSubmitted>2019-05-22 07:59:35</dcterms:dateSubmitted>
<dcterms:abstract>Capture all changes to an application state as a sequence of events.</dcterms:abstract>
<dc:title>Event Sourcing</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_697">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://martinfowler.com/eaaDev/EventSourcing.html</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:59:37</dcterms:dateSubmitted>
<dc:title>Snapshot</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Article rdf:about="http://arxiv.org/abs/1805.04263">
<z:itemType>journalArticle</z:itemType>
<dcterms:isPartOf>
<bib:Journal><dc:title>arXiv:1805.04263 [cs]</dc:title></bib:Journal>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Kleppmann</foaf:surname>
<foaf:givenname>Martin</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>Gomes</foaf:surname>
<foaf:givenname>Victor B. F.</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>Mulligan</foaf:surname>
<foaf:givenname>Dominic P.</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>Beresford</foaf:surname>
<foaf:givenname>Alastair R.</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_707"/>
<link:link rdf:resource="#item_691"/>
<dc:subject>
<z:AutomaticTag>
<rdf:value>Computer Science - Distributed, Parallel, and Cluster Computing</rdf:value>
</z:AutomaticTag>
</dc:subject>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://arxiv.org/abs/1805.04263</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>2018-05-11</dc:date>
<dc:description>arXiv: 1805.04263</dc:description>
<dcterms:dateSubmitted>2019-05-22 07:57:40</dcterms:dateSubmitted>
<z:libraryCatalog>arXiv.org</z:libraryCatalog>
<dcterms:abstract>We introduce OpSets, an executable framework for specifying and reasoning about the semantics of replicated datatypes that provide eventual consistency in a distributed system, and for mechanically verifying algorithms that implement these datatypes. Our approach is simple but expressive, allowing us to succinctly specify a variety of abstract datatypes, including maps, sets, lists, text, graphs, trees, and registers. Our datatypes are also composable, enabling the construction of complex data structures. To demonstrate the utility of OpSets for analysing replication algorithms, we highlight an important correctness property for collaborative text editing that has traditionally been overlooked; algorithms that do not satisfy this property can exhibit awkward interleaving of text. We use OpSets to specify this correctness property and prove that although one existing replication algorithm satisfies this property, several other published algorithms do not. We also show how OpSets can be used to develop new replicated datatypes: we provide a simple specification of an atomic move operation for trees, an operation that had previously been thought to be impossible to implement without locking. We use the Isabelle/HOL proof assistant to formalise the OpSets approach and produce mechanised proofs of correctness of the main claims in this paper, thereby eliminating the ambiguity of previous informal approaches, and ruling out reasoning errors that could occur in handwritten proofs.</dcterms:abstract>
<dc:title>OpSets: Sequential Specifications for Replicated Datatypes (Extended Version)</dc:title>
<z:shortTitle>OpSets</z:shortTitle>
</bib:Article>
<z:Attachment rdf:about="#item_707">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://www.arxiv.org/pdf/1805.04263.pdf</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:57:44</dcterms:dateSubmitted>
<dc:title>arXiv:1805.04263 PDF</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>application/pdf</link:type>
</z:Attachment>
<z:Attachment rdf:about="#item_691">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://arxiv.org/abs/1805.04263</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:57:45</dcterms:dateSubmitted>
<dc:title>arXiv.org Snapshot</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="https://blog.ploeh.dk/2018/09/03/the-identity-functor/">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website><dc:title>ploeh blog</dc:title></z:Website>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Seemann</foaf:surname>
<foaf:givenname>Mark</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_683"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://blog.ploeh.dk/2018/09/03/the-identity-functor/</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>3.9.2018</dc:date>
<dcterms:dateSubmitted>2019-05-22 07:52:39</dcterms:dateSubmitted>
<dc:title>The Identity functor</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_683">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://blog.ploeh.dk/2018/09/03/the-identity-functor/</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:52:39</dcterms:dateSubmitted>
<dc:title>The Identity functor</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="https://www.tweag.io/posts/2017-03-13-linear-types.html">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website><dc:title>Tweag I/O</dc:title></z:Website>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Bernardy</foaf:surname>
<foaf:givenname>Jean-Philippe</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>Spiwack</foaf:surname>
<foaf:givenname>Arnaud</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_704"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://www.tweag.io/posts/2017-03-13-linear-types.html</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>13.3.2017</dc:date>
<dcterms:dateSubmitted>2019-05-22 07:51:33</dcterms:dateSubmitted>
<dc:title>Linear types make performance more predictable</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_704">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://www.tweag.io/posts/2017-03-13-linear-types.html</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:51:34</dcterms:dateSubmitted>
<dc:title>Tweag I/O - Linear typesmake performance more predictable</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Article rdf:about="http://arxiv.org/abs/1808.01599">
<z:itemType>journalArticle</z:itemType>
<dcterms:isPartOf>
<bib:Journal><dc:title>arXiv:1808.01599 [cs]</dc:title></bib:Journal>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Peters</foaf:surname>
<foaf:givenname>Kirstin</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>Nestmann</foaf:surname>
<foaf:givenname>Uwe</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_672"/>
<link:link rdf:resource="#item_699"/>
<dc:subject>
<z:AutomaticTag>
<rdf:value>Computer Science - Logic in Computer Science</rdf:value>
</z:AutomaticTag>
</dc:subject>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://arxiv.org/abs/1808.01599</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>2018-08-05</dc:date>
<dc:description>arXiv: 1808.01599</dc:description>
<dcterms:dateSubmitted>2019-05-22 07:51:25</dcterms:dateSubmitted>
<z:libraryCatalog>arXiv.org</z:libraryCatalog>
<dcterms:abstract>Modern society is dependent on distributed software systems and to verify them different modelling languages such as mobile ambients were developed. To analyse the quality of mobile ambients as a good foundational model for distributed computation, we analyse the level of synchronisation between distributed components that they can express. Therefore, we rely on earlier established synchronisation patterns. It turns out that mobile ambients are not fully distributed, because they can express enough synchronisation to express a synchronisation pattern called M. However, they can express strictly less synchronisation than the standard pi-calculus. For this reason, we can show that there is no good and distributability-preserving encoding from the standard pi-calculus into mobile ambients and also no such encoding from mobile ambients into the join-calculus, i.e., the expressive power of mobile ambients is in between these languages. Finally, we discuss how these results can be used to obtain a fully distributed variant of mobile ambients.</dcterms:abstract>
<dc:title>On the Distributability of Mobile Ambients</dc:title>
</bib:Article>
<z:Attachment rdf:about="#item_672">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://www.arxiv.org/pdf/1808.01599.pdf</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:51:28</dcterms:dateSubmitted>
<dc:title>arXiv:1808.01599 PDF</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>application/pdf</link:type>
</z:Attachment>
<z:Attachment rdf:about="#item_699">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://arxiv.org/abs/1808.01599</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:51:31</dcterms:dateSubmitted>
<dc:title>arXiv.org Snapshot</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Article rdf:about="Making Ambients More Robust">
<z:itemType>journalArticle</z:itemType>
<dcterms:isPartOf>
<bib:Journal></bib:Journal>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Guan</foaf:surname>
<foaf:givenname>Xudong</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>Yang</foaf:surname>
<foaf:givenname>Yiling</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>You</foaf:surname>
<foaf:givenname>Jinyuan</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_719"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>Making Ambients More Robust</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>November 3, 2002</dc:date>
<z:libraryCatalog>ResearchGate</z:libraryCatalog>
<dcterms:abstract>Mobile Safe Ambients (SA) was proposed in order to remove the grave interference in the Mobile Ambient calculus. But the coactions introduced in SA also bring some security breaches. In this paper, a similar calculus called Robust Ambients (ROAM) was proposed as a more rational substitute for SA. Through specifying the parameters of the coactions, the ambients in ROAM are more robust against malicious tampering. The encoding of polyadic asynchronous p-calculus in ROAM shows that ROAM does not loss the strong expressiveness of its ancestors. The type system for ROAM proposed here also shows that the new calculus has some very good properties.</dcterms:abstract>
<dc:title>Making Ambients More Robust</dc:title>
</bib:Article>
<z:Attachment rdf:about="#item_719">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://www.researchgate.net/publication/2564630_Making_Ambients_More_Robust</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:49:54</dcterms:dateSubmitted>
<dc:title>ResearchGate Link</dc:title>
<z:linkMode>3</z:linkMode>
</z:Attachment>
<bib:Article rdf:about="http://www.dcs.ed.ac.uk/pepa/tuningsystems.pdf">
<z:itemType>journalArticle</z:itemType>
<dcterms:isPartOf>
<bib:Journal>
<prism:volume>48</prism:volume>
<dc:title>The Computer Journal</dc:title>
<dcterms:alternative>The Computer Journal</dcterms:alternative>
<dc:identifier>DOI 10.1093/comjnl/bxh097</dc:identifier>
</bib:Journal>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Hillston</foaf:surname>
<foaf:givenname>Jane</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_692"/>
<link:link rdf:resource="#item_714"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://www.dcs.ed.ac.uk/pepa/tuningsystems.pdf</rdf:value>
</dcterms:URI>
</dc:identifier>
<bib:pages>385-400</bib:pages>
<dc:date>July 1, 2005</dc:date>
<z:libraryCatalog>ResearchGate</z:libraryCatalog>
<dcterms:abstract>This paper gives a summary of some of the work of the Performance Evaluation Process Algebra (PEPA) project, which was awarded the 2004 Roger Needham Award from the BCS. Centred on the PEPA modelling formalism, the project has sought to balance theory and practice. Theoretical developments have been tested and validated by application to a wide range of problems and such case studies have provided the stimulus for new directions in theory. Both aspects of the work are presented in summary as well as some current and future research topics.</dcterms:abstract>
<dc:title>Tuning Systems: From Composition to Performance</dc:title>
<z:shortTitle>Tuning Systems</z:shortTitle>
</bib:Article>
<z:Attachment rdf:about="#item_692">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://www.researchgate.net/profile/Jane_Hillston/publication/262247322_Tuning_Systems_From_Composition_to_Performance/links/5430f50b0cf29bbc12772c3e/Tuning-Systems-From-Composition-to-Performance.pdf</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:48:12</dcterms:dateSubmitted>
<dc:title>Full Text PDF</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>application/pdf</link:type>
</z:Attachment>
<z:Attachment rdf:about="#item_714">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://www.researchgate.net/publication/262247322_Tuning_Systems_From_Composition_to_Performance</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:48:12</dcterms:dateSubmitted>
<dc:title>ResearchGate Link</dc:title>
<z:linkMode>3</z:linkMode>
</z:Attachment>
<bib:Document rdf:about="https://github.com/ethereum/cbc-casper/wiki">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website></z:Website>
</dcterms:isPartOf>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://github.com/ethereum/cbc-casper/wiki</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>2019-05-13T04:00:29Z</dc:date>
<dc:description>original-date: 2017-02-22T17:20:11Z</dc:description>
<dcterms:dateSubmitted>2019-05-22 07:46:16</dcterms:dateSubmitted>
<dc:title>Correct-by-construction Casper Wiki</dc:title>
</bib:Document>
<bib:Document rdf:about="https://kseo.github.io/posts/2015-06-18-total-functional-programming.html">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website><dc:title>Kwang's Haskell Blog</dc:title></z:Website>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Kwang</foaf:surname>
<foaf:givenname>Yul Seo</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_710"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://kseo.github.io/posts/2015-06-18-total-functional-programming.html</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>18.6.2015</dc:date>
<dcterms:dateSubmitted>2019-05-22 07:44:04</dcterms:dateSubmitted>
<dc:title>Total functional programming</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_710">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://kseo.github.io/posts/2015-06-18-total-functional-programming.html</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:44:04</dcterms:dateSubmitted>
<dc:title>Kwang's Haskell Blog - Total functional programming</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Article rdf:about="https://www.semanticscholar.org/paper/Total-Functional-Programming-Turner/2ce39c4f6c725082bf30e21ddb660c53026e88b5">
<z:itemType>journalArticle</z:itemType>
<dcterms:isPartOf>
<bib:Journal>
<prism:volume>10</prism:volume>
<dc:title>J. UCS</dc:title>
<dc:identifier>DOI 10.3217/jucs-010-07-0751</dc:identifier>
</bib:Journal>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Turner</foaf:surname>
<foaf:givenname>D. A.</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_682"/>
<link:link rdf:resource="#item_715"/>
<dc:subject>
<z:AutomaticTag><rdf:value>Computation</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag><rdf:value>Data structure</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag>
<rdf:value>Divergence (computer science)</rdf:value>
</z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag><rdf:value>Haskell</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag><rdf:value>Linear algebra</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag><rdf:value>Miranda</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag>
<rdf:value>Total functional programming</rdf:value>
</z:AutomaticTag>
</dc:subject>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://www.semanticscholar.org/paper/Total-Functional-Programming-Turner/2ce39c4f6c725082bf30e21ddb660c53026e88b5</rdf:value>
</dcterms:URI>
</dc:identifier>
<bib:pages>751-768</bib:pages>
<dc:date>2004</dc:date>
<z:libraryCatalog>Semantic Scholar</z:libraryCatalog>
<dcterms:abstract>The driving idea of functional programming is to make programming more closely related to mathematics. A program in a functional language such as Haskell or Miranda consists of equations which are both computation rules and a basis for simple algebraic reasoning about the functions and data structures they define. The existing model of functional programming, although elegant and powerful, is compromised to a greater extent than is commonly recognised by the presence of partial functions. We consider a simple discipline of total functional programming designed to exclude the possibility of non-termination. Among other things this requires a type distinction between data, which is finite, and codata, which is potentially infinite.</dcterms:abstract>
<dc:title>Total Functional Programming</dc:title>
</bib:Article>
<z:Attachment rdf:about="#item_682">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://pdfs.semanticscholar.org/82b4/ea72b89270c528006dd2532aef43eec463c3.pdf</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:43:39</dcterms:dateSubmitted>
<dc:title>Full Text PDF</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>application/pdf</link:type>
</z:Attachment>
<z:Attachment rdf:about="#item_715">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://www.semanticscholar.org/paper/Total-Functional-Programming-Turner/2ce39c4f6c725082bf30e21ddb660c53026e88b5</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:43:37</dcterms:dateSubmitted>
<dc:title>Semantic Scholar Link</dc:title>
<z:linkMode>3</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="https://ipfs.io/">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website><dc:title>IPFS</dc:title></z:Website>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Protocol Labs</foaf:surname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_670"/>
<dc:identifier>
<dcterms:URI><rdf:value>https://ipfs.io/</rdf:value></dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:43:08</dcterms:dateSubmitted>
<dcterms:abstract>A peer-to-peer hypermedia protocol to make the web faster, safer, and more open.</dcterms:abstract>
<dc:title>IPFS is the Distributed Web</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_670">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI><rdf:value>https://ipfs.io/</rdf:value></dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:43:25</dcterms:dateSubmitted>
<dc:title>Snapshot</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="https://git-scm.com/">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website></z:Website>
</dcterms:isPartOf>
<link:link rdf:resource="#item_713"/>
<dc:identifier>
<dcterms:URI><rdf:value>https://git-scm.com/</rdf:value></dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:43:05</dcterms:dateSubmitted>
<dc:title>Git</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_713">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI><rdf:value>https://git-scm.com/</rdf:value></dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:43:05</dcterms:dateSubmitted>
<dc:title>Git</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="https://3box.io/">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website></z:Website>
</dcterms:isPartOf>
<link:link rdf:resource="#item_686"/>
<dc:identifier>
<dcterms:URI><rdf:value>https://3box.io/</rdf:value></dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 08:02:10</dcterms:dateSubmitted>
<z:language>en</z:language>
<dcterms:abstract>One profile. A world of Ethereum dapps.</dcterms:abstract>
<dc:title>3Box</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_686">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI><rdf:value>https://3box.io/</rdf:value></dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 08:02:14</dcterms:dateSubmitted>
<dc:title>Snapshot</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="https://github.com/orbitdb/ipfs-log">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website></z:Website>
</dcterms:isPartOf>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://github.com/orbitdb/ipfs-log</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:rights>MIT</dc:rights>
<dc:date>2019-05-19T12:11:23Z</dc:date>
<dc:description>original-date: 2016-03-17T09:35:56Z</dc:description>
<dcterms:dateSubmitted>2019-05-22 08:01:38</dcterms:dateSubmitted>
<dc:title>ipfs-log - Append-only log CRDT on IPFS</dc:title>
</bib:Document>
<bib:Document rdf:about="https://discuss.ipfs.io/t/what-is-a-merkle-dag/386">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website><dc:title>IPFS discussion forum</dc:title></z:Website>
</dcterms:isPartOf>
<link:link rdf:resource="#item_674"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://discuss.ipfs.io/t/what-is-a-merkle-dag/386</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>2015-09-14</dc:date>
<dcterms:dateSubmitted>2019-05-22 08:00:02</dcterms:dateSubmitted>
<z:language>en</z:language>
<dcterms:abstract>From @Mithgol on Mon Sep 14 2015 14:27:32 GMT+0000 (UTC) A Merkle DAG is a Merkle directed acyclic graph. That is a data structure similar to a Merkle tree but not so strict: such DAG does not need to be balanced and its non-leaf nodes are allowed to contain data. Correct? Copied from original issue: https://github.com/ipfs/faq/issues/31</dcterms:abstract>
<dc:title>What is a Merkle DAG?</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_674">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://discuss.ipfs.io/t/what-is-a-merkle-dag/386</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 08:00:04</dcterms:dateSubmitted>
<dc:title>Snapshot</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="https://engineering.linkedin.com/distributed-systems/log-what-every-software-engineer-should-know-about-real-time-datas-unifying">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website><dc:title>The Log</dc:title></z:Website>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Kreps</foaf:surname>
<foaf:givenname>Jay</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_700"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://engineering.linkedin.com/distributed-systems/log-what-every-software-engineer-should-know-about-real-time-datas-unifying</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>16.12.2013</dc:date>
<dcterms:dateSubmitted>2019-05-22 07:59:02</dcterms:dateSubmitted>
<z:language>en</z:language>
<dcterms:abstract>I joined LinkedIn about six years ago at a particularly interesting time. We were just beginning to run up against the limits of our monolithic, centralized database and needed to start the transition to a portfolio of specialized distributed systems. This has been an interesting experience: we buil</dcterms:abstract>
<dc:title>What every software engineer should know about real-time data's unifying abstraction</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_700">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://engineering.linkedin.com/distributed-systems/log-what-every-software-engineer-should-know-about-real-time-datas-unifying</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:59:05</dcterms:dateSubmitted>
<dc:title>Snapshot</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Article rdf:about="https://www.semanticscholar.org/paper/Eventually-Returning-to-Strong-Consistency-Vukolic/a6a1b70305b27c556aac779fb65429db9c2e1ef2">
<z:itemType>journalArticle</z:itemType>
<dcterms:isPartOf>
<bib:Journal>
<prism:volume>39</prism:volume>
<dc:title>IEEE Data Eng. Bull.</dc:title>
</bib:Journal>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Vukolic</foaf:surname>
<foaf:givenname>Marko</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_711"/>
<link:link rdf:resource="#item_717"/>
<dc:subject>
<z:AutomaticTag><rdf:value>Cloud computing</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag>
<rdf:value>Consistency model</rdf:value>
</z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag><rdf:value>Data center</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag>
<rdf:value>Distributed computing</rdf:value>
</z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag>
<rdf:value>Eventual consistency</rdf:value>
</z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag><rdf:value>Linearizability</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag><rdf:value>Requirement</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag><rdf:value>Scalability</rdf:value></z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag>
<rdf:value>Strong consistency</rdf:value>
</z:AutomaticTag>
</dc:subject>
<dc:subject>
<z:AutomaticTag>
<rdf:value>System requirements</rdf:value>
</z:AutomaticTag>
</dc:subject>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://www.semanticscholar.org/paper/Eventually-Returning-to-Strong-Consistency-Vukolic/a6a1b70305b27c556aac779fb65429db9c2e1ef2</rdf:value>
</dcterms:URI>
</dc:identifier>
<bib:pages>39-44</bib:pages>
<dc:date>2016</dc:date>
<z:libraryCatalog>Semantic Scholar</z:libraryCatalog>
<dcterms:abstract>Eventually and weakly consistent distributed systems have emerged in the past decade as an answer to scalability and availability issues associated with strong consistency semantics, such as linearizability. However, systems offering strong consistency semantics have an advantage over systems based on weaker consistency models, as they are typically much simpler to reason about and are more intuitive to developers, exhibiting more predictable behavior. Therefore, a lot of research and development effort is being invested lately into the re-engineering of strongly consistent distributed systems, as well as into boosting their scalability and performance. This paper overviews and discusses several novel directions in the design and implementation of strongly consistent systems in industries and research domains such as cloud computing, data center networking and blockchain. It also discusses a general trend of returning to strong consistency in distributed systems, when system requirements permit so.</dcterms:abstract>
<dc:title>Eventually Returning to Strong Consistency</dc:title>
</bib:Article>
<z:Attachment rdf:about="#item_711">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://pdfs.semanticscholar.org/a6a1/b70305b27c556aac779fb65429db9c2e1ef2.pdf</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:58:29</dcterms:dateSubmitted>
<dc:title>Full Text PDF</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>application/pdf</link:type>
</z:Attachment>
<z:Attachment rdf:about="#item_717">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://www.semanticscholar.org/paper/Eventually-Returning-to-Strong-Consistency-Vukolic/a6a1b70305b27c556aac779fb65429db9c2e1ef2</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:58:29</dcterms:dateSubmitted>
<dc:title>Semantic Scholar Link</dc:title>
<z:linkMode>3</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="https://github.com/orbitdb">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website></z:Website>
</dcterms:isPartOf>
<link:link rdf:resource="#item_676"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://github.com/orbitdb</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:56:14</dcterms:dateSubmitted>
<z:language>en</z:language>
<dcterms:abstract>Peer-to-Peer Databases for the Decentralized Web.</dcterms:abstract>
<dc:title>OrbitDB</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_676">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://github.com/orbitdb</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:56:16</dcterms:dateSubmitted>
<dc:title>Snapshot</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Article rdf:about="https://hector.link/presentations/merkle-crdts/merkle-crdts.pdf">
<z:itemType>magazineArticle</z:itemType>
<dcterms:isPartOf>
<bib:Periodical></bib:Periodical>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Sanjuan</foaf:surname>
<foaf:givenname>Hector</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>Pöyhtäri</foaf:surname>
<foaf:givenname>Samuli</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>Teixeira</foaf:surname>
<foaf:givenname>Pedro</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://hector.link/presentations/merkle-crdts/merkle-crdts.pdf</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>February 2019</dc:date>
<dc:title>Merkle-CRDTs</dc:title>
</bib:Article>
<bib:Document rdf:about="http://www-sop.inria.fr/mimosa/ambicobjs/">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website></z:Website>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Zimmer</foaf:surname>
<foaf:givenname>Pascal</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_687"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://www-sop.inria.fr/mimosa/ambicobjs/</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:50:09</dcterms:dateSubmitted>
<dc:title>Ambient Programming in Icobjs</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_687">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://www-sop.inria.fr/mimosa/ambicobjs/</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:50:10</dcterms:dateSubmitted>
<dc:title>Ambient Simulator</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<rdf:Description rdf:about="urn:isbn:978-3-540-64300-5">
<z:itemType>conferencePaper</z:itemType>
<dcterms:isPartOf>
<bib:Journal>
<dcterms:isPartOf>
<bib:Series><dc:title>FoSSaCS '98</dc:title></bib:Series>
</dcterms:isPartOf>
<dc:identifier>ISBN 978-3-540-64300-5</dc:identifier>
<dc:title>Proceedings of the First International Conference on Foundations of Software Science and Computation Structure</dc:title>
</bib:Journal>
</dcterms:isPartOf>
<dc:publisher>
<foaf:Organization>
<vcard:adr>
<vcard:Address>
<vcard:locality>London, UK, UK</vcard:locality>
</vcard:Address>
</vcard:adr>
<foaf:name>Springer-Verlag</foaf:name>
</foaf:Organization>
</dc:publisher>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Cardelli</foaf:surname>
<foaf:givenname>Luca</foaf:givenname>
</foaf:Person>
</rdf:li>
<rdf:li>
<foaf:Person>
<foaf:surname>Gordon</foaf:surname>
<foaf:givenname>Andrew D.</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://dl.acm.org/citation.cfm?id=646790.759638</rdf:value>
</dcterms:URI>
</dc:identifier>
<bib:pages>140–155</bib:pages>
<dc:date>1998</dc:date>
<dcterms:dateSubmitted>2019-05-22 07:49:08</dcterms:dateSubmitted>
<z:libraryCatalog>ACM Digital Library</z:libraryCatalog>
<dc:title>Mobile Ambients</dc:title>
</rdf:Description>
<bib:Document rdf:about="https://medium.com/rchain-cooperative/a-visualization-for-the-future-of-blockchain-consensus-b6710b2f50d6">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website><dc:title>Medium</dc:title></z:Website>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Birch</foaf:surname>
<foaf:givenname>Michael</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_681"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://medium.com/rchain-cooperative/a-visualization-for-the-future-of-blockchain-consensus-b6710b2f50d6</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>2017-12-27T15:56:15.123Z</dc:date>
<dcterms:dateSubmitted>2019-05-22 07:44:46</dcterms:dateSubmitted>
<dcterms:abstract>An animated visualization of RChain’s proof-of-stake consensus model</dcterms:abstract>
<dc:title>A Visualization for the Future of Blockchain Consensus</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_681">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://medium.com/rchain-cooperative/a-visualization-for-the-future-of-blockchain-consensus-b6710b2f50d6</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:44:49</dcterms:dateSubmitted>
<dc:title>Snapshot</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="http://www.bailis.org/blog/linearizability-versus-serializability/">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website>
<dc:title>Highly Available, Seldom Consistent</dc:title>
</z:Website>
</dcterms:isPartOf>
<bib:authors>
<rdf:Seq>
<rdf:li>
<foaf:Person>
<foaf:surname>Bailis</foaf:surname>
<foaf:givenname>Peter</foaf:givenname>
</foaf:Person>
</rdf:li>
</rdf:Seq>
</bib:authors>
<link:link rdf:resource="#item_678"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://www.bailis.org/blog/linearizability-versus-serializability/</rdf:value>
</dcterms:URI>
</dc:identifier>
<dc:date>24.9.2014</dc:date>
<dcterms:dateSubmitted>2019-05-22 07:36:29</dcterms:dateSubmitted>
<dc:title>Linearizability versus Serializability</dc:title>
</bib:Document>
<z:Attachment rdf:about="#item_678">
<z:itemType>attachment</z:itemType>
<dc:identifier>
<dcterms:URI>
<rdf:value>http://www.bailis.org/blog/linearizability-versus-serializability/</rdf:value>
</dcterms:URI>
</dc:identifier>
<dcterms:dateSubmitted>2019-05-22 07:36:30</dcterms:dateSubmitted>
<dc:title>Linearizability versus Serializability | Peter Bailis</dc:title>
<z:linkMode>1</z:linkMode>
<link:type>text/html</link:type>
</z:Attachment>
<bib:Document rdf:about="https://bitcoin.org/en/">
<z:itemType>webpage</z:itemType>
<dcterms:isPartOf>
<z:Website></z:Website>
</dcterms:isPartOf>
<link:link rdf:resource="#item_706"/>
<dc:identifier>
<dcterms:URI>
<rdf:value>https://bitcoin.org/en/</rdf:value>
</dcterms:URI>
</dc:identifier>