source: doc/theses/mike_brooks_MMath/uw-ethesis.bib @ 8d76f2b

enumpthread-emulationqualifiedEnum
Last change on this file since 8d76f2b was 8d76f2b, checked in by Michael Brooks <mlbrooks@…>, 8 months ago

Adding runtime bound checking for array subscripts and showing the optimizer removing them.

Adding draft thesis content on dependent types and bound checks.

  • Property mode set to 100644
File size: 3.2 KB
Line 
1% Bibliography of key references for "LaTeX for Thesis and Large Documents"
2% For use with BibTeX
3
4% --------------------------------------------------
5% Cforall
6@misc{cfa:frontpage,
7  url = {https://cforall.uwaterloo.ca/}
8}
9@article{cfa:typesystem,
10  author    = {Aaron Moss and Robert Schluntz and Peter A. Buhr},
11  title     = {{\CFA} : Adding modern programming language features to {C}},
12  journal   = {Softw. Pract. Exp.},
13  volume    = {48},
14  number    = {12},
15  pages     = {2111--2146},
16  year      = {2018},
17  url       = {https://doi.org/10.1002/spe.2624},
18  doi       = {10.1002/spe.2624},
19  timestamp = {Thu, 09 Apr 2020 17:14:14 +0200},
20  biburl    = {https://dblp.org/rec/journals/spe/MossSB18.bib},
21  bibsource = {dblp computer science bibliography, https://dblp.org}
22}
23
24
25% --------------------------------------------------
26% Array prior work
27
28@inproceedings{arr:futhark:tytheory,
29    author = {Henriksen, Troels and Elsman, Martin},
30    title = {Towards Size-Dependent Types for Array Programming},
31    year = {2021},
32    isbn = {9781450384667},
33    publisher = {Association for Computing Machinery},
34    address = {New York, NY, USA},
35    url = {https://doi.org/10.1145/3460944.3464310},
36    doi = {10.1145/3460944.3464310},
37    abstract = {We present a type system for expressing size constraints on array types in an ML-style type system. The goal is to detect shape mismatches at compile-time, while being simpler than full dependent types. The main restrictions is that the only terms that can occur in types are array sizes, and syntactically they must be variables or constants. For those programs where this is not sufficient, we support a form of existential types, with the type system automatically managing the requisite book-keeping. We formalise a large subset of the type system in a small core language, which we prove sound. We also present an integration of the type system in the high-performance parallel functional language Futhark, and show on a collection of 44 representative programs that the restrictions in the type system are not too problematic in practice.},
38    booktitle = {Proceedings of the 7th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming},
39    pages = {1–14},
40    numpages = {14},
41    keywords = {functional programming, parallel programming, type systems},
42    location = {Virtual, Canada},
43    series = {ARRAY 2021}
44}
45
46@article{arr:dex:long,
47  author    = {Adam Paszke and
48               Daniel D. Johnson and
49               David Duvenaud and
50               Dimitrios Vytiniotis and
51               Alexey Radul and
52               Matthew J. Johnson and
53               Jonathan Ragan{-}Kelley and
54               Dougal Maclaurin},
55  title     = {Getting to the Point. Index Sets and Parallelism-Preserving Autodiff
56               for Pointful Array Programming},
57  journal   = {CoRR},
58  volume    = {abs/2104.05372},
59  year      = {2021},
60  url       = {https://arxiv.org/abs/2104.05372},
61  eprinttype = {arXiv},
62  eprint    = {2104.05372},
63  timestamp = {Mon, 25 Oct 2021 07:55:47 +0200},
64  biburl    = {https://dblp.org/rec/journals/corr/abs-2104-05372.bib},
65  bibsource = {dblp computer science bibliography, https://dblp.org}
66}
Note: See TracBrowser for help on using the repository browser.