-
Notifications
You must be signed in to change notification settings - Fork 1
/
dissertation.bib
873 lines (785 loc) · 31.5 KB
/
dissertation.bib
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
@inproceedings{1995_wadler_monads,
title={Monads for functional programming},
author={Wadler, P.},
booktitle={Int'l School on Advanced Functional Programming},
pages={24--52},
year={1995},
organization={Springer}
}
@article{Ramsey:2002:SLC:565816.503288,
author = {Ramsey, Norman and Pfeffer, Avi},
title = {Stochastic Lambda Calculus and Monads of Probability Distributions},
journal = {SIGPLAN Not.},
issue_date = {Jan. 2002},
volume = {37},
number = {1},
month = jan,
year = {2002},
issn = {0362-1340},
pages = {154--165},
numpages = {12},
url = {http://doi.acm.org/10.1145/565816.503288},
doi = {10.1145/565816.503288},
acmid = {503288},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{Goodman:2013:PPP:2480359.2429117,
author = {Goodman, Noah D.},
title = {The Principles and Practice of Probabilistic Programming},
journal = {SIGPLAN Not.},
issue_date = {January 2013},
volume = {48},
number = {1},
month = jan,
year = {2013},
issn = {0362-1340},
pages = {399--402},
numpages = {4},
url = {http://doi.acm.org/10.1145/2480359.2429117},
doi = {10.1145/2480359.2429117},
acmid = {2429117},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {probabilistic models, probabilistic programs},
}
@article{minkainfer,
title={Infer .NET 2.3, Nov. 2009},
year={2009},
author={Minka, T and Winn, J and Guiver, J and Kannan, A},
journal={Software available from http://research. microsoft. com/infernet}
}
@article{gilks1994language,
title={A language and program for complex Bayesian modelling},
author={Gilks, Wally R and Thomas, Andrew and Spiegelhalter, David J},
journal={Journal of the Royal Statistical Society: Series D (The Statistician)},
volume={43},
number={1},
pages={169--177},
year={1994},
publisher={Wiley Online Library}
}
@article{goodman2012church,
title={Church: a language for generative models},
author={Goodman, Noah and Mansinghka, Vikash and Roy, Daniel M and Bonawitz, Keith and Tenenbaum, Joshua B},
journal={arXiv preprint arXiv:1206.3255},
year={2012}
}
@article{mansinghka2014venture,
title={Venture: a higher-order probabilistic programming platform with programmable inference},
author={Mansinghka, Vikash and Selsam, Daniel and Perov, Yura},
journal={arXiv preprint arXiv:1404.0099},
year={2014}
}
@inproceedings{tolpin2015probabilistic,
title={Probabilistic programming in Anglican},
author={Tolpin, David and van de Meent, Jan-Willem and Wood, Frank},
booktitle={Joint European Conference on Machine Learning and Knowledge Discovery in Databases},
pages={308--311},
year={2015},
organization={Springer}
}
@article{scibior2018functional,
title={Functional programming for modular Bayesian inference},
author={{\'S}cibior, Adam and Kammar, Ohad and Ghahramani, Zoubin},
journal={Proceedings of the ACM on Programming Languages},
volume={2},
number={ICFP},
pages={83},
year={2018},
publisher={ACM}
}
@article{larsen2011memory,
title={Memory efficient implementation of probability monads},
author={Larsen, Ken Friis},
journal={Unpublished manuscript (August 2011)},
year={2011}
}
@article{kidd2007build,
title={Build your own probability monads},
author={Kidd, Eric},
journal={Draft paper for Hac},
volume={7},
year={2007}
}
@inproceedings{Gordon:2013:MPB:2429069.2429119,
author = {Gordon, Andrew D. and Aizatulin, Mihhail and Borgstrom, Johannes and Claret, Guillaume and Graepel, Thore and Nori, Aditya V. and Rajamani, Sriram K. and Russo, Claudio},
title = {A Model-learner Pattern for Bayesian Reasoning},
booktitle = {Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages},
series = {POPL '13},
year = {2013},
isbn = {978-1-4503-1832-7},
location = {Rome, Italy},
pages = {403--416},
numpages = {14},
url = {http://doi.acm.org/10.1145/2429069.2429119},
doi = {10.1145/2429069.2429119},
acmid = {2429119},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {bayesian reasoning, machine learning, model-learner pattern, probabilistic programming},
}
@misc{gist_2019, title={Sigma Selective}, url={https://web.archive.org/web/20190625225137/https://gist.github.com/copumpkin/d5bdbc7afda54ff04049b6bdbcffb67e}, author={Daniel Pebles}, year={2019}}
@misc{dune_2018, title={A composable build system}, url={https://dune.build/}, author={Jane Street}, year={2018}}
@misc{meent2018introduction,
title={An Introduction to Probabilistic Programming},
author={Jan-Willem van de Meent and Brooks Paige and Hongseok Yang and Frank Wood},
year={2018},
eprint={1809.10756},
archivePrefix={arXiv},
primaryClass={stat.ML}
}
@article{mcbride2008applicative,
title={Applicative programming with effects},
author={McBride, Conor and Paterson, Ross},
journal={Journal of Functional Programming},
volume={18},
number={1},
pages={1--13},
year={2008},
publisher={Cambridge University Press}
}
@article{Marlow:2014:NFA:2692915.2628144,
author = {Marlow, Simon and Brandy, Louis and Coens, Jonathan and Purdy, Jon},
title = {There is No Fork: An Abstraction for Efficient, Concurrent, and Concise Data Access},
journal = {SIGPLAN Not.},
issue_date = {September 2014},
volume = {49},
number = {9},
month = aug,
year = {2014},
issn = {0362-1340},
pages = {325--337},
numpages = {13},
url = {http://doi.acm.org/10.1145/2692915.2628144},
doi = {10.1145/2692915.2628144},
acmid = {2628144},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {applicative, concurrency, data-fetching, distributed, haskell, monad},
}
@book{maclane:71,
added-at = {2009-09-18T21:22:09.000+0200},
address = {New York},
author = {MacLane, Saunders},
biburl = {https://www.bibsonomy.org/bibtex/29e8ca8b4bf357cc41e40e98cca25cb8c/minas},
interhash = {51566d046db4c3ea930c2b5ca79173f1},
intrahash = {9e8ca8b4bf357cc41e40e98cca25cb8c},
keywords = {CategoryTheory},
mrclass = {18-02},
mrnumber = {MR0354798 (50 \#7275)},
mrreviewer = {H.-B. Brinkmann},
note = {Graduate Texts in Mathematics, Vol. 5},
pages = {ix+262},
publisher = {Springer-Verlag},
timestamp = {2009-09-18T21:22:09.000+0200},
title = {Categories for the Working Mathematician},
year = 1971
}
@article{Lindley:2011:IOA:1953652.1954016,
author = {Lindley, Sam and Wadler, Philip and Yallop, Jeremy},
title = {Idioms Are Oblivious, Arrows Are Meticulous, Monads Are Promiscuous},
journal = {Electron. Notes Theor. Comput. Sci.},
issue_date = {March, 2011},
volume = {229},
number = {5},
month = mar,
year = {2011},
issn = {1571-0661},
pages = {97--117},
numpages = {21},
url = {http://dx.doi.org/10.1016/j.entcs.2011.02.018},
doi = {10.1016/j.entcs.2011.02.018},
acmid = {1954016},
publisher = {Elsevier Science Publishers B. V.},
address = {Amsterdam, The Netherlands, The Netherlands},
keywords = {applicative functors, arrows, idioms, monads},
}
@misc{hmatrix, title={HMatrix: Numeric Linear Algebra}, author={Ruiz, Alberto}, year={2019}, url={http://hackage.haskell.org/package/hmatrix-0.20.0.0}, journal={Hackage}}
@article{bernstein2019static,
title={Static Analysis for Probabilistic Programs},
author={Bernstein, Ryan},
journal={arXiv preprint arXiv:1909.05076},
year={2019}
}
@misc{jno-5,
author = {J.N. Oliveira}
, title = {Program Design by Calculation}
, oldnote = {Draft of textbook in preparation (since 1998).}
, note = {Draft of textbook in preparation, current version: April 2018. Informatics Department, University of Minho.}
, restofnote = {The following chapters are already complete: {\em An introduction to pointfree programming}, \emph{Recursion in the pointfree style}, \emph{Why monads matter} and \emph{Quasi-inductive datatypes} \footnote{URL: \url{http://www.di.uminho.pt/~jno/ps/pdbc.pdf}.}}
, year = {2008}
}
@inproceedings{selinger2004brief,
title={A brief survey of quantum programming languages},
author={Selinger, Peter},
booktitle={International Symposium on Functional and Logic Programming},
pages={1--6},
year={2004},
organization={Springer}
}
@inproceedings{innes2018machine,
title={On machine learning and programming languages},
author={Innes, Mike and Karpinski, Stefan and Shah, Viral and Barber, David and Saito Stenetorp, PLEPS and Besard, Tim and Bradbury, James and Churavy, Valentin and Danisch, Simon and Edelman, Alan and others},
year={2018},
organization={Association for Computing Machinery (ACM)}
}
@InProceedings{swiestra&duponcheel,
author="Swierstra, S. Doaitse
and Duponcheel, Luc",
editor="Launchbury, John
and Meijer, Erik
and Sheard, Tim",
title="Deterministic, error-correcting combinator parsers",
booktitle="Advanced Functional Programming",
year="1996",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="184--207",
abstract="We show how error-correcting, deterministic, combinator parsers can be constructed for grammars which have the LL(1) property. The normal disadvantages of conventional combinator parsers, such as their lack of speed and their poor error reporting, are remedied. Parsers constructed with these combinators are implicitly specialised for the grammar they describe. Because of this property the combinators act as a parser generator for LL(1) grammars. The techniques used to construct the combinators illustrate how partial parametrisation and careful ordering of computations can be used to achieve implicit partial evaluation in a lazy language.",
isbn="978-3-540-70639-7"
}
@article{Hughes:2000:GMA:347238.347246,
author = {Hughes, John},
title = {Generalising Monads to Arrows},
journal = {Sci. Comput. Program.},
issue_date = {May 2000},
volume = {37},
number = {1-3},
month = may,
year = {2000},
issn = {0167-6423},
pages = {67--111},
numpages = {45},
url = {http://dx.doi.org/10.1016/S0167-6423(99)00023-4},
doi = {10.1016/S0167-6423(99)00023-4},
acmid = {347246},
publisher = {Elsevier North-Holland, Inc.},
address = {Amsterdam, The Netherlands, The Netherlands},
}
@phdthesis{Scibior19,
title = {Formally justified and modular Bayesian inference for probabilistic programs},
author = {\'{S}cibior*, A.},
school = {University of Cambridge, UK},
year = {2019}
}
@PHDTHESIS{jtobin,
author = {Jared Tobin},
title = {Embedded Domain-Specific Languages for Bayesian Modelling and Inference},
school = { The University of Auckland},
year = {2018}
}
@incollection{giry1982,
added-at = {2010-03-25T16:34:44.000+0100},
address = {Berlin},
author = {Giry, Mich{\`e}le},
biburl = {https://www.bibsonomy.org/bibtex/2f5337cc5cdd234f601585efc4a33befb/3mta3},
booktitle = {Categorical aspects of topology and analysis ({O}ttawa, {O}nt., 1980)},
interhash = {9ce07983638982af042669c386601337},
intrahash = {f5337cc5cdd234f601585efc4a33befb},
keywords = {},
mrclass = {60A05 (18B99 60G05)},
mrnumber = {MR659884 (83k:60007)},
mrreviewer = {A. I. Dale},
pages = {68--85},
publisher = {Springer},
series = {Lecture Notes in Mathematics},
timestamp = {2010-03-25T16:34:44.000+0100},
title = {A categorical approach to probability theory},
volume = 915,
year = 1982
}
@misc{ wiki:xxx,
author = "HaskellWiki",
title = "Typeclassopedia --- HaskellWiki{,} ",
year = "2019",
url = "https://wiki.haskell.org/index.php?title=Typeclassopedia&oldid=63003",
note = "[Online; accessed 5-November-2019]"
}
@article{Moggi:1991:NCM:116981.116984,
author = {Moggi, Eugenio},
title = {Notions of Computation and Monads},
journal = {Inf. Comput.},
issue_date = {July 1991},
volume = {93},
number = {1},
month = jul,
year = {1991},
issn = {0890-5401},
pages = {55--92},
numpages = {38},
url = {http://dx.doi.org/10.1016/0890-5401(91)90052-4},
doi = {10.1016/0890-5401(91)90052-4},
acmid = {116984},
publisher = {Academic Press, Inc.},
address = {Duluth, MN, USA},
}
@book{godement1958topologie,
title={Topologie alg{\'e}brique et th{\'e}orie des faisceaux},
author={Godement, Roger},
volume={13},
year={1958},
publisher={Hermann Paris}
}
@book{Awodey:2010:CT:2060081,
author = {Awodey, Steve},
title = {Category Theory},
year = {2010},
isbn = {0199237182, 9780199237180},
edition = {2nd},
publisher = {Oxford University Press, Inc.},
address = {New York, NY, USA},
}
@article{Liskov:1987:KAD:62139.62141,
author = {Liskov, Barbara},
title = {Keynote Address - Data Abstraction and Hierarchy},
journal = {SIGPLAN Not.},
issue_date = {May 1988},
volume = {23},
number = {5},
month = jan,
year = {1987},
issn = {0362-1340},
pages = {17--34},
numpages = {18},
url = {http://doi.acm.org/10.1145/62139.62141},
doi = {10.1145/62139.62141},
acmid = {62141},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{murta2013calculating,
title={Calculating risk in functional programming},
author={Murta, Daniel and Oliveira, Jose Nuno},
journal={arXiv preprint arXiv:1311.3687},
year={2013}
}
@inproceedings{Wadler:1989:TF:99370.99404,
author = {Wadler, Philip},
title = {Theorems for Free!},
booktitle = {Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture},
series = {FPCA '89},
year = {1989},
isbn = {0-89791-328-0},
location = {Imperial College, London, United Kingdom},
pages = {347--359},
numpages = {13},
url = {http://doi.acm.org/10.1145/99370.99404},
doi = {10.1145/99370.99404},
acmid = {99404},
publisher = {ACM},
address = {New York, NY, USA},
}
@article{poll-aop,
author = {Poll, Erik and Thompson, Simon},
title = {Algebra of Programming by Richard Bird and Oege de Moor, Prentice Hall, 1996 (Dated 1997).},
year = {1999},
issue_date = {May 1999},
publisher = {Cambridge University Press},
address = {USA},
volume = {9},
number = {3},
issn = {0956-7968},
journal = {J. Funct. Program.},
month = may,
pages = {347–354},
numpages = {8}
}
@article{brusilovsky1994teaching,
title={Teaching Programming to Novices: A Review of Approaches and Tools.},
author={Brusilovsky, P and others},
year={1994},
publisher={ERIC}
}
@article{swierstra_2008, title={Data types à la carte}, volume={18}, DOI={10.1017/S0956796808006758}, number={4}, journal={Journal of Functional Programming}, publisher={Cambridge University Press}, author={Swiestra, Wouter}, year={2008}, pages={423–436}}
@book{rosenhouse2009monty,
title={The Monty Hall problem: the remarkable story of Math's most contentious brain teaser},
author={Rosenhouse, Jason and others},
year={2009},
publisher={Oxford University Press}
}
@book{freyd1990categories,
title={Categories, allegories},
author={Freyd, Peter J and Scedrov, Andre},
year={1990},
publisher={Elsevier}
}
@article{oliveira2012towards,
title={Towards a linear algebra of programming},
author={Oliveira, Jos{\'e} N},
journal={Formal Aspects of Computing},
volume={24},
number={4-6},
pages={433--458},
year={2012},
publisher={Springer}
}
@book{Bird:1997:AP:248932,
author = {Bird, Richard and de Moor, Oege},
title = {Algebra of Programming},
year = {1997},
isbn = {0-13-507245-X},
publisher = {Prentice-Hall, Inc.},
address = {Upper Saddle River, NJ, USA},
}
@misc{Macedo2012MatricesAA,
title={Matrices as arrows: why categories of matrices matter},
author={Hugo Daniel Macedo},
year={2012}
}
@article{Oliveira2016KeepDC,
title={"Keep definition, change category" - A practical approach to state-based system calculi},
author={Jos{\'e} Nuno Oliveira and Victor Cacciari Miraldo},
journal={J. Log. Algebr. Meth. Program.},
year={2016},
volume={85},
pages={449-474}
}
@article{Marlow:2016:DHD:3241625.2976007,
author = {Marlow, Simon and Peyton Jones, Simon and Kmett, Edward and Mokhov, Andrey},
title = {Desugaring Haskell's Do-notation into Applicative Operations},
journal = {SIGPLAN Not.},
issue_date = {December 2016},
volume = {51},
number = {12},
month = sep,
year = {2016},
issn = {0362-1340},
pages = {92--104},
numpages = {13},
url = {http://doi.acm.org/10.1145/3241625.2976007},
doi = {10.1145/3241625.2976007},
acmid = {2976007},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Applicative Functors, Monads, concurrency, parallelism},
}
@article{DBLP:journals/corr/abs-1803-10195,
author = {Tomas Petricek},
title = {What we talk about when we talk about monads},
journal = {CoRR},
volume = {abs/1803.10195},
year = {2018},
url = {http://arxiv.org/abs/1803.10195},
archivePrefix = {arXiv},
eprint = {1803.10195},
timestamp = {Mon, 13 Aug 2018 16:45:58 +0200},
biburl = {https://dblp.org/rec/bib/journals/corr/abs-1803-10195},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{andrey2019selective,
author = {Mokhov, Andrey and Lukyanov, Georgy and Marlow, Simon and Dimino, Jeremie},
title = {Selective Applicative Functors},
journal = {Proc. ACM Program. Lang.},
issue_date = {August 2019},
volume = {3},
number = {ICFP},
month = jul,
year = {2019},
issn = {2475-1421},
pages = {90:1--90:29},
articleno = {90},
numpages = {29},
url = {http://doi.acm.org/10.1145/3341694},
doi = {10.1145/3341694},
acmid = {3341694},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {applicative functors, effects, monads, selective functors},
}
@book{CaseBerg:01,
abstract = {{This book builds theoretical statistics from the first
principles of probability theory. Starting from the basics
of probability, the authors develop the theory of
statistical inference using techniques, definitions, and
concepts that are statistical and are natural extensions
and consequences of previous concepts. Intended for
first-year graduate students, this book can be used for
students majoring in statistics who have a solid
mathematics background. It can also be used in a way that
stresses the more practical uses of statistical theory,
being more concerned with understanding basic statistical
concepts and deriving reasonable statistical procedures for
a variety of situations, and less concerned with formal
optimality investigations.}},
added-at = {2009-10-28T04:42:52.000+0100},
author = {Casella, George and Berger, Roger},
biburl = {https://www.bibsonomy.org/bibtex/21597678f36e23439610affbf46adec1c/jwbowers},
citeulike-article-id = {105644},
date-added = {2007-09-03 22:45:16 -0500},
date-modified = {2007-09-03 22:45:16 -0500},
howpublished = {{Textbook Binding}},
interhash = {2dd8caad6c0b6fb80e6334986a231a05},
intrahash = {1597678f36e23439610affbf46adec1c},
isbn = {0534243126},
keywords = {methodology probability statistics},
month = {June},
opturl = {http://www.amazon.fr/exec/obidos/ASIN/0534243126/citeulike04-21},
publisher = {{Duxbury Resource Center}},
timestamp = {2009-10-28T04:42:57.000+0100},
title = {Statistical Inference},
year = 2001
}
@ARTICLE{RePEc:bes:amstat:v:59:y:2005:m:august:p:276-276,
title = {Probability and Statistics: The Science of Uncertainty, Michael J. Evans and Jeffrey S. Rosenthal},
author = {Annis, Dave H.},
year = {2005},
journal = {The American Statistician},
volume = {59},
pages = {276-276},
url = {https://EconPapers.repec.org/RePEc:bes:amstat:v:59:y:2005:m:august:p:276-276}
}
@article{Scibior:2015:PPP:2887747.2804317,
author = {\'{S}cibior, Adam and Ghahramani, Zoubin and Gordon, Andrew D.},
title = {Practical Probabilistic Programming with Monads},
journal = {SIGPLAN Not.},
issue_date = {December 2015},
volume = {50},
number = {12},
month = aug,
year = {2015},
issn = {0362-1340},
pages = {165--176},
numpages = {12},
url = {http://doi.acm.org/10.1145/2887747.2804317},
doi = {10.1145/2887747.2804317},
acmid = {2804317},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Bayesian statistics, Haskell, Monte Carlo, monads, probabilistic programming},
}
@inproceedings{DBLP:journals/corr/CapriottiK14,
author = {Paolo Capriotti and
Ambrus Kaposi},
title = {Free Applicative Functors},
booktitle = {Proceedings 5th Workshop on Mathematically Structured Functional Programming,
MSFP@ETAPS 2014, Grenoble, France, 12 April 2014.},
pages = {2--30},
year = {2014},
url = {https://doi.org/10.4204/EPTCS.153.2},
doi = {10.4204/EPTCS.153.2},
timestamp = {Wed, 12 Sep 2018 01:05:13 +0200},
biburl = {https://dblp.org/rec/bib/journals/corr/CapriottiK14},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{Cooper:2008:EFA:1485346.1485361,
author = {Cooper, Ezra and Lindley, Sam and Wadler, Philip and Yallop, Jeremy},
title = {The Essence of Form Abstraction},
booktitle = {Proceedings of the 6th Asian Symposium on Programming Languages and Systems},
series = {APLAS '08},
year = {2008},
isbn = {978-3-540-89329-5},
location = {Bangalore, India},
pages = {205--220},
numpages = {16},
url = {http://dx.doi.org/10.1007/978-3-540-89330-1_15},
doi = {10.1007/978-3-540-89330-1_15},
acmid = {1485361},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
}
@inproceedings{Paterson:2012:CAF:2368298.2368321,
author = {Paterson, Ross},
title = {Constructing Applicative Functors},
booktitle = {Proceedings of the 11th International Conference on Mathematics of Program Construction},
series = {MPC'12},
year = {2012},
isbn = {978-3-642-31112-3},
location = {Madrid, Spain},
pages = {300--323},
numpages = {24},
url = {http://dx.doi.org/10.1007/978-3-642-31113-0_15},
doi = {10.1007/978-3-642-31113-0_15},
acmid = {2368321},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg},
}
@book{feller-vol-2,
added-at = {2009-03-19T17:13:29.000+0100},
address = {New York},
author = {Feller, William},
biburl = {https://www.bibsonomy.org/bibtex/2780e5c7a7c4d5e1c30f5e8128c6cca34/peter.ralph},
description = {Feller volume 2},
interhash = {1cb77c0723c4f6777267e0becc521356},
intrahash = {780e5c7a7c4d5e1c30f5e8128c6cca34},
keywords = {feller reference},
mrclass = {60.00},
mrnumber = {MR0270403 (42 \#5292)},
pages = {xxiv+669},
publisher = {John Wiley \& Sons Inc.},
series = {Second edition},
timestamp = {2009-03-19T17:13:29.000+0100},
title = {An introduction to probability theory and its applications.
{V}ol. {II}. },
year = 1971
}
@article{erwig_kollmansberger_2006,
title={FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell},
volume={16},
DOI={10.1017/S0956796805005721},
number={1},
journal={Journal of Functional Programming},
publisher={Cambridge University Press},
author={Erwig, Martin and Kollmansberger, Steve},
year={2006},
pages={21–34}
}
@article{kim2019sampling,
title={Sampling techniques for big data analysis},
author={Kim, Jae Kwang and Wang, Zhonglei},
journal={International Statistical Review},
volume={87},
pages={S177--S191},
year={2019},
publisher={Wiley Online Library}
}
@inproceedings{dylus2018probabilistic,
title={Probabilistic Functional Logic Programming},
author={Dylus, Sandra and Christiansen, Jan and Teegen, Finn},
booktitle={International Symposium on Practical Aspects of Declarative Languages},
pages={3--19},
year={2018},
organization={Springer}
}
@inproceedings{paixao2020calculational,
title={Calculational Proofs in Relational Graphical Linear Algebra},
author={Paix{\~a}o, Jo{\~a}o and Soboci{\'n}ski, Pawe{\l}},
booktitle={Brazilian Symposium on Formal Methods},
pages={83--100},
year={2020},
organization={Springer}
}
@ARTICLE{7917368,
author={Q. {Liu} and S. J. {Qin} and T. {Chai}},
journal={IEEE Transactions on Industrial Informatics},
title={Unevenly Sampled Dynamic Data Modeling and Monitoring With an Industrial Application},
year={2017},
volume={13},
number={5},
pages={2203-2213},
doi={10.1109/TII.2017.2700520}}
@inproceedings{10.1145/3203217.3205863,
author = {Bartolini, Andrea and Borghesi, Andrea and Libri, Antonio and Beneventi, Francesco and Gregori, Daniele and Tinti, Simone and Gianfreda, Cosimo and Alto\`{e}, Piero},
title = {The D.A.V.I.D.E. Big-Data-Powered Fine-Grain Power and Performance Monitoring Support},
year = {2018},
isbn = {9781450357616},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3203217.3205863},
doi = {10.1145/3203217.3205863},
abstract = {On the race toward exascale supercomputing systems are facing important challenges which limit the efficiency of the system. Among all, power and energy consumption fueled by the end of Dennard's scaling start to show their impact on limiting supercomputers peak performance and cost effectiveness.In this paper we present and describe a new methodology based on a set of HW and SW extensions for fine-grain monitoring of power and aggregation of them for fast analysis and visualization. We propose a turn-key system which uses MQTT communication layer, NoSQL database, fine grain monitoring and in future AI technology to measure and control power and performance. This methodology is shown as an integrated feature of the D.A.V.I.D.E. supercomputing machine.},
booktitle = {Proceedings of the 15th ACM International Conference on Computing Frontiers},
pages = {303–308},
numpages = {6},
keywords = {big data, high performance computing, AMESTER, beaglebone black, fine-grain power and performance monitoring},
location = {Ischia, Italy},
series = {CF '18}
}
@article{ZHOU2017350,
title = "Machine learning on big data: Opportunities and challenges",
journal = "Neurocomputing",
volume = "237",
pages = "350 - 361",
year = "2017",
issn = "0925-2312",
doi = "https://doi.org/10.1016/j.neucom.2017.01.026",
url = "http://www.sciencedirect.com/science/article/pii/S0925231217300577",
author = "Lina Zhou and Shimei Pan and Jianwu Wang and Athanasios V. Vasilakos",
keywords = "Machine learning, Big data, Data preprocessing, Evaluation, Parallelization",
abstract = "Machine learning (ML) is continuously unleashing its power in a wide range of applications. It has been pushed to the forefront in recent years partly owing to the advent of big data. ML algorithms have never been better promised while challenged by big data. Big data enables ML algorithms to uncover more fine-grained patterns and make more timely and accurate predictions than ever before; on the other hand, it presents major challenges to ML such as model scalability and distributed computing. In this paper, we introduce a framework of ML on big data (MLBiD) to guide the discussion of its opportunities and challenges. The framework is centered on ML which follows the phases of preprocessing, learning, and evaluation. In addition, the framework is also comprised of four other components, namely big data, user, domain, and system. The phases of ML and the components of MLBiD provide directions for identification of associated opportunities and challenges and open up future work in many unexplored or under explored research areas."
}
@inproceedings{gordon2014probabilistic,
author = {Gordon, Andrew D. and Henzinger, Thomas A. and Nori, Aditya V. and Rajamani, Sriram K.},
title = {Probabilistic Programming},
year = {2014},
isbn = {9781450328654},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2593882.2593900},
doi = {10.1145/2593882.2593900},
abstract = { Probabilistic programs are usual functional or imperative programs with two added constructs: (1) the ability to draw values at random from distributions, and (2) the ability to condition values of variables in a program via observations. Models from diverse application areas such as computer vision, coding theory, cryptographic protocols, biology and reliability analysis can be written as probabilistic programs. Probabilistic inference is the problem of computing an explicit representation of the probability distribution implicitly specified by a probabilistic program. Depending on the application, the desired output from inference may vary---we may want to estimate the expected value of some function f with respect to the distribution, or the mode of the distribution, or simply a set of samples drawn from the distribution. In this paper, we describe connections this research area called ``Probabilistic Programming" has with programming languages and software engineering, and this includes language design, and the static and dynamic analysis of programs. We survey current state of the art and speculate on promising directions for future research. },
booktitle = {Future of Software Engineering Proceedings},
pages = {167–181},
numpages = {15},
keywords = {Machine learning, Probabilistic programming, Program analysis},
location = {Hyderabad, India},
series = {FOSE 2014}
}
@book{anderson1999lapack,
title={LAPACK Users' guide},
author={Anderson, Edward and Bai, Zhaojun and Bischof, Christian and Blackford, Susan and Dongarra, Jack and Du Croz, Jeremy and Greenbaum, Anne and Hammarling, Sven and McKenney, Alan and Sorensen, Danny},
volume={9},
year={1999},
publisher={Siam}
}
@inproceedings{Bu01,
author = {Bussche, Jan Van den},
shortauthor = {J. Bussche},
title = {Applications of {Alfred Tarski}'s Ideas in Database Theory},
booktitle = {CSL'01},
longbooktitle = {CSL'01: Proceedings of the 15th International Workshop on Computer Science Logic},
year = {2001},
isbn = {3-540-42554-3},
pages = {20--37},
publisher = {Springer-Verlag},
address = {London, UK},
}
@misc{wiki:BayesianNetwork,
author = "{Wikipedia}",
title = "Bayesian network",
year = "2020",
url = {https://en.wikipedia.org/wiki/Bayesian_network},
note = {(Accessed: 2020-02-16)}
}
@misc{Armando2020,
author = {Armando Santos},
title = {Selective Functors \& Probabilistic Programming},
year = {2020},
publisher = {GitHub},
journal = {GitHub repository},
howpublished = {\url{https://github.com/bolt12/master-thesis}},
commit = {e1159abed522ff28f7df3559f0cf40a781de7e04}
}
@article{Claessen1999FunctionalPA,
title={A poor man's concurrency monad},
author={Claessen, Koen},
journal={Journal of Functional Programming},
volume={9},
number={3},
pages={313--323},
year={1999},
publisher={Cambridge University Press}
}
@misc{Scholz1995ACM,
author = {Scholz, Enno},
year = {1995},
title = {A concurrency monad based on constructor primitives},
howpublished = "http://dx.doi.org/10.17169/refubium-22616",
}
@article{samet1984quadtree,
title={The quadtree and related hierarchical data structures},
author={Samet, Hanan},
journal={ACM Computing Surveys (CSUR)},
volume={16},
number={2},
pages={187--260},
year={1984},
publisher={ACM New York, NY, USA}
}
@inproceedings{10.1145/3406088.3409019,
author = {Santos, Armando and Oliveira, Jos\'{e} N.},
title = {Type Your Matrices for Great Good: A Haskell Library of Typed Matrices and Applications (Functional Pearl)},
year = {2020},
isbn = {9781450380508},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3406088.3409019},
doi = {10.1145/3406088.3409019},
abstract = {We study a simple inductive data type for representing correct-by-construction matrices. Despite its simplicity, it can be used to implement matrix-manipulation algorithms efficiently and safely, performing in some cases faster than existing alternatives even though the algorithms are written in a direct and purely functional style. A rich collection of laws makes it possible to derive and optimise these algorithms using equational reasoning, avoiding the notorious off-by-one indexing errors when fiddling with matrix dimensions. We demonstrate the usefulness of the data type on several examples, and highlight connections to related topics in category theory.},
booktitle = {Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell},
pages = {54–66},
numpages = {13},
keywords = {Haskell, Data Analysis, Quantum Programming, Matrices, Probabilistic Programming, Linear Algebra of Programming},
location = {Virtual Event, USA},
series = {Haskell 2020}
}