@@ -1,63 +1,54 @@
1Automatically generated by Mendeley 1.3.1
1Automatically generated by Mendeley 1.3.1
2Any changes to this file will be lost if it is regenerated by Mendeley.
2Any changes to this file will be lost if it is regenerated by Mendeley.
4−@book{Cryptography2012,
4+@inproceedings{norell2009dependently,
5−author = {Anderson, Ross},
5+author = {Norell, Ulf},
6−doi = {10.1093/intimm/dxs023},
6+booktitle = {Advanced Functional Programming},
7−file = {:home/edwin/Research/Papers/Mendeley/Anderson/Anderson - Unknown - Security Engineering Chapter 5.pdf:pdf},
7+file = {:home/edwin/Research/Papers/Mendeley/Norell/Norell - 2009 - Dependently typed programming in Agda.pdf:pdf},
8−isbn = {9780470068526},
8+keywords = {Dependent Types},
9−issn = {1460-2377},
9+mendeley-tags = {Dependent Types},
10−month = apr,
10+pages = {230--266},
11−number = {4},
11+publisher = {Springer},
12−pmid = {22451589},
12+title = {{Dependently typed programming in Agda}},
13−title = {{Security Engineering Chapter 5}},
13+url = {http://www.springerlink.com/index/8X0H38858233VN26.pdf},
14−url = {http://www.ncbi.nlm.nih.gov/pubmed/22451589},
14+year = {2009}
17−@inproceedings{ko2011modularising,
16+@article{Mandelbaum2007,
18−author = {Ko, H.S. and Gibbons, J.},
17+abstract = {Massive amounts of useful data are stored and processed in ad hoc formats for which common tools like parsers, printers, query engines and format converters are not readily available. In this paper, we explain the design and implementation of PADS/ML , a new language and system that facilitates the generation of data processing tools for ad hoc formats. The PADS/ML design includes features such as dependent, polymorphic and recursive datatypes, which allow programmers to describe the syntax and semantics of ad hoc data in a concise, easy-to-read notation. The PADS/ML implementation compiles these descriptions into ml structures and functors that include types for parsed data, functions for parsing and printing, and auxiliary support for user-specified, format-dependent and format-independent tool generation.},
19−booktitle = {Proceedings of the seventh ACM SIGPLAN workshop on Generic programming},
18+author = {Mandelbaum, Yitzhak and Fisher, Kathleen and Walker, David and Fernandez, Mary and Gleyzer, Artem},
20−file = {:home/edwin/Research/Papers/Mendeley/Ko, Gibbons/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
19+doi = {10.1145/1190215.1190231},
22+journal = {SIGPLAN Not},
21−pages = {13--24},
24+pages = {77--83},
22publisher = {ACM},
25publisher = {ACM},
23−title = {{Modularising inductive families}},
26+series = {POPL '07},
24−url = {http://www.cs.ox.ac.uk/publications/publication5008-abstract.html http://dl.acm.org/citation.cfm?id=2036921},
27+title = {{PADS/ML: a functional data description language}},
25−year = {2011}
28+url = {http://doi.acm.org/10.1145/1190216.1190231},
27−@inproceedings{gibbons2011modularising,
28−author = {Gibbons, J. and Ko, H.S. and Others},
29−file = {:home/edwin/Research/Papers/Mendeley/Ko, Gibbons/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
30−title = {{Modularising inductive families}},
31−url = {http://www.cs.ox.ac.uk/publications/publication5008-abstract.html},
32−year = {2011}
30+year = {2007}
35−author = {Okasaki, Chris},
36−file = {:home/edwin/Research/Papers/Mendeley/Okasaki/Okasaki - 1993 - Red-Black Trees in A Functional Setting.pdf:pdf},
37−journal = {Journal of functional programming},
38−title = {{Red-Black Trees in A Functional Setting}},
41−@misc{Brady2012b,
32+@misc{Abadi1997,
42−author = {Brooks, Fred},
33+author = {Abadi, Martin and Gordon, Andrew D},
43−doi = {10.1093/epirev/mxr031},
34+booktitle = {4TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY},
44−file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 2.pdf:pdf},
35+file = {:home/edwin/Research/Papers/Mendeley/Abadi, Gordon/Abadi, Gordon - 1997 - A calculus for cryptographic protocols The spi calculus.pdf:pdf},
45−isbn = {9780321702081},
36+pages = {36 -- 47},
46−issn = {1478-6729},
37+title = {{A calculus for cryptographic protocols: The spi calculus}},
47−pmid = {22215642},
38+url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.2176},
48−title = {{The Design of Design Chapter 2}}
39+year = {1997}
50−@inproceedings{Brady2003,
41+@article{Epstein2011,
51−author = {Brady, Edwin and McBride, Conor and McKinna, James},
42+author = {Epstein, Jeff and Black, Andrew P and Peyton-jones, Simon},
52−booktitle = {Types for Proofs and Programs},
43+institution = {Microsoft Research},
53−file = {:home/edwin/Research/Papers/Mendeley/Brady, McBride, McKinna/Brady, McBride, McKinna - 2003 - Inductive families need not store their indices.pdf:pdf},
44+journal = {researchmicrosoftcom},
54−keywords = {Dependent Types},
45+number = {Section 8},
55−mendeley-tags = {Dependent Types},
46+pages = {1--12},
56−title = {{Inductive families need not store their indices}},
47+title = {{Haskell for the cloud}},
57−url = {http://www.springerlink.com/index/WBXJJG717N2W3NU2.pdf},
48+url = {http://research.microsoft.com/en-us/um/people/simonpj/papers/parallel/remote.pdf},
58−year = {2003}
49+year = {2011}
60−@misc{TheMendeleySupportTeam2011,
51+@misc{TheMendeleySupportTeam2011a,
61abstract = {A quick introduction to Mendeley. Learn how Mendeley creates your personal digital library, how to organize and annotate documents, how to collaborate and share with colleagues, and how to generate citations and bibliographies.},
52abstract = {A quick introduction to Mendeley. Learn how Mendeley creates your personal digital library, how to organize and annotate documents, how to collaborate and share with colleagues, and how to generate citations and bibliographies.},
62address = {London},
53address = {London},
63author = {{The Mendeley Support Team}},
54author = {{The Mendeley Support Team}},
@@ -70,684 +61,765 @@ title = {{Getting Started with Mendeley}},
70url = {http://www.mendeley.com},
61url = {http://www.mendeley.com},
71year = {2011}
62year = {2011}
73−@inproceedings{Wadler1989,
64+@article{Jones1999,
74−abstract = {From the type of a polymorphic function we can derive a theorem that it satisfies. Every function of the same type satisfies the same theorem. This provides a free source of useful theorems, courtesy of Reynolds' abstraction theorem for the polymorphic lambda calculus.},
65+abstract = {Haskell benefits from a sophisticated type system, but implementors, programmers, and researchers suffer because it has no formal description. To remedy this shortcoming, we present a Haskell program that implements a Haskell typechecker, thus providing a mathematically rigorous specification in a notation that is familiar to Haskell users. We expect this program to fill a serious gap in current descriptions of Haskell, both as a starting point for discussions about existing features of the type system, and as a platform from which to explore new proposals.},
75−author = {Wadler, Philip},
66+author = {Jones, Mark P},
76−booktitle = {Proceedings of the fourth international conference on Functional programming languages and computer architecture},
67+journal = {October},
77−doi = {10.1145/99370.99404},
78−file = {:home/edwin/Research/Papers/Mendeley/Wadler/Wadler - 1989 - Theorems for free!.pdf:pdf},
84−title = {{Theorems for free!}},
85−url = {http://portal.acm.org/citation.cfm?id=99404},
88−@phdthesis{norell2007thesis,
89−author = {Norell, Ulf},
90−file = {:home/edwin/Research/Papers/Mendeley/Norell/Norell - 2007 - Towards a practical programming language based on dependent type theory.pdf:pdf},
91−keywords = {Dependent Types},
92−mendeley-tags = {Dependent Types},
93publisher = {Citeseer},
68publisher = {Citeseer},
94−school = {Chalmers University of Technology},
69+title = {{Typing Haskell in Haskell}},
95−title = {{Towards a practical programming language based on dependent type theory}},
96−url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.65.7934&rep=rep1&type=pdf},
70+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.134.7274&rep=rep1&type=pdf},
97−year = {2007}
71+year = {1999}
100−author = {L\"{a}mmel, R. and Jones, S.P.},
101−booktitle = {ACM SIGPLAN Notices},
102−file = {:home/edwin/Research/Papers/Mendeley/L\"{a}mmel, Jones/L\"{a}mmel, Jones - 2003 - Scrap your boilerplate a practical design pattern for generic programming.pdf:pdf},
106−title = {{Scrap your boilerplate: a practical design pattern for generic programming}},
107−url = {http://dl.acm.org/citation.cfm?id=640136.604179},
111−@inproceedings{Xi1999,
73+@article{Xi1998,
112−abstract = {Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.},
74+abstract = {We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables the programmer to capture more invariants through types while type-checking remains decidable in theory and can still be performed efficiently in practice. We illustrate our approach through concrete examples and present the result of our preliminary experiments which support support the feasibility and effectiveness of our approach.},
113author = {Xi, Hongwei and Pfenning, Frank},
75author = {Xi, Hongwei and Pfenning, Frank},
114−booktitle = {Proceedings of the 26th ACM SIGPLANSIGACT symposium on Principles of programming languages POPL 99},
115−doi = {10.1145/292540.292560},
76+doi = {10.1145/277652.277732},
116−file = {:home/edwin/Research/Papers/Mendeley/Xi, Pfenning/Xi, Pfenning - 1999 - Dependent types in practical programming.pdf:pdf},
77+file = {:home/edwin/Research/Papers/Mendeley/Xi, Pfenning/Xi, Pfenning - 1998 - Eliminating array bound checking through dependent types.pdf:pdf},
117−isbn = {1581130953},
78+isbn = {0897919874},
118−issn = {07439016},
79+issn = {03621340},
80+journal = {ACM Sigplan Notices},
119keywords = {Dependent Types},
81keywords = {Dependent Types},
120mendeley-tags = {Dependent Types},
82mendeley-tags = {Dependent Types},
121−organization = {Carnegie Mellon University},
83+number = {5},
122−pages = {214--227},
84+pages = {249--257},
123−publisher = {ACM Press},
85+publisher = {ACM},
124−series = {POPL '99},
86+series = {PLDI '98},
125−title = {{Dependent types in practical programming}},
87+title = {{Eliminating array bound checking through dependent types}},
126−url = {http://portal.acm.org/citation.cfm?doid=292540.292560},
88+url = {http://portal.acm.org/citation.cfm?doid=277652.277732},
127−volume = {26},
89+volume = {33},
128−year = {1999}
90+year = {1998}
130−@inproceedings{morris2006exploring,
131−author = {Morris, P. and Altenkirch, T. and McBride, C.},
132−booktitle = {Types for Proofs and Programs},
133−file = {:home/edwin/Research/Papers/Mendeley/Morris, Altenkirch, McBride/Morris, Altenkirch, McBride - 2006 - Exploring the regular tree types.pdf:pdf},
135−publisher = {Springer},
136−title = {{Exploring the regular tree types}},
137−url = {http://www.springerlink.com/index/f9p1317716614834.pdf},
140−@book{Approach2012,
92+@book{The2012,
141author = {Hunt, Andrew and Thomas, David},
93author = {Hunt, Andrew and Thomas, David},
142booktitle = {Carcinogenesis},
94booktitle = {Carcinogenesis},
143doi = {10.1093/carcin/bgs054},
95doi = {10.1093/carcin/bgs054},
144−file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 2.pdf:pdf},
96+file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 3.pdf:pdf},
145isbn = {020161622X},
97isbn = {020161622X},
146issn = {1460-2180},
98issn = {1460-2180},
147number = {3},
99number = {3},
148pmid = {22383472},
100pmid = {22383472},
149−title = {{The Pragmatic Programmer Chapter 2}},
101+title = {{The Pragmatic Programmer Chapter 3}},
150url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
102url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
151volume = {33}
103volume = {33}
153−@article{Miller1992,
105+@article{danielsson2011parsing,
154−author = {Miller, Dale},
106+author = {Danielsson, N. and Norell, U.},
155−file = {:home/edwin/Research/Papers/Mendeley/Miller/Miller - 1992 - Unification under a mixed prefix.pdf:pdf},
107+journal = {Implementation and Application of Functional Languages},
156−journal = {Journal of Symbolic Computation},
108+pages = {80--99},
157−title = {{Unification under a mixed prefix}},
109+publisher = {Springer},
158−url = {http://www.sciencedirect.com/science/article/pii/074771719290011R},
110+title = {{Parsing mixfix operators}},
159−year = {1992}
111+url = {http://www.springerlink.com/index/386243257W504252.pdf},
161−@misc{Interface2012a,
162−author = {Kreibich, Jay A.},
163−doi = {10.1093/epirev/mxr031},
164−file = {:home/edwin/Research/Papers/Mendeley/Kreibich/Kreibich - Unknown - Using SQLite Chapter 7.pdf:pdf},
165−isbn = {9781449394592},
168−title = {{Using SQLite Chapter 7}}
170−@inproceedings{chlipala2010ur,
171−author = {Chlipala, Adam},
172−booktitle = {ACM SIGPLAN Notices},
173−file = {:home/edwin/Research/Papers/Mendeley/Chlipala/Chlipala - 2010 - Ur statically-typed metaprogramming with type-level record computation.pdf:pdf},
177−title = {{Ur: statically-typed metaprogramming with type-level record computation}},
178−url = {http://dl.acm.org/citation.cfm?id=1806612},
180−year = {2010}
112+year = {2011}
182−@book{peyton1987implementation,
183−author = {{Peyton Jones}, S.L.},
184−publisher = {Prentice-Hall, Inc.},
185−title = {{The implementation of functional programming languages (prentice-hall international series in computer science)}},
186−url = {http://dl.acm.org/citation.cfm?id=1096899},
189−@article{dybjer1994inductive,
114+@misc{Bove2008,
190−author = {Dybjer, P.},
115+abstract = {In these lecture notes we give an introduction to functional programming with dependent types. We use the dependently typed programming language Agda which is based on ideas in Martin-L\"{o}f type theory and Martin-L\"{o}fs logical framework. We begin by showing how to do simply typed functional programming, and discuss the differences between Agdas type system and the Hindley-Milner type system, which underlies mainstream typed functional programming languages like Haskell and ML. We then show how to employ dependent types for programming with functional data structures such as vectors and binary search trees. We go on to explain the Curry-Howard identification of propositions and types, and how it makes Agda not only a programming language but also a programming logic. According to Curry-Howard, we also identify programs and proofs, something which is possible only by requiring that all program terminate. However, we show in the final section a method for encoding general and possibly partial recursive functions as total functions using dependent types.},
191−journal = {Formal aspects of computing},
116+author = {Bove, Ana and Dybjer, Peter},
118+doi = {10.1007/978-3-642-03153-3_2},
119+file = {:home/edwin/Research/Papers/Mendeley/Bove, Dybjer/Bove, Dybjer - 2008 - Dependent Types at Work.pdf:pdf},
192−number = {4},
120+number = {February},
193−pages = {440--465},
121+pages = {57--99},
194publisher = {Springer},
122publisher = {Springer},
195−title = {{Inductive families}},
123+title = {{Dependent Types at Work}},
196−url = {http://www.springerlink.com/index/J17824H467X6J288.pdf},
124+url = {http://www.springerlink.com/index/1039q8qk71257677.pdf},
197−volume = {6},
125+volume = {5520},
130+publisher = {Oxford University Press, Inc.},
131+title = {{Computation and reasoning: a type theory for computer science}},
132+url = {http://dl.acm.org/citation.cfm?id=SERIES9893.184757},
198year = {1994}
133year = {1994}
136+author = {Brady, Edwin},
137+file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2012 - Programming in Idris a tutorial.pdf:pdf},
138+title = {{Programming in Idris : a tutorial}},
139+url = {http://idris-lang.org/tutorial},
200−@inproceedings{lempsink2009type,
142+@inproceedings{madhavapeddy2007melange,
201−author = {Lempsink, E. and Leather, S. and L\"{o}h, A.},
143+author = {Madhavapeddy, A. and Ho, A. and Deegan, T. and Scott, D. and Sohan, R.},
202−booktitle = {Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming},
144+booktitle = {ACM SIGOPS Operating Systems Review},
203−file = {:home/edwin/Research/Papers/Mendeley/Lempsink, Leather, L\"{o}h/Lempsink, Leather, L\"{o}h - 2009 - Type-safe diff for families of datatypes.pdf:pdf},
145+file = {:home/edwin/Research/Papers/Mendeley/Madhavapeddy et al/Madhavapeddy et al. - 2007 - Melange creating a functional internet.pdf:pdf},
204−pages = {61--72},
147+pages = {101--114},
205publisher = {ACM},
148publisher = {ACM},
206−title = {{Type-safe diff for families of datatypes}},
149+title = {{Melange: creating a functional internet}},
207−url = {http://dl.acm.org/citation.cfm?id=1596624},
150+url = {http://dl.acm.org/citation.cfm?id=1273009},
208−year = {2009}
152+year = {2007}
210−@misc{The2012b,
154+@inproceedings{ko2011modularising,
211−author = {Brooks, Fred},
155+author = {Ko, H.S. and Gibbons, J.},
212−doi = {10.1093/epirev/mxr031},
156+booktitle = {Proceedings of the seventh ACM SIGPLAN workshop on Generic programming},
213−file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 1.pdf:pdf},
157+file = {:home/edwin/Research/Papers/Mendeley/Ko, Gibbons/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
214−isbn = {9780321702081},
158+pages = {13--24},
215−issn = {1478-6729},
159+publisher = {ACM},
216−pmid = {22215642},
160+title = {{Modularising inductive families}},
217−title = {{The Design of Design Chapter 1}}
161+url = {http://www.cs.ox.ac.uk/publications/publication5008-abstract.html http://dl.acm.org/citation.cfm?id=2036921},
219−@misc{The2012c,
164+@book{Cryptography2012,
220−author = {Robbins, A and Hannah, E and Lamb, L},
165+author = {Anderson, Ross},
221−doi = {10.1093/epirev/mxr031},
166+doi = {10.1093/intimm/dxs023},
222−file = {:home/edwin/Research/Papers/Mendeley/Robbins, Hannah, Lamb/Robbins, Hannah, Lamb - Unknown - Learning the vi and Vim Editors.pdf:pdf},
167+file = {:home/edwin/Research/Papers/Mendeley/Anderson/Anderson - Unknown - Security Engineering Chapter 5.pdf:pdf},
223−isbn = {9780596529833},
168+isbn = {9780470068526},
224−issn = {1478-6729},
169+issn = {1460-2377},
225−pmid = {22215642},
170+month = apr,
226−title = {{Learning the vi and Vim Editors}}
171+number = {4},
173+title = {{Security Engineering Chapter 5}},
174+url = {http://www.ncbi.nlm.nih.gov/pubmed/22451589},
228−@book{Brady2012,
177+@inproceedings{Augustsson1998,
178+abstract = {Cayenne is a Haskell-like language. The main difference between Haskell and Cayenne is that Cayenne has dependent types, i.e., the result type of a function may depend on the argument value , and types of record components (which can be types or values) may depend on other components. Cayenne also combines the syntactic categories for value expressions and type expressions; thus reducing the number of language concepts. Having dependent types and combined type and value expressions makes the language very powerful. It is powerful enough that a special module concept is unnecessary; ordinary records suffice. It is also powerful enough to encode predicate logic at the type level, allowing types to be used as specifications of programs. However, this power comes at a cost: type checking of Cayenne is undecidable. While this may appear to be a steep price to pay, it seems to work well in practice.},
179+author = {Augustsson, Lennart},
180+booktitle = {International Conference on Functional Programming},
181+doi = {10.1097/MEG.0b013e328342f213},
182+file = {:home/edwin/Research/Papers/Mendeley/Augustsson/Augustsson - 1998 - Cayenne - a language with dependent types.pdf:pdf},
184+keywords = {Depe,Dependent Types},
185+mendeley-tags = {Depe,Dependent Types},
189+publisher = {ACM Press},
190+title = {{Cayenne - a language with dependent types}},
191+url = {http://www.cs.chalmers.se/$\sim$augustss/cayenne/paper.ps},
195+@inproceedings{Altenkirch2010,
196+abstract = {The recent success of languages like Agda and Coq demonstrates the potential of using dependent types for programming. These systems rely on many high-level features like datatype definitions, pattern matching and implicit arguments to facilitate the use of the languages. However, these features complicate the metatheoretical study and are a potential source of bugs. To address these issues we introduce $\Pi$$\Sigma$, a dependently typed core language. It is small enough for metatheoretical study and the type checker is small enough to be formally verified. In this language there is only one mechanism for recursionused for types, functions and infinite objectsand an explicit mechanism to control unfolding, based on lifted types. Furthermore structural equality is used consistently for values and types; this is achieved by a new notion of $\alpha$-equality for recursive definitions. We show, by translating several high-level constructions, that $\Pi$$\Sigma$ is suitable as a core language for dependently typed programming.},
197+author = {Altenkirch, Thorsten and Danielsson, Nils Anders and L\"{o}h, Andres and Oury, Nicolas},
198+booktitle = {{FLOPS 2010}},
199+doi = {10.1007/978-3-642-12251-4_5},
200+editor = {Blume, Matthias and Kobayashi, Naoki and Vidal, Germ\'{a}n},
201+file = {:home/edwin/Research/Papers/Mendeley/Altenkirch et al/Altenkirch et al. - 2010 - Dependent Types without the Sugar.pdf:pdf},
202+isbn = {9783642122507},
204+publisher = {Springer Berlin Heidelberg},
205+series = {Lecture Notes in Computer Science},
206+title = {{Dependent Types without the Sugar}},
207+url = {http://www.springerlink.com/index/91W712G2806R575H.pdf},
210+@inproceedings{brady2011epic,
211+author = {Brady, Edwin},
212+booktitle = {Trends in Functional Programming ({TFP}’11)},
213+file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2011 - Epic --- A Library for Generating Compilers.pdf:pdf},
214+title = {{Epic --- A Library for Generating Compilers}},
215+url = {http://scholar.google.co.uk/scholar?cites=2588300990390214449&as_sdt=2005&sciodt=0,5&hl=en#1},
219+author = {Bertot, Yves and Cast\'{e}ran, Pierre},
220+publisher = {Springer},
221+title = {{Interactive theorem proving and program development: {Coq'Art}: the {Calculus of Inductive Constructions}}},
222+url = {http://books.google.co.uk/books?hl=en&lr=&id=m5w5PRj5Nj4C&oi=fnd&pg=PA1&dq=coq+theorem+prover&ots=VHny1IYV0h&sig=-K0FC67cdkhMDkAocFla8cZyRT4},
225+@inproceedings{ko2011modularising,
226+author = {Ko, H.S. and Gibbons, J.},
227+booktitle = {Proceedings of the seventh ACM SIGPLAN workshop on Generic programming},
230+title = {{Modularising inductive families}},
231+url = {http://dl.acm.org/citation.cfm?id=2036921},
234+@misc{altenkirch2008nσ,
235+author = {Altenkirch, T. and Oury, N.},
236+file = {:home/edwin/Research/Papers/Mendeley/Altenkirch, Oury/Altenkirch, Oury - 2008 - $Pi$$Sigma$ A Core Language for Dependently Typed Programming.pdf:pdf},
237+title = {{$\Pi$$\Sigma$: A Core Language for Dependently Typed Programming}},
238+url = {http://verse.aasemoon.com/images/6/6f/PiSigma.pdf},
241+@inproceedings{taha1997multi,
242+author = {Taha, W. and Sheard, T.},
243+booktitle = {ACM SIGPLAN Notices},
247+title = {{Multi-stage programming with explicit annotations}},
248+url = {http://dl.acm.org/citation.cfm?id=259019},
253+author = {Hunt, Andrew and Thomas, David},
254+booktitle = {Design},
255+file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 4.pdf:pdf},
257+title = {{The Pragmatic Programmer Chapter 4}}
259+@inproceedings{bradyresource,
260+author = {Brady, Edwin and Hammond, Kevin},
261+booktitle = {Practical Applications of Declarative Languages ({PADL} 2012)},
262+file = {:home/edwin/Research/Papers/Mendeley/Brady, Hammond/Brady, Hammond - 2012 - Resource-safe Systems Programming with Embedded Domain Specific Languages.pdf:pdf},
263+pages = {242----257},
264+title = {{Resource-safe Systems Programming with Embedded Domain Specific Languages}},
265+url = {http://www.cs.st-andrews.ac.uk/$\sim$eb/drafts/dsl-idris.pdf},
268+@article{McBride2007,
269+author = {McBride, Conor and Paterson, Ross},
270+file = {:home/edwin/Research/Papers/Mendeley/McBride, Paterson/McBride, Paterson - 2007 - Applicative programming with effects.pdf:pdf},
271+journal = {Journal of functional programming},
272+title = {{Applicative programming with effects}},
273+url = {http://journals.cambridge.org/abstract_S0956796807006326},
276+@article{fisher2006next,
277+author = {Fisher, K. and Mandelbaum, Y. and Walker, D.},
278+file = {:home/edwin/Research/Papers/Mendeley/Fisher, Mandelbaum, Walker/Fisher, Mandelbaum, Walker - 2010 - The next 700 data description languages.pdf:pdf},
279+journal = {Journal of the ACM},
283+title = {{The next 700 data description languages}},
284+url = {http://dl.acm.org/citation.cfm?id=1111039},
289+author = {Bird, Richard},
290+file = {:home/edwin/Research/Papers/Mendeley/Bird/Bird - 2010 - Pearls of Functional Algorithm Design.pdf:pdf},
291+isbn = {9780521513388},
292+title = {{Pearls of Functional Algorithm Design}},
295+@inproceedings{stump2010resource,
296+author = {Stump, A. and Austin, E.},
297+booktitle = {Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification},
298+file = {:home/edwin/Research/Papers/Mendeley/Stump, Austin/Stump, Austin - 2010 - Resource typing in Guru.pdf:pdf},
301+title = {{Resource typing in Guru}},
302+url = {http://dl.acm.org/citation.cfm?id=1707796},
305+@inproceedings{barras2008implicit,
306+author = {Barras, B. and Bernardo, B.},
307+booktitle = {Foundations of Software Science and Computational Structures},
308+file = {:home/edwin/Research/Papers/Mendeley/Barras, Bernardo/Barras, Bernardo - 2008 - The implicit calculus of constructions as a programming language with dependent types.pdf:pdf},
310+publisher = {Springer},
311+title = {{The implicit calculus of constructions as a programming language with dependent types}},
312+url = {http://www.springerlink.com/index/m84h82904546l265.pdf},
316+abstract = {The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modification of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.},
317+author = {Wadler, Philip},
318+doi = {10.1007/3-540-59451-5_2},
319+editor = {Jeuring, Johan and Meijer, Erik},
320+file = {:home/edwin/Research/Papers/Mendeley/Wadler/Wadler - 2001 - Monads for functional programming.pdf:pdf},
323+journal = {Advanced Functional Programming},
324+number = {August 1992},
326+publisher = {Springer},
327+series = {Lecture Notes in Computer Science},
328+title = {{Monads for functional programming}},
329+url = {http://www.springerlink.com/index/715264614rh13340.pdf},
333+@inproceedings{Fournet2011,
334+author = {Fournet, Cedric and Bhargavan, Karthikeyan and Gordon, Andrew D},
335+booktitle = {Foundations of security analysis and design {VI}},
336+file = {:home/edwin/Research/Papers/Mendeley/Fournet, Bhargavan, Gordon/Fournet, Bhargavan, Gordon - 2010 - Cryptographic verification by typing for a sample protocol implementation.pdf:pdf},
337+title = {{Cryptographic verification by typing for a sample protocol implementation}},
338+url = {http://www.springerlink.com/index/V168041M46658R73.pdf},
342+abstract = {This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When combined with a development of Dijkstra's guarded command, these concepts are surprisingly versatile. Their use is illustrated by sample solutions of a variety of a familiar programming exercises.},
343+author = {Hoare, C A R},
344+doi = {10.1016/0167-6423(87)90028-1},
345+editor = {McKeag, R M and Macnaghten, A M},
346+file = {:home/edwin/Research/Papers/Mendeley/Hoare/Hoare - 1978 - Communicating sequential processes.pdf:pdf},
349+journal = {Communications of the ACM},
352+pmid = {2142694823583477576},
354+series = {International Series in Computer Science},
355+title = {{Communicating sequential processes}},
356+url = {http://linkinghub.elsevier.com/retrieve/pii/0167642387900281},
229author = {Hunt, Andrew and Thomas, David},
361author = {Hunt, Andrew and Thomas, David},
230booktitle = {Carcinogenesis},
362booktitle = {Carcinogenesis},
231doi = {10.1093/carcin/bgs054},
363doi = {10.1093/carcin/bgs054},
232−file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 5.pdf:pdf},
364+file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 6.pdf:pdf},
233isbn = {020161622X},
365isbn = {020161622X},
234issn = {1460-2180},
366issn = {1460-2180},
235number = {3},
367number = {3},
236pmid = {22383472},
368pmid = {22383472},
237−title = {{The Pragmatic Programmer Chapter 5}},
369+title = {{The Pragmatic Programmer Chapter 6}},
238url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
370url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
239volume = {33}
371volume = {33}
241−@inproceedings{Pasalic2002,
373+@inproceedings{Brady2010,
242−author = {Pa\v{s}alic, Emir and Taha, Walid and Sheard, Tim},
374+author = {Brady, Edwin and Hammond, Kevin},
243−booktitle = {International Conference on Functional Programming},
375+booktitle = {Proceedings of the 15th ACM SIGPLAN international conference on Functional programming},
244−doi = {10.1145/583852.581499},
376+file = {:home/edwin/Research/Papers/Mendeley/Brady, Hammond/Brady, Hammond - 2010 - Scrapping your inefficient engine using partial evaluation to improve domain-specific language implementation.pdf:pdf},
245−file = {:home/edwin/Research/Papers/Mendeley/Pa\v{s}alic, Taha, Sheard/Pa\v{s}alic, Taha, Sheard - 2002 - Tagless staged interpreters for typed languages.pdf:pdf},
377+isbn = {9781605587943},
246−isbn = {1-58113-487-8},
378+keywords = {Dependent Types,code generation gives,contrast,dependent types,efficient,harder,however,implementation,likely efficient,ness interpreter,partial evaluation,resulting implementation,un,verify its correctness},
247−issn = {03621340},
379+mendeley-tags = {Dependent Types},
248−keywords = {calculus of constructions,definitional interpreters,domain-specific languages,multi-stage programming},
251−pages = {218--229},
380+pages = {297--308},
252−title = {{Tagless staged interpreters for typed languages}},
381+publisher = {ACM},
382+title = {{Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation}},
253−url = {http://dl.acm.org/citation.cfm?id=583852.581499},
383+url = {http://portal.acm.org/citation.cfm?id=1863587},
255−year = {2002}
384+year = {2010}
257−@misc{Nodes2012a,
386+@inproceedings{Visser2008,
387+author = {Visser, E},
388+booktitle = {Generative and Transformational Techniques in Software Engineering},
389+title = {{WebDSL: A case study in domain-specific language engineering}},
390+url = {http://www.springerlink.com/index/A3213003X6268032.pdf},
393+@inproceedings{Brady2005a,
394+author = {Brady, E and Hammond, K},
395+booktitle = {Implementation and Application of Functional \ldots},
396+file = {:home/edwin/Research/Papers/Mendeley/Brady, Hammond/Brady, Hammond - 2005 - A dependently typed framework for static analysis of program execution costs.pdf:pdf},
397+keywords = {Dependent Types},
398+mendeley-tags = {Dependent Types},
399+title = {{A dependently typed framework for static analysis of program execution costs}},
400+url = {http://www.springerlink.com/index/P446P2HH70107759.pdf},
403+@inproceedings{madhavapeddy2010turning,
404+author = {Madhavapeddy, A. and Mortier, R. and Sohan, R. and Gazagnaire, T. and Hand, S. and Deegan, T. and McAuley, D. and Crowcroft, J.},
405+booktitle = {Proceedings of the 2nd USENIX conference on Hot topics in cloud computing},
406+file = {:home/edwin/Research/Papers/Mendeley/Madhavapeddy et al/Madhavapeddy et al. - 2010 - Turning down the LAMP software specialisation for the cloud.pdf:pdf},
407+publisher = {USENIX Association},
408+title = {{Turning down the LAMP: software specialisation for the cloud}},
409+url = {http://dl.acm.org/citation.cfm?id=1863114},
412+@inproceedings{bhargavan2010modular,
413+author = {Bhargavan, K. and Fournet, C. and Gordon, A.D.},
414+booktitle = {ACM Sigplan Notices},
418+title = {{Modular verification of security protocol code by typing}},
419+url = {http://dl.acm.org/citation.cfm?id=1707801.1706350},
423+@book{Philosophy2012,
424+author = {Hunt, Andrew and Thomas, David},
425+booktitle = {Carcinogenesis},
426+doi = {10.1093/carcin/bgs054},
427+file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 1.pdf:pdf},
432+title = {{The Pragmatic Programmer Chapter 1}},
433+url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
436+@inproceedings{coquand1986analysis,
437+author = {Coquand, T.},
438+booktitle = {{Proceedings of the First IEEE Symposium on Logic in Computer Science}},
439+file = {:home/edwin/Research/Papers/Mendeley/Coquand/Coquand - 1986 - An analysis of Girard's paradox.pdf:pdf},
440+pages = {227----246},
441+title = {{An analysis of Girard's paradox}},
442+url = {http://hal.inria.fr/docs/00/07/60/23/PDF/RR-0531.pdf},
445+@inproceedings{Augustsson1985,
446+address = {Berlin, Heidelberg},
447+author = {Augustsson, Lennart},
448+booktitle = {Functional Programming Languages and Computer Architecture},
449+doi = {10.1007/3-540-15975-4},
450+editor = {Jouannaud, Jean-Pierre},
451+isbn = {978-3-540-15975-9},
452+keywords = {Computer Science},
453+pages = {368----381},
454+publisher = {Springer Berlin Heidelberg},
455+series = {Lecture Notes in Computer Science},
456+title = {{Compiling Pattern Matching}},
457+url = {http://www.springerlink.com/content/y647423656557505/},
258author = {Brooks, Fred},
462author = {Brooks, Fred},
259−doi = {10.1093/epirev/mxr031},
260−file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 3.pdf:pdf},
463+file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 4.pdf:pdf},
261isbn = {9780321702081},
464isbn = {9780321702081},
264−title = {{The Design of Design Chapter 3}}
465+title = {{The Design of Design Chapter 4}}
266−@article{Haskell2012a,
467+@misc{Brady2012c,
267−author = {Biancuzzi, F and Warden, S},
468+author = {Brooks, Fred},
268doi = {10.1093/epirev/mxr031},
469doi = {10.1093/epirev/mxr031},
269−file = {:home/edwin/Research/Papers/Mendeley/Biancuzzi, Warden/Biancuzzi, Warden - Unknown - Masterminds of Programming Chapter 8.pdf:pdf},
470+file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 5.pdf:pdf},
270−isbn = {9780596801670},
471+isbn = {9780321702081},
271issn = {1478-6729},
472issn = {1478-6729},
272pmid = {22215642},
475pmid = {22215642},
273−title = {{Masterminds of Programming Chapter 8}}
476+title = {{The Design of Design Chapter 5}},
275−@book{An2012,
479+@book{Choosing2012,
276author = {Fowler, Martin},
480author = {Fowler, Martin},
277booktitle = {Carcinogenesis},
481booktitle = {Carcinogenesis},
278doi = {10.1093/carcin/bgs054},
482doi = {10.1093/carcin/bgs054},
279−file = {:home/edwin/Research/Papers/Mendeley/Fowler/Fowler - Unknown - Domain Specific Languages Chapter 1.pdf:pdf},
483+file = {:home/edwin/Research/Papers/Mendeley/Fowler/Fowler - Unknown - Domain Specific Languages Chapter 6.pdf:pdf},
280isbn = {9780132107549},
484isbn = {9780132107549},
281issn = {1460-2180},
485issn = {1460-2180},
282number = {3},
486number = {3},
283pmid = {22383472},
487pmid = {22383472},
284−title = {{Domain Specific Languages Chapter 1}},
488+title = {{Domain Specific Languages Chapter 6}},
285url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
489url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
286volume = {33}
490volume = {33}
288−@article{McBride2002,
492+@article{mcbride2008functional,
289−author = {McBride, C},
493+author = {McBride, C. and Paterson, R.},
290−journal = {Types for proofs and programs},
494+file = {:home/edwin/Research/Papers/Mendeley/McBride, Paterson/McBride, Paterson - 2008 - Functional pearl Applicative programming with effects.pdf:pdf},
291−title = {{Elimination with a Motive}},
495+journal = {Journal of functional programming},
292−url = {http://www.springerlink.com/index/vbpg19305t46f6dm.pdf},
496+number = {1},
295−@article{McBride2005,
296−author = {McBride, Conor},
297−editor = {Vene, Varmo and Uustalu, Tarmo},
299−journal = {Advanced Functional Programming},
300−keywords = {Dependent Types},
301−mendeley-tags = {Dependent Types},
302−pages = {130--170},
497+pages = {1--13},
303−publisher = {Springer},
498+publisher = {Cambridge Univ Press},
304−series = {Lecture Notes in Computer Science},
499+title = {{Functional pearl: Applicative programming with effects}},
305−title = {{Epigram: Practical programming with dependent types}},
500+url = {http://journals.cambridge.org/production/action/cjoGetFulltext?fulltextid=1457860},
306−url = {http://www.springerlink.com/index/96j7v5vn8tyebeky.pdf},
307−volume = {3622},
501+volume = {18},
308−year = {2005}
502+year = {2008}
310−@misc{Resolution2012a,
504+@inproceedings{pollack1990implicit,
311−author = {Fall, Kevin R and Stevens, W. Richard},
505+author = {Pollack, R.},
312−doi = {10.1093/epirev/mxr031},
506+booktitle = {Informal Proceedings of First Workshop on Logical Frameworks, Antibes},
313−file = {:home/edwin/Research/Papers/Mendeley/Fall, Stevens/Fall, Stevens - Unknown - TCPIP Illustrated Volume 1 Chapter 11.pdf:pdf},
507+file = {:home/edwin/Research/Papers/Mendeley/Pollack/Pollack - 1990 - Implicit syntax.pdf:pdf},
314−issn = {1478-6729},
508+publisher = {Citeseer},
315−pmid = {22215642},
509+title = {{Implicit syntax}},
316−title = {{TCP/IP Illustrated Volume 1 Chapter 11}}
510+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.7361&rep=rep1&type=pdf},
318−@phdthesis{Brady2005,
513+@inproceedings{oury2008power,
319−author = {Brady, Edwin},
514+author = {Oury, N. and Swierstra, W.},
515+booktitle = {International Conference on Functional Programming},
320−file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2005 - Practical Implementation of a Dependently Typed Functional Programming Language.pdf:pdf},
516+file = {:home/edwin/Research/Papers/Mendeley/Oury, Swierstra/Oury, Swierstra - 2008 - The power of Pi.pdf:pdf},
321keywords = {Dependent Types},
517keywords = {Dependent Types},
322mendeley-tags = {Dependent Types},
518mendeley-tags = {Dependent Types},
323−school = {University of Durham},
324−title = {{Practical Implementation of a Dependently Typed Functional Programming Language}},
325−url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.150.8284&rep=rep1&type=pdf},
328−@inproceedings{Brady2011a,
329−address = {New York, New York, USA},
330−author = {Brady, Edwin},
331−booktitle = {Proceedings of the 5th {ACM} workshop on Programming languages meets program verification - {PLPV} '11},
332−doi = {10.1145/1929529.1929536},
333−file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2011 - Idris --- Systems Programming Meets Full Dependent Types.pdf:pdf},
334−isbn = {9781450304870},
335−keywords = {Dependent Types,data description,dependent types},
336−mendeley-tags = {Dependent Types},
338−publisher = {ACM Press},
339−title = {{Idris --- Systems Programming Meets Full Dependent Types}},
340−url = {http://dl.acm.org/citation.cfm?id=1929529.1929536},
343−@misc{dagand2011transporting,
344−author = {Dagand, Pierre-Evariste and McBride, Conor},
345−file = {:home/edwin/Research/Papers/Mendeley/Dagand, McBride/Dagand, McBride - 2011 - Transporting Functions across Ornaments.pdf:pdf},
346−title = {{Transporting Functions across Ornaments}},
347−url = {http://personal.cis.strath.ac.uk/$\sim$dagand/stuffs/paper-2011-patch/paper.pdf},
350−@inproceedings{taha2004gentle,
352−booktitle = {Domain-Specific Program Generation},
354−publisher = {Springer},
355−title = {{A gentle introduction to multi-stage programming}},
356−url = {http://www.springerlink.com/index/JEMT0D8VYN5JB2L8.pdf},
359−@inproceedings{augustsson2008paradise,
360−author = {Augustsson, L. and Mansell, H. and Sittampalam, G.},
361−booktitle = {International Conference on Functional Programming},
362−file = {:home/edwin/Research/Papers/Mendeley/Augustsson, Mansell, Sittampalam/Augustsson, Mansell, Sittampalam - 2008 - Paradise a two-stage DSL embedded in Haskell.pdf:pdf},
363number = {9},
519number = {9},
364−pages = {225--228},
520+pages = {39--50},
365publisher = {ACM},
521publisher = {ACM},
366−title = {{Paradise: a two-stage DSL embedded in Haskell}},
522+title = {{The power of Pi}},
367−url = {http://dl.acm.org/citation.cfm?id=1411203.1411236},
523+url = {http://dl.acm.org/citation.cfm?id=1411213},
368volume = {43},
524volume = {43},
369year = {2008}
525year = {2008}
371−@misc{altenkirch2005dependent,
527+@article{gordon2003authenticity,
372−author = {Altenkirch, T. and McBride, C. and McKinna, J.},
528+author = {Gordon, A.D. and Jeffrey, A.},
373−booktitle = {Manuscript, available online},
529+file = {:home/edwin/Research/Papers/Mendeley/Gordon, Jeffrey/Gordon, Jeffrey - 2003 - Authenticity by typing for security protocols.pdf:pdf},
374−file = {:home/edwin/Research/Papers/Mendeley/Altenkirch, McBride, McKinna/Altenkirch, McBride, McKinna - 2005 - Why dependent types matter.pdf:pdf},
375−title = {{Why dependent types matter}},
376−url = {http://www.cs.nott.ac.uk/$\sim$txa/talks/splst11.pdf},
380−abstract = {We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This enables the programmer to capture more invariants through types while type-checking remains decidable in theory and can still be performed efficiently in practice. We illustrate our approach through concrete examples and present the result of our preliminary experiments which support support the feasibility and effectiveness of our approach.},
381−author = {Xi, Hongwei and Pfenning, Frank},
382−doi = {10.1145/277652.277732},
383−file = {:home/edwin/Research/Papers/Mendeley/Xi, Pfenning/Xi, Pfenning - 1998 - Eliminating array bound checking through dependent types.pdf:pdf},
386−journal = {ACM Sigplan Notices},
387−keywords = {Dependent Types},
388−mendeley-tags = {Dependent Types},
393−title = {{Eliminating array bound checking through dependent types}},
394−url = {http://portal.acm.org/citation.cfm?doid=277652.277732},
398−@inproceedings{augustsson1999exercise,
399−author = {Augustsson, L. and Carlsson, M.},
400−booktitle = {In Workshop on Dependent Types in Programming, Gothenburg},
402−mendeley-tags = {Depe},
403−publisher = {Citeseer},
404−title = {{An exercise in dependent types: A well-typed interpreter}},
405−url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.2895},
408−@article{Swierstra2011,
409−author = {Swierstra, W},
410−file = {:home/edwin/Research/Papers/Mendeley/Swierstra/Swierstra - 2011 - Sorted Verifying the Problem of the {Dutch National} Flag in {Agda}.pdf:pdf},
411−journal = {Journal of Functional Programming},
530+journal = {Journal of computer security},
412−number = {6},
531+number = {4},
413−pages = {575----583},
532+pages = {451--520},
414−title = {{Sorted: Verifying the Problem of the {Dutch National} Flag in {Agda}}},
533+publisher = {IOS Press},
415−url = {http://journals.cambridge.org/abstract_S0956796811000207},
534+title = {{Authenticity by typing for security protocols}},
535+url = {http://iospress.metapress.com/index/BHQQUFRA1C7W8TLY.pdf},
416−volume = {21},
536+volume = {11},
417−year = {2011}
537+year = {2003}
419−@inproceedings{norell2009dependently,
539+@misc{pollack1997believe,
420−author = {Norell, Ulf},
540+author = {Pollack, R.},
421−booktitle = {Advanced Functional Programming},
422−file = {:home/edwin/Research/Papers/Mendeley/Norell/Norell - 2009 - Dependently typed programming in Agda.pdf:pdf},
541+file = {:home/edwin/Research/Papers/Mendeley/Pollack/Pollack - 1997 - How to believe a machine-checked proof.pdf:pdf},
423−keywords = {Dependent Types},
542+title = {{How to believe a machine-checked proof}},
424−mendeley-tags = {Dependent Types},
543+url = {http://books.google.co.uk/books?hl=en&lr=&id=pLnKggT_In4C&oi=fnd&pg=PA205&dq=how+to+believe+a+machine+checked+proof&ots=c2OI8krqqA&sig=EF3QonGFVdOpYdKO1KmW6ljCkjY},
426−publisher = {Springer},
427−title = {{Dependently typed programming in Agda}},
428−url = {http://www.springerlink.com/index/8X0H38858233VN26.pdf},
429−year = {2009}
544+year = {1997}
431−@article{Mandelbaum2007,
546+@misc{Attacks2012a,
432−abstract = {Massive amounts of useful data are stored and processed in ad hoc formats for which common tools like parsers, printers, query engines and format converters are not readily available. In this paper, we explain the design and implementation of PADS/ML , a new language and system that facilitates the generation of data processing tools for ad hoc formats. The PADS/ML design includes features such as dependent, polymorphic and recursive datatypes, which allow programmers to describe the syntax and semantics of ad hoc data in a concise, easy-to-read notation. The PADS/ML implementation compiles these descriptions into ml structures and functors that include types for parsed data, functions for parsing and printing, and auxiliary support for user-specified, format-dependent and format-independent tool generation.},
547+author = {Anderson, Ross},
433−author = {Mandelbaum, Yitzhak and Fisher, Kathleen and Walker, David and Fernandez, Mary and Gleyzer, Artem},
548+doi = {10.1093/epirev/mxr031},
434−doi = {10.1145/1190215.1190231},
549+file = {:home/edwin/Research/Papers/Mendeley/Anderson/Anderson - Unknown - Security Engineering Chapter 18.pdf:pdf},
435−isbn = {1595935754},
550+isbn = {9780470068526},
436−issn = {03621340},
551+issn = {1478-6729},
437−journal = {SIGPLAN Not},
438number = {1},
552number = {1},
439−pages = {77--83},
553+pages = {NP},
440−publisher = {ACM},
554+pmid = {22215642},
441−series = {POPL '07},
555+title = {{Security Engineering Chapter 18}},
442−title = {{PADS/ML: a functional data description language}},
443−url = {http://doi.acm.org/10.1145/1190216.1190231},
444−volume = {42},
556+volume = {34}
448−author = {Abadi, Martin and Gordon, Andrew D},
449−booktitle = {4TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY},
450−file = {:home/edwin/Research/Papers/Mendeley/Abadi, Gordon/Abadi, Gordon - 1997 - A calculus for cryptographic protocols The spi calculus.pdf:pdf},
452−title = {{A calculus for cryptographic protocols: The spi calculus}},
453−url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.2176},
456−@article{Jones1999,
558+@inproceedings{atkey2009unembedding,
457−abstract = {Haskell benefits from a sophisticated type system, but implementors, programmers, and researchers suffer because it has no formal description. To remedy this shortcoming, we present a Haskell program that implements a Haskell typechecker, thus providing a mathematically rigorous specification in a notation that is familiar to Haskell users. We expect this program to fill a serious gap in current descriptions of Haskell, both as a starting point for discussions about existing features of the type system, and as a platform from which to explore new proposals.},
559+author = {Atkey, R. and Lindley, S. and Yallop, J.},
458−author = {Jones, Mark P},
560+booktitle = {Proceedings of the 2nd ACM SIGPLAN symposium on Haskell},
459−journal = {October},
561+pages = {37--48},
460−publisher = {Citeseer},
562+publisher = {ACM},
461−title = {{Typing Haskell in Haskell}},
563+title = {{Unembedding domain-specific languages}},
462−url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.134.7274&rep=rep1&type=pdf},
564+url = {http://dl.acm.org/citation.cfm?id=1596644},
463−year = {1999}
565+year = {2009}
465−@inproceedings{Altenkirch2010,
567+@article{loh2010tutorial,
466−abstract = {The recent success of languages like Agda and Coq demonstrates the potential of using dependent types for programming. These systems rely on many high-level features like datatype definitions, pattern matching and implicit arguments to facilitate the use of the languages. However, these features complicate the metatheoretical study and are a potential source of bugs. To address these issues we introduce $\Pi$$\Sigma$, a dependently typed core language. It is small enough for metatheoretical study and the type checker is small enough to be formally verified. In this language there is only one mechanism for recursionused for types, functions and infinite objectsand an explicit mechanism to control unfolding, based on lifted types. Furthermore structural equality is used consistently for values and types; this is achieved by a new notion of $\alpha$-equality for recursive definitions. We show, by translating several high-level constructions, that $\Pi$$\Sigma$ is suitable as a core language for dependently typed programming.},
568+author = {L\"{o}h, A. and McBride, C. and Swierstra, W.},
467−author = {Altenkirch, Thorsten and Danielsson, Nils Anders and L\"{o}h, Andres and Oury, Nicolas},
569+file = {:home/edwin/Research/Papers/Mendeley/L\"{o}h, McBride, Swierstra/L\"{o}h, McBride, Swierstra - 2010 - A tutorial implementation of a dependently typed lambda calculus.pdf:pdf},
468−booktitle = {{FLOPS 2010}},
570+journal = {Fundamenta Informaticae},
469−doi = {10.1007/978-3-642-12251-4_5},
571+number = {2},
470−editor = {Blume, Matthias and Kobayashi, Naoki and Vidal, Germ\'{a}n},
471−file = {:home/edwin/Research/Papers/Mendeley/Altenkirch et al/Altenkirch et al. - 2010 - Dependent Types without the Sugar.pdf:pdf},
472−isbn = {9783642122507},
473−pages = {40----55},
572+pages = {177--207},
474−publisher = {Springer Berlin Heidelberg},
573+publisher = {IOS Press},
475−series = {Lecture Notes in Computer Science},
574+title = {{A tutorial implementation of a dependently typed lambda calculus}},
476−title = {{Dependent Types without the Sugar}},
575+url = {http://iospress.metapress.com/index/976W4716TM79M6U8.pdf},
477−url = {http://www.springerlink.com/index/91W712G2806R575H.pdf},
576+volume = {102},
478year = {2010}
577year = {2010}
480−@book{Bertot2004,
579+@inproceedings{czarnecki2004dsl,
481−author = {Bertot, Yves and Cast\'{e}ran, Pierre},
580+author = {Czarnecki, K. and O’Donnell, J. and Striegnitz, J. and Taha, W.},
581+booktitle = {Domain-Specific Program Generation},
582+file = {:home/edwin/Research/Papers/Mendeley/Czarnecki et al/Czarnecki et al. - 2004 - DSL implementation in MetaOCaml, Template Haskell, and C.pdf:pdf},
482publisher = {Springer},
584publisher = {Springer},
483−title = {{Interactive theorem proving and program development: {Coq'Art}: the {Calculus of Inductive Constructions}}},
585+title = {{DSL implementation in MetaOCaml, Template Haskell, and C++}},
484−url = {http://books.google.co.uk/books?hl=en&lr=&id=m5w5PRj5Nj4C&oi=fnd&pg=PA1&dq=coq+theorem+prover&ots=VHny1IYV0h&sig=-K0FC67cdkhMDkAocFla8cZyRT4},
586+url = {http://www.springerlink.com/index/NL620EL7N94M161H.pdf},
485year = {2004}
587year = {2004}
487−@book{The2012,
589+@inproceedings{NanevskiAAMorrisett2008,
488−author = {Hunt, Andrew and Thomas, David},
590+abstract = {We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. Coq already includes a powerful functional language that supports dependent types, but that language is limited to pure, total functions. The key contribution of our extension, which we call Ynot, is the added support for computations that may have effects such as non-termination, accessing a mutable store, and throwing/catching exceptions. The axioms of Ynot form a small trusted computing base which has been formally justified in our previous work on Hoare Type Theory (HTT). We show how these axioms can be combined with the powerful type and abstraction mechanisms of Coq to build higher-level reasoning mechanisms which in turn can be used to build realistic, verified software components. To substantiate this claim, we describe here a representative series of modules that implement imperative finite maps, including support for a higher-order (effectful) iterator. The implementations range from simple (e.g., association lists) to complex (e.g., hash tables) but share a common interface which, abstracts the implementation details and ensures that the modules properly implement the finite map abstraction. Copyright 2008 ACM.},
489−booktitle = {Carcinogenesis},
591+author = {{Nanevski A A Morrisett}, G B Shinnar A B Govereau P B Birkedal L C},
490−doi = {10.1093/carcin/bgs054},
592+booktitle = {International Conference on Functional Programming},
491−file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 3.pdf:pdf},
593+doi = {10.1145/1411204.1411237},
492−isbn = {020161622X},
594+file = {:home/edwin/Research/Papers/Mendeley/Nanevski A A Morrisett/Nanevski A A Morrisett - 2008 - Ynot Dependent types for imperative programs.pdf:pdf},
493−issn = {1460-2180},
595+isbn = {9781595939197},
494−number = {3},
596+issn = {15232867},
495−pmid = {22383472},
597+keywords = {Dependent Types},
496−title = {{The Pragmatic Programmer Chapter 3}},
598+mendeley-tags = {Dependent Types},
497−url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
599+number = {9},
498−volume = {33}
600+pages = {229--240},
601+title = {{Ynot: Dependent types for imperative programs}},
602+url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67650032847&partnerID=40&md5=7a5be3083878399cebafda33b1affa6b},
500−@inproceedings{ko2011modularising,
606+@inproceedings{fisher2005pads,
501−author = {Ko, H.S. and Gibbons, J.},
607+author = {Fisher, K. and Gruber, R.},
502−booktitle = {Proceedings of the seventh ACM SIGPLAN workshop on Generic programming},
608+booktitle = {ACM SIGPLAN Notices},
503−pages = {13--24},
609+number = {6},
504publisher = {ACM},
611publisher = {ACM},
505−title = {{Modularising inductive families}},
612+title = {{PADS: a domain-specific language for processing ad hoc data}},
506−url = {http://dl.acm.org/citation.cfm?id=2036921},
613+url = {http://dl.acm.org/citation.cfm?id=1065046},
507−year = {2011}
614+volume = {40},
509−@article{danielsson2011parsing,
510−author = {Danielsson, N. and Norell, U.},
511−journal = {Implementation and Application of Functional Languages},
513−publisher = {Springer},
514−title = {{Parsing mixfix operators}},
515−url = {http://www.springerlink.com/index/386243257W504252.pdf},
519−abstract = {In these lecture notes we give an introduction to functional programming with dependent types. We use the dependently typed programming language Agda which is based on ideas in Martin-L\"{o}f type theory and Martin-L\"{o}fs logical framework. We begin by showing how to do simply typed functional programming, and discuss the differences between Agdas type system and the Hindley-Milner type system, which underlies mainstream typed functional programming languages like Haskell and ML. We then show how to employ dependent types for programming with functional data structures such as vectors and binary search trees. We go on to explain the Curry-Howard identification of propositions and types, and how it makes Agda not only a programming language but also a programming logic. According to Curry-Howard, we also identify programs and proofs, something which is possible only by requiring that all program terminate. However, we show in the final section a method for encoding general and possibly partial recursive functions as total functions using dependent types.},
520−author = {Bove, Ana and Dybjer, Peter},
522−doi = {10.1007/978-3-642-03153-3_2},
523−file = {:home/edwin/Research/Papers/Mendeley/Bove, Dybjer/Bove, Dybjer - 2008 - Dependent Types at Work.pdf:pdf},
526−publisher = {Springer},
527−title = {{Dependent Types at Work}},
528−url = {http://www.springerlink.com/index/1039q8qk71257677.pdf},
532−@book{luo1994,
617+@inproceedings{McBride2004b,
533−author = {Luo, Z.},
618+author = {McBride, Conor and McKinna, James},
534−publisher = {Oxford University Press, Inc.},
619+booktitle = {Haskell Workshop},
535−title = {{Computation and reasoning: a type theory for computer science}},
620+file = {:home/edwin/Research/Papers/Mendeley/McBride, McKinna/McBride, McKinna - 2004 - I am not a number I am a free variable.pdf:pdf},
536−url = {http://dl.acm.org/citation.cfm?id=SERIES9893.184757},
621+title = {{I am not a number : I am a free variable}},
537−year = {1994}
622+year = {2004}
539−@misc{idristutorial,
624+@article{marlow2006making,
540−author = {Brady, Edwin},
625+author = {Marlow, S. and {Peyton Jones}, S.},
541−file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2012 - Programming in Idris a tutorial.pdf:pdf},
626+file = {:home/edwin/Research/Papers/Mendeley/Marlow, Peyton Jones/Marlow, Peyton Jones - 2006 - Making a fast curry pushenter vs. evalapply for higher-order languages.pdf:pdf},
542−title = {{Programming in Idris : a tutorial}},
627+journal = {Journal of Functional Programming},
543−url = {http://idris-lang.org/tutorial},
628+number = {4-5},
544−year = {2012}
629+pages = {415--449},
630+publisher = {Cambridge University Press},
631+title = {{Making a fast curry: push/enter vs. eval/apply for higher-order languages}},
632+url = {http://dl.acm.org/citation.cfm?id=1166018},
546−@inproceedings{madhavapeddy2007melange,
636+@misc{Protocols2012a,
547−author = {Madhavapeddy, A. and Ho, A. and Deegan, T. and Scott, D. and Sohan, R.},
637+author = {Anderson, Ross},
548−booktitle = {ACM SIGOPS Operating Systems Review},
638+doi = {10.1093/epirev/mxr031},
549−file = {:home/edwin/Research/Papers/Mendeley/Madhavapeddy et al/Madhavapeddy et al. - 2007 - Melange creating a functional internet.pdf:pdf},
639+file = {:home/edwin/Research/Papers/Mendeley/Anderson/Anderson - Unknown - Security Engineering Chapter 3.pdf:pdf},
550−number = {3},
640+isbn = {9780470068526},
551−pages = {101--114},
641+issn = {1478-6729},
552−publisher = {ACM},
642+pmid = {22215642},
553−title = {{Melange: creating a functional internet}},
643+title = {{Security Engineering Chapter 3}}
554−url = {http://dl.acm.org/citation.cfm?id=1273009},
558−@inproceedings{Augustsson1998,
645+@article{McBride2006,
559−abstract = {Cayenne is a Haskell-like language. The main difference between Haskell and Cayenne is that Cayenne has dependent types, i.e., the result type of a function may depend on the argument value , and types of record components (which can be types or values) may depend on other components. Cayenne also combines the syntactic categories for value expressions and type expressions; thus reducing the number of language concepts. Having dependent types and combined type and value expressions makes the language very powerful. It is powerful enough that a special module concept is unnecessary; ordinary records suffice. It is also powerful enough to encode predicate logic at the type level, allowing types to be used as specifications of programs. However, this power comes at a cost: type checking of Cayenne is undecidable. While this may appear to be a steep price to pay, it seems to work well in practice.},
646+author = {McBride, C and Goguen, H and McKinna, J},
560−author = {Augustsson, Lennart},
647+journal = {Types for Proofs and Programs},
561−booktitle = {International Conference on Functional Programming},
648+title = {{A few constructions on constructors}},
562−doi = {10.1097/MEG.0b013e328342f213},
649+url = {http://www.springerlink.com/index/P4863U0M41396254.pdf},
563−file = {:home/edwin/Research/Papers/Mendeley/Augustsson/Augustsson - 1998 - Cayenne - a language with dependent types.pdf:pdf},
650+year = {2006}
565−keywords = {Depe,Dependent Types},
566−mendeley-tags = {Depe,Dependent Types},
570−publisher = {ACM Press},
571−title = {{Cayenne - a language with dependent types}},
572−url = {http://www.cs.chalmers.se/$\sim$augustss/cayenne/paper.ps},
576−@inproceedings{brady2011epic,
652+@article{McBride2002,
577−author = {Brady, Edwin},
653+author = {McBride, C},
578−booktitle = {Trends in Functional Programming ({TFP}’11)},
654+journal = {Types for proofs and programs},
579−file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2011 - Epic --- A Library for Generating Compilers.pdf:pdf},
655+title = {{Elimination with a Motive}},
580−title = {{Epic --- A Library for Generating Compilers}},
656+url = {http://www.springerlink.com/index/vbpg19305t46f6dm.pdf},
581−url = {http://scholar.google.co.uk/scholar?cites=2588300990390214449&as_sdt=2005&sciodt=0,5&hl=en#1},
657+year = {2000}
584−@article{Epstein2011,
659+@inproceedings{Sculthorpe2009,
585−author = {Epstein, Jeff and Black, Andrew P and Peyton-jones, Simon},
660+author = {Sculthorpe, Neil and Nilsson, Henrik},
586−institution = {Microsoft Research},
661+booktitle = {International Conference on Functional Programming ({ICFP} '09)},
587−journal = {researchmicrosoftcom},
662+file = {:home/edwin/Research/Papers/Mendeley/Sculthorpe, Nilsson/Sculthorpe, Nilsson - 2009 - Safe functional reactive programming through dependent types(2).pdf:pdf;:home/edwin/Research/Papers/Mendeley/Sculthorpe, Nilsson/Sculthorpe, Nilsson - 2009 - Safe functional reactive programming through dependent types.pdf:pdf},
588−number = {Section 8},
663+title = {{Safe functional reactive programming through dependent types}},
589−pages = {1--12},
664+url = {http://dl.acm.org/citation.cfm?id=1596558},
590−title = {{Haskell for the cloud}},
665+year = {2009}
591−url = {http://research.microsoft.com/en-us/um/people/simonpj/papers/parallel/remote.pdf},
594−@book{Hunt,
667+@book{Fowler,
595−author = {Hunt, Andrew and Thomas, David},
668+author = {Fowler, Martin},
596−booktitle = {Design},
669+booktitle = {Language},
597−file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 4.pdf:pdf},
670+file = {:home/edwin/Research/Papers/Mendeley/Fowler/Fowler - Unknown - Domain Specific Languages Chapter 2.pdf:pdf},
598−isbn = {020161622X},
671+isbn = {9780132107549},
599−title = {{The Pragmatic Programmer Chapter 4}}
672+title = {{Domain Specific Languages Chapter 2}}
601−@inproceedings{swierstra2007beauty,
674+@inproceedings{Sheard2005,
602−author = {Swierstra, W. and Altenkirch, T.},
675+address = {New York, New York, USA},
603−booktitle = {Proceedings of the ACM SIGPLAN workshop on Haskell workshop},
676+author = {Sheard, Tim},
604−file = {:home/edwin/Research/Papers/Mendeley/Swierstra, Altenkirch/Swierstra, Altenkirch - 2007 - Beauty in the beast.pdf:pdf},
677+booktitle = {Proceedings of the 2005 ACM SIGPLAN workshop on Haskell - Haskell '05},
605−pages = {25--36},
678+doi = {10.1145/1088348.1088356},
606−publisher = {ACM},
679+file = {:home/edwin/Research/Papers/Mendeley/Sheard/Sheard - 2005 - Putting curry-howard to work.pdf:pdf},
607−title = {{Beauty in the beast}},
680+isbn = {159593071X},
608−url = {http://dl.acm.org/citation.cfm?id=1291206},
681+keywords = {GADT,curry-howard isomorphism,extensional kind system,haskell,logic},
609−year = {2007}
682+month = sep,
684+publisher = {ACM Press},
685+title = {{Putting curry-howard to work}},
686+url = {http://dl.acm.org/citation.cfm?id=1088348.1088356},
611−@inproceedings{bradyresource,
689+@article{Jones2003,
612−author = {Brady, Edwin and Hammond, Kevin},
690+abstract = {Haskell is the world's leading lazy functional programming language and is widely used in teaching, research, and applications. The language continues to develop rapidly, but in 1998 the programming community decided to capture a stable snapshot of the language by introducing Haskell 98. This book constitutes the agreed definition of Haskell 98, the language itself as well as its supporting libraries, and should be a standard reference work for anyone involved in research, teaching, or applications. All Haskell compilers support Haskell 98, so professioanls and educators have a stable base for their work.},
613−booktitle = {Practical Applications of Declarative Languages ({PADL} 2012)},
691+author = {Jones, Simon Peyton},
614−file = {:home/edwin/Research/Papers/Mendeley/Brady, Hammond/Brady, Hammond - 2012 - Resource-safe Systems Programming with Embedded Domain Specific Languages.pdf:pdf},
692+editor = {Jones, Simon Peyton},
615−pages = {242----257},
693+isbn = {0521826144},
616−title = {{Resource-safe Systems Programming with Embedded Domain Specific Languages}},
694+journal = {Language},
617−url = {http://www.cs.st-andrews.ac.uk/$\sim$eb/drafts/dsl-idris.pdf},
695+number = {1},
618−year = {2012}
696+publisher = {Cambridge University Press},
697+title = {{Haskell 98 Language and Libraries The Revised Report}},
698+url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0521826144},
620−@article{fisher2006next,
702+@article{Brady2006a,
621−author = {Fisher, K. and Mandelbaum, Y. and Walker, D.},
703+author = {Brady, E and Hammond, K},
622−file = {:home/edwin/Research/Papers/Mendeley/Fisher, Mandelbaum, Walker/Fisher, Mandelbaum, Walker - 2010 - The next 700 data description languages.pdf:pdf},
704+file = {:home/edwin/Research/Papers/Mendeley/Brady, Hammond/Brady, Hammond - 2006 - A verified staged interpreter is a verified compiler.pdf:pdf},
623−journal = {Journal of the ACM},
705+journal = {\ldots of the 5th international conference on \ldots},
624−number = {2},
706+keywords = {Dependent Types},
625−pages = {1--51},
707+mendeley-tags = {Dependent Types},
626−publisher = {ACM},
708+title = {{A verified staged interpreter is a verified compiler}},
627−title = {{The next 700 data description languages}},
709+url = {http://portal.acm.org/citation.cfm?id=1173706.1173724},
628−url = {http://dl.acm.org/citation.cfm?id=1111039},
710+year = {2006}
632−@book{Bird2010,
712+@article{burrows1990,
633−author = {Bird, Richard},
713+author = {Burrows, Michael and Abadi, Martin and Needham, Roger},
634−file = {:home/edwin/Research/Papers/Mendeley/Bird/Bird - 2010 - Pearls of Functional Algorithm Design.pdf:pdf},
714+file = {:home/edwin/Research/Papers/Mendeley/Burrows, Abadi, Needham/Burrows, Abadi, Needham - 1990 - A logic of authentication.pdf:pdf},
635−isbn = {9780521513388},
715+journal = {ACM Transactions on Computer Systems},
636−title = {{Pearls of Functional Algorithm Design}},
716+pages = {18----36},
637−year = {2010}
717+title = {{A logic of authentication}},
718+url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.3569},
639−@inproceedings{stump2010resource,
722+@phdthesis{McBride1999,
640−author = {Stump, A. and Austin, E.},
723+author = {McBride, Conor},
641−booktitle = {Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification},
724+file = {:home/edwin/Research/Papers/Mendeley/McBride/McBride - 1999 - Dependently typed functional programs and their proofs.pdf:pdf},
642−file = {:home/edwin/Research/Papers/Mendeley/Stump, Austin/Stump, Austin - 2010 - Resource typing in Guru.pdf:pdf},
725+keywords = {Dependent Types},
643−pages = {27--38},
726+mendeley-tags = {Dependent Types},
644−publisher = {ACM},
727+school = {University of Edinburgh},
645−title = {{Resource typing in Guru}},
728+title = {{Dependently typed functional programs and their proofs}},
646−url = {http://dl.acm.org/citation.cfm?id=1707796},
729+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.4785&rep=rep1&type=pdf},
647−year = {2010}
730+year = {1999}
649−@inproceedings{taha1997multi,
732+@article{mcbride2010ornamental,
650−author = {Taha, W. and Sheard, T.},
733+author = {McBride, Conor},
651−booktitle = {ACM SIGPLAN Notices},
734+file = {:home/edwin/Research/Papers/Mendeley/McBride/McBride - 2010 - Ornamental algebras, algebraic ornaments.pdf:pdf},
652−number = {12},
735+journal = {Journal of Functional Programming},
653−pages = {203--217},
736+title = {{Ornamental algebras, algebraic ornaments}},
654−publisher = {ACM},
737+url = {http://personal.cis.strath.ac.uk/$\sim$conor/pub/OAAO/Ornament.pdf},
655−title = {{Multi-stage programming with explicit annotations}},
738+year = {2010}
656−url = {http://dl.acm.org/citation.cfm?id=259019},
660−@article{Wadler2001,
740+@article{Chapman2005epigram,
661−abstract = {The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modification of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.},
741+author = {Chapman, James and Altenkirch, Thorsten and McBride, Conor},
662−author = {Wadler, Philip},
742+file = {:home/edwin/Research/Papers/Mendeley/Chapman, Altenkirch, McBride/Chapman, Altenkirch, McBride - 2005 - Epigram Reloaded A Standalone Typechecker for {ETT}.pdf:pdf},
663−doi = {10.1007/3-540-59451-5_2},
743+journal = {Trends in Functional Programming},
664−editor = {Jeuring, Johan and Meijer, Erik},
744+publisher = {Intellect Books},
665−file = {:home/edwin/Research/Papers/Mendeley/Wadler/Wadler - 2001 - Monads for functional programming.pdf:pdf},
745+title = {{Epigram Reloaded: A Standalone Typechecker for {ETT}}},
666−isbn = {3540594515},
746+url = {http://books.google.co.uk/books?hl=en&lr=&id=p0yV1sHLubcC&oi=fnd&pg=PA79&dq=epigram+reloaded&ots=x50ou0VMsm&sig=7TjAGohIatNLTWsHcuNcK5hEGGY},
667−issn = {03029743},
747+year = {2005}
668−journal = {Advanced Functional Programming},
669−number = {August 1992},
671−publisher = {Springer},
672−series = {Lecture Notes in Computer Science},
673−title = {{Monads for functional programming}},
674−url = {http://www.springerlink.com/index/715264614rh13340.pdf},
678−@article{Hoare1978,
749+@inproceedings{Levitation2010,
679−abstract = {This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When combined with a development of Dijkstra's guarded command, these concepts are surprisingly versatile. Their use is illustrated by sample solutions of a variety of a familiar programming exercises.},
750+author = {Chapman, James and Dagand, Pierre-Evariste and McBride, Conor and Morris, Peter},
680−author = {Hoare, C A R},
751+booktitle = {ICFP15th ACM SIGPLAN International Conference on Functional programming (ICFP '10)},
681−doi = {10.1016/0167-6423(87)90028-1},
752+doi = {10.1145/1932681.1863547},
682−editor = {McKeag, R M and Macnaghten, A M},
753+file = {:home/edwin/Research/Papers/Mendeley/Chapman et al/Chapman et al. - 2010 - The gentle art of levitation.pdf:pdf},
683−file = {:home/edwin/Research/Papers/Mendeley/Hoare/Hoare - 1978 - Communicating sequential processes.pdf:pdf},
754+isbn = {978-1-60558-794-3},
684−isbn = {0131532715},
755+issn = {03621340},
685−issn = {01676423},
756+keywords = {Dependent Types,data structure,metaprogramming,monads,proof assistants,type systems},
686−journal = {Communications of the ACM},
757+mendeley-tags = {Dependent Types},
687−number = {8},
758+month = sep,
688−pages = {666--677},
759+number = {9},
689−pmid = {2142694823583477576},
760+pages = {3},
690−publisher = {ACM},
761+title = {{The gentle art of levitation}},
691−series = {International Series in Computer Science},
762+url = {http://dl.acm.org/citation.cfm?id=1932681.1863547},
692−title = {{Communicating sequential processes}},
763+volume = {45},
693−url = {http://linkinghub.elsevier.com/retrieve/pii/0167642387900281},
764+year = {2010}
697−@book{Philosophy2012,
766+@article{McBride2004a,
698−author = {Hunt, Andrew and Thomas, David},
767+abstract = {ABSTRACT Pattern matching has proved an extremely powerful and durable notion in functional programming. This paper contributes a new programming notation for type theory which elaborates the notion in various ways. First, as is by now quite well-known in the type theory community, definition by pattern matching becomes a more discriminating tool in the presence of dependent types, since it refines the explanation of types as well as values. This becomes all the more true in the presence of the rich class of datatypes known as inductive families (Dybjer, 1991). Secondly, as proposed by Peyton Jones (1997) for Haskell, and independently rediscovered by us, subsidiary case analyses on the results of intermediate computations, which commonly take place on the right-hand side of definitions by pattern matching, should rather be handled on the left. In simply-typed languages, this subsumes the trivial case of Boolean guards; in our setting it becomes yet more powerful. Thirdly, elementary pattern matching decompositions have a well-defined interface given by a dependent type; they correspond to the statement of an induction principle for the datatype. More general, user-definable decompositions may be defined which also have types of the same general form. Elementary pattern matching may therefore be recast in abstract form, with a semantics given by translation. Such abstract decompositions of data generalize Wadler's (1987) notion of ‘view’. The programmer wishing to introduce a new view of a type mathitT, and exploit it directly in pattern matching, may do so via a standard programming idiom. The type theorist, looking through the Curry–Howard lens, may see this as proving a theorem, one which establishes the validity of a new induction principle for mathitT. We develop enough syntax and semantics to account for this high-level style of programming in dependent type theory. We close with the development of a typechecker for the simply-typed lambda calculus, which furnishes a view of raw terms as either being well-typed, or containing an error. The implementation of this view is ipso facto a proof that typechecking is decidable.},
699−booktitle = {Carcinogenesis},
768+author = {McBride, Conor and McKinna, James},
700−doi = {10.1093/carcin/bgs054},
769+doi = {10.1017/S0956796803004829},
701−file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 1.pdf:pdf},
770+file = {:home/edwin/Research/Papers/Mendeley/McBride, McKinna/McBride, McKinna - 2004 - The view from the left.pdf:pdf},
702−isbn = {020161622X},
771+issn = {09567968},
703−issn = {1460-2180},
772+journal = {Journal of Functional Programming},
704−number = {3},
773+keywords = {Dependent Types},
705−pmid = {22383472},
774+mendeley-tags = {Dependent Types},
706−title = {{The Pragmatic Programmer Chapter 1}},
775+number = {1},
707−url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
776+pages = {69--111},
708−volume = {33}
777+publisher = {Cambridge University Press},
778+title = {{The view from the left}},
779+url = {http://www.journals.cambridge.org/abstract_S0956796803004829},
710−@inproceedings{Kimmell2012,
783+@article{Altenkirch2010a,
711−author = {Kimmell, G and Stump, A and {Eades III}, HD and Fu, Peng and Sheard, Tim and Weirich, S and Casinghino, C and Sj\"{o}berg, V and Collins, N and Ahn, KY},
784+abstract = {We begin by revisiting the idea of using a universe of types to write generic programs in a dependently typed setting by constructing a universe for Strictly Positive Types (SPTs). Here we extend this construction to cover dependent types, i.e. Strictly Positive Families (SPFs), thereby fixing a gap left open in previous work. Using the approach presented here we are able to represent all of Epigrams datatypes within Epigram including the universe of datatypes itself.},
712−booktitle = {Programming Languages meets Program Verification},
785+author = {Altenkirch, Thorsten and Mcbride, Conor and Morris, Peter},
713−title = {{Equational reasoning about programs with general recursion and call-by-value semantics}},
786+file = {:home/edwin/Research/Papers/Mendeley/Altenkirch, Mcbride, Morris/Altenkirch, Mcbride, Morris - 2010 - Generic Programming with Dependent Types.pdf:pdf},
714−url = {http://dl.acm.org/citation.cfm?id=2103780},
787+journal = {Citeseer},
715−year = {2012}
788+publisher = {Citeseer},
789+title = {{Generic Programming with Dependent Types}},
790+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.129.2926&rep=rep1&type=pdf},
717−@book{While2012,
793+@phdthesis{Okasaki1996,
718−author = {Hunt, Andrew and Thomas, David},
794+author = {Okasaki, Chris},
719−booktitle = {Carcinogenesis},
795+file = {:home/edwin/Research/Papers/Mendeley/Okasaki/Okasaki - 1996 - Purely Functional Data Structures.pdf:pdf},
720−doi = {10.1093/carcin/bgs054},
796+school = {Carnegie Mellon University},
721−file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 6.pdf:pdf},
797+title = {{Purely Functional Data Structures}},
722−isbn = {020161622X},
798+year = {1996}
726−title = {{The Pragmatic Programmer Chapter 6}},
727−url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
730−@inproceedings{Brady2010,
800+@article{Abel2010,
731−author = {Brady, Edwin and Hammond, Kevin},
801+abstract = {Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track structural descent and guardedness in the type system to make termination checking robust and suitable for strong abstractions like higher-order functions and polymorphism. To study the application of sized types to proof assistants and programming languages based on dependent type theory, we have implemented a core language, MiniAgda, with explicit handling of sizes. New considerations were necessary to soundly integrate sized types with dependencies and pattern matching, which was made possible by concepts such as inaccessible patterns and parametric function spaces. This paper provides an introduction to MiniAgda by example and informal explanations of the underlying principles.},
732−booktitle = {Proceedings of the 15th ACM SIGPLAN international conference on Functional programming},
802+author = {Abel, Andreas},
733−file = {:home/edwin/Research/Papers/Mendeley/Brady, Hammond/Brady, Hammond - 2010 - Scrapping your inefficient engine using partial evaluation to improve domain-specific language implementation.pdf:pdf},
803+file = {:home/edwin/Research/Papers/Mendeley/Abel/Abel - 2010 - MiniAgda Integrating Sized and Dependent Types.pdf:pdf},
734−isbn = {9781605587943},
804+journal = {EPTCS},
735−keywords = {Dependent Types,code generation gives,contrast,dependent types,efficient,harder,however,implementation,likely efficient,ness interpreter,partial evaluation,resulting implementation,un,verify its correctness},
805+pages = {1--15},
736−mendeley-tags = {Dependent Types},
806+title = {{MiniAgda: Integrating Sized and Dependent Types}},
737−pages = {297--308},
807+url = {http://arxiv.org/abs/1012.4896},
738−publisher = {ACM},
808+volume = {43},
739−title = {{Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation}},
740−url = {http://portal.acm.org/citation.cfm?id=1863587},
741year = {2010}
809year = {2010}
743−@inproceedings{Visser2008,
811+@inproceedings{Brady2006b,
744−author = {Visser, E},
812+author = {Brady, Edwin},
745−booktitle = {Generative and Transformational Techniques in Software Engineering},
813+booktitle = {Implementation and Application of Functional Languages ({IFL}'06)},
746−title = {{WebDSL: A case study in domain-specific language engineering}},
814+file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2006 - Ivor, a proof engine.pdf:pdf},
747−url = {http://www.springerlink.com/index/A3213003X6268032.pdf},
815+isbn = {978-3-540-74129-9},
748−year = {2008}
816+month = sep,
817+pages = {145----162},
818+title = {{Ivor, a proof engine}},
819+url = {http://dl.acm.org/citation.cfm?id=1757028.1757037},
750−@misc{TheMendeleySupportTeam2011a,
822+@misc{TheMendeleySupportTeam2011,
751abstract = {A quick introduction to Mendeley. Learn how Mendeley creates your personal digital library, how to organize and annotate documents, how to collaborate and share with colleagues, and how to generate citations and bibliographies.},
823abstract = {A quick introduction to Mendeley. Learn how Mendeley creates your personal digital library, how to organize and annotate documents, how to collaborate and share with colleagues, and how to generate citations and bibliographies.},
752address = {London},
824address = {London},
753author = {{The Mendeley Support Team}},
825author = {{The Mendeley Support Team}},
@@ -756,157 +828,140 @@ file = {:home/edwin/Research/Papers/Mendeley/The Mendeley Support Team/The Mende
756keywords = {Mendeley,how-to,user manual},
828keywords = {Mendeley,how-to,user manual},
757pages = {1--16},
829pages = {1--16},
758publisher = {Mendeley Ltd.},
830publisher = {Mendeley Ltd.},
759−title = {{Getting Started with Mendeley}},
831+title = {{Getting Started with Mendeley}},
760−url = {http://www.mendeley.com},
832+url = {http://www.mendeley.com},
761−year = {2011}
833+year = {2011}
763−@inproceedings{Brady2005a,
764−author = {Brady, E and Hammond, K},
765−booktitle = {Implementation and Application of Functional \ldots},
766−file = {:home/edwin/Research/Papers/Mendeley/Brady, Hammond/Brady, Hammond - 2005 - A dependently typed framework for static analysis of program execution costs.pdf:pdf},
767−keywords = {Dependent Types},
768−mendeley-tags = {Dependent Types},
769−title = {{A dependently typed framework for static analysis of program execution costs}},
770−url = {http://www.springerlink.com/index/P446P2HH70107759.pdf},
773−@inproceedings{madhavapeddy2010turning,
774−author = {Madhavapeddy, A. and Mortier, R. and Sohan, R. and Gazagnaire, T. and Hand, S. and Deegan, T. and McAuley, D. and Crowcroft, J.},
775−booktitle = {Proceedings of the 2nd USENIX conference on Hot topics in cloud computing},
776−file = {:home/edwin/Research/Papers/Mendeley/Madhavapeddy et al/Madhavapeddy et al. - 2010 - Turning down the LAMP software specialisation for the cloud.pdf:pdf},
777−publisher = {USENIX Association},
778−title = {{Turning down the LAMP: software specialisation for the cloud}},
779−url = {http://dl.acm.org/citation.cfm?id=1863114},
782−@article{McBride2007,
783−author = {McBride, Conor and Paterson, Ross},
784−file = {:home/edwin/Research/Papers/Mendeley/McBride, Paterson/McBride, Paterson - 2007 - Applicative programming with effects.pdf:pdf},
785−journal = {Journal of functional programming},
786−title = {{Applicative programming with effects}},
787−url = {http://journals.cambridge.org/abstract_S0956796807006326},
790−@inproceedings{bhargavan2010modular,
791−author = {Bhargavan, K. and Fournet, C. and Gordon, A.D.},
792−booktitle = {ACM Sigplan Notices},
796−title = {{Modular verification of security protocol code by typing}},
797−url = {http://dl.acm.org/citation.cfm?id=1707801.1706350},
801−@article{McBride2006,
802−author = {McBride, C and Goguen, H and McKinna, J},
803−journal = {Types for Proofs and Programs},
804−title = {{A few constructions on constructors}},
805−url = {http://www.springerlink.com/index/P4863U0M41396254.pdf},
808−@inproceedings{coquand1986analysis,
835+@article{mccann2000packet,
809−author = {Coquand, T.},
836+author = {McCann, P.J. and Chandra, S.},
810−booktitle = {{Proceedings of the First IEEE Symposium on Logic in Computer Science}},
837+journal = {ACM SIGCOMM Computer Communication Review},
811−file = {:home/edwin/Research/Papers/Mendeley/Coquand/Coquand - 1986 - An analysis of Girard's paradox.pdf:pdf},
838+number = {4},
812−pages = {227----246},
839+pages = {321--333},
813−title = {{An analysis of Girard's paradox}},
840+publisher = {ACM},
814−url = {http://hal.inria.fr/docs/00/07/60/23/PDF/RR-0531.pdf},
841+title = {{Packet types: abstract specification of network protocol messages}},
815−year = {1986}
842+url = {http://dl.acm.org/citation.cfm?id=347563},
817−@inproceedings{Augustsson1985,
846+@article{Steiner1988,
818−address = {Berlin, Heidelberg},
847+author = {Steiner, JG},
819−author = {Augustsson, Lennart},
848+file = {:home/edwin/Research/Papers/Mendeley/Steiner/Steiner - 1988 - Kerberos An authentication service for open network systems.pdf:pdf},
820−booktitle = {Functional Programming Languages and Computer Architecture},
849+journal = {Proc. Winter USENIX Conference},
821−doi = {10.1007/3-540-15975-4},
850+title = {{Kerberos: An authentication service for open network systems}},
822−editor = {Jouannaud, Jean-Pierre},
851+url = {http://www.cse.nd.edu/$\sim$dthain/courses/cse598z/fall2004/papers/kerberos.pdf},
823−isbn = {978-3-540-15975-9},
852+year = {1988}
824−keywords = {Computer Science},
825−pages = {368----381},
826−publisher = {Springer Berlin Heidelberg},
827−series = {Lecture Notes in Computer Science},
828−title = {{Compiling Pattern Matching}},
829−url = {http://www.springerlink.com/content/y647423656557505/},
833−@misc{Bloat,
854+@article{Hughes1989,
834−author = {Brooks, Fred},
855+abstract = {As software becomes more and more complex, it is more and more important to structure it well. Well-structured software is easy to write, easy to debug, and provides a collection of modules that can be re-used to reduce future programming costs. Conventional languages place conceptual limits on the way problems can be modularised. Functional languages push those limits back. In this paper we show that two features of functional languages in particular, higher-order functions and lazy evaluation, can contribute greatly to modularity. As examples, we manipulate lists and trees, program several numerical algorithms, and implement the alpha-beta heuristic (an algorithm from Artificial Intelligence used in game-playing programs). Since modularity is the key to successful programming, functional languages are vitally important to the real world.},
835−file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 4.pdf:pdf},
856+author = {Hughes, J},
836−isbn = {9780321702081},
857+chapter = {2},
837−title = {{The Design of Design Chapter 4}}
858+doi = {10.1093/comjnl/32.2.98},
859+editor = {Turner, David A},
860+file = {:home/edwin/Research/Papers/Mendeley/Hughes/Hughes - 1989 - Why Functional Programming Matters.pdf:pdf},
861+institution = {Programming Methodology Group, University of {G\"{o}teborg} and Chalmers Institute of Technology, Sweden},
864+journal = {The Computer Journal},
867+publisher = {Br Computer Soc},
868+title = {{Why Functional Programming Matters}},
869+url = {http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/32.2.98},
839−@inproceedings{barras2008implicit,
873+@inproceedings{gibbons2011modularising,
840−author = {Barras, B. and Bernardo, B.},
874+author = {Gibbons, J. and Ko, H.S. and Others},
841−booktitle = {Foundations of Software Science and Computational Structures},
875+file = {:home/edwin/Research/Papers/Mendeley/Ko, Gibbons/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
842−file = {:home/edwin/Research/Papers/Mendeley/Barras, Bernardo/Barras, Bernardo - 2008 - The implicit calculus of constructions as a programming language with dependent types.pdf:pdf},
876+title = {{Modularising inductive families}},
843−pages = {365--379},
877+url = {http://www.cs.ox.ac.uk/publications/publication5008-abstract.html},
844−publisher = {Springer},
878+year = {2011}
845−title = {{The implicit calculus of constructions as a programming language with dependent types}},
846−url = {http://www.springerlink.com/index/m84h82904546l265.pdf},
849−@misc{Brady2012c,
880+@article{Okasaki1993,
881+author = {Okasaki, Chris},
882+file = {:home/edwin/Research/Papers/Mendeley/Okasaki/Okasaki - 1993 - Red-Black Trees in A Functional Setting.pdf:pdf},
883+journal = {Journal of functional programming},
884+title = {{Red-Black Trees in A Functional Setting}},
850author = {Brooks, Fred},
888author = {Brooks, Fred},
851doi = {10.1093/epirev/mxr031},
889doi = {10.1093/epirev/mxr031},
852−file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 5.pdf:pdf},
890+file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 2.pdf:pdf},
853isbn = {9780321702081},
891isbn = {9780321702081},
854issn = {1478-6729},
892issn = {1478-6729},
857pmid = {22215642},
893pmid = {22215642},
858−title = {{The Design of Design Chapter 5}},
894+title = {{The Design of Design Chapter 2}}
861−@inproceedings{Fournet2011,
896+@inproceedings{Wadler1989,
862−author = {Fournet, Cedric and Bhargavan, Karthikeyan and Gordon, Andrew D},
897+abstract = {From the type of a polymorphic function we can derive a theorem that it satisfies. Every function of the same type satisfies the same theorem. This provides a free source of useful theorems, courtesy of Reynolds' abstraction theorem for the polymorphic lambda calculus.},
863−booktitle = {Foundations of security analysis and design {VI}},
898+author = {Wadler, Philip},
864−file = {:home/edwin/Research/Papers/Mendeley/Fournet, Bhargavan, Gordon/Fournet, Bhargavan, Gordon - 2010 - Cryptographic verification by typing for a sample protocol implementation.pdf:pdf},
899+booktitle = {Proceedings of the fourth international conference on Functional programming languages and computer architecture},
865−title = {{Cryptographic verification by typing for a sample protocol implementation}},
900+doi = {10.1145/99370.99404},
866−url = {http://www.springerlink.com/index/V168041M46658R73.pdf},
901+file = {:home/edwin/Research/Papers/Mendeley/Wadler/Wadler - 1989 - Theorems for free!.pdf:pdf},
867−year = {2010}
902+isbn = {0897913280},
907+title = {{Theorems for free!}},
908+url = {http://portal.acm.org/citation.cfm?id=99404},
869−@book{Choosing2012,
911+@inproceedings{l,
870−author = {Fowler, Martin},
912+author = {L\"{a}mmel, R. and Jones, S.P.},
913+booktitle = {ACM SIGPLAN Notices},
914+file = {:home/edwin/Research/Papers/Mendeley/L\"{a}mmel, Jones/L\"{a}mmel, Jones - 2003 - Scrap your boilerplate a practical design pattern for generic programming.pdf:pdf},
918+title = {{Scrap your boilerplate: a practical design pattern for generic programming}},
919+url = {http://dl.acm.org/citation.cfm?id=640136.604179},
923+@inproceedings{Xi1999,
924+abstract = {Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.},
925+author = {Xi, Hongwei and Pfenning, Frank},
926+booktitle = {Proceedings of the 26th ACM SIGPLANSIGACT symposium on Principles of programming languages POPL 99},
927+doi = {10.1145/292540.292560},
928+file = {:home/edwin/Research/Papers/Mendeley/Xi, Pfenning/Xi, Pfenning - 1999 - Dependent types in practical programming.pdf:pdf},
931+keywords = {Dependent Types},
932+mendeley-tags = {Dependent Types},
933+organization = {Carnegie Mellon University},
935+publisher = {ACM Press},
937+title = {{Dependent types in practical programming}},
938+url = {http://portal.acm.org/citation.cfm?doid=292540.292560},
942+@inproceedings{morris2006exploring,
943+author = {Morris, P. and Altenkirch, T. and McBride, C.},
944+booktitle = {Types for Proofs and Programs},
945+file = {:home/edwin/Research/Papers/Mendeley/Morris, Altenkirch, McBride/Morris, Altenkirch, McBride - 2006 - Exploring the regular tree types.pdf:pdf},
947+publisher = {Springer},
948+title = {{Exploring the regular tree types}},
949+url = {http://www.springerlink.com/index/f9p1317716614834.pdf},
953+author = {Hunt, Andrew and Thomas, David},
871booktitle = {Carcinogenesis},
954booktitle = {Carcinogenesis},
872doi = {10.1093/carcin/bgs054},
955doi = {10.1093/carcin/bgs054},
873−file = {:home/edwin/Research/Papers/Mendeley/Fowler/Fowler - Unknown - Domain Specific Languages Chapter 6.pdf:pdf},
956+file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 2.pdf:pdf},
874−isbn = {9780132107549},
957+isbn = {020161622X},
875issn = {1460-2180},
958issn = {1460-2180},
876number = {3},
959number = {3},
877pmid = {22383472},
960pmid = {22383472},
878−title = {{Domain Specific Languages Chapter 6}},
961+title = {{The Pragmatic Programmer Chapter 2}},
879url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
962url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
880volume = {33}
963volume = {33}
882−@article{mcbride2008functional,
883−author = {McBride, C. and Paterson, R.},
884−file = {:home/edwin/Research/Papers/Mendeley/McBride, Paterson/McBride, Paterson - 2008 - Functional pearl Applicative programming with effects.pdf:pdf},
885−journal = {Journal of functional programming},
888−publisher = {Cambridge Univ Press},
889−title = {{Functional pearl: Applicative programming with effects}},
890−url = {http://journals.cambridge.org/production/action/cjoGetFulltext?fulltextid=1457860},
894−@inproceedings{pollack1990implicit,
895−author = {Pollack, R.},
896−booktitle = {Informal Proceedings of First Workshop on Logical Frameworks, Antibes},
897−file = {:home/edwin/Research/Papers/Mendeley/Pollack/Pollack - 1990 - Implicit syntax.pdf:pdf},
898−publisher = {Citeseer},
899−title = {{Implicit syntax}},
900−url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.7361&rep=rep1&type=pdf},
903−@misc{altenkirch2008nσ,
904−author = {Altenkirch, T. and Oury, N.},
905−file = {:home/edwin/Research/Papers/Mendeley/Altenkirch, Oury/Altenkirch, Oury - 2008 - $Pi$$Sigma$ A Core Language for Dependently Typed Programming.pdf:pdf},
906−title = {{$\Pi$$\Sigma$: A Core Language for Dependently Typed Programming}},
907−url = {http://verse.aasemoon.com/images/6/6f/PiSigma.pdf},
910@misc{Abel1998,
965@misc{Abel1998,
911author = {Abel, Andreas},
966author = {Abel, Andreas},
912booktitle = {Language},
967booktitle = {Language},
@@ -914,59 +969,22 @@ file = {:home/edwin/Research/Papers/Mendeley/Abel/Abel - 1998 - foetus - Termina
914title = {{foetus - Termination Checker for Simple Functional Programs}},
969title = {{foetus - Termination Checker for Simple Functional Programs}},
915year = {1998}
970year = {1998}
917−@misc{pollack1997believe,
972+@article{Miller1992,
918−author = {Pollack, R.},
973+author = {Miller, Dale},
919−file = {:home/edwin/Research/Papers/Mendeley/Pollack/Pollack - 1997 - How to believe a machine-checked proof.pdf:pdf},
974+file = {:home/edwin/Research/Papers/Mendeley/Miller/Miller - 1992 - Unification under a mixed prefix.pdf:pdf},
920−title = {{How to believe a machine-checked proof}},
975+journal = {Journal of Symbolic Computation},
921−url = {http://books.google.co.uk/books?hl=en&lr=&id=pLnKggT_In4C&oi=fnd&pg=PA205&dq=how+to+believe+a+machine+checked+proof&ots=c2OI8krqqA&sig=EF3QonGFVdOpYdKO1KmW6ljCkjY},
976+title = {{Unification under a mixed prefix}},
922−year = {1997}
977+url = {http://www.sciencedirect.com/science/article/pii/074771719290011R},
924−@inproceedings{atkey2009unembedding,
925−author = {Atkey, R. and Lindley, S. and Yallop, J.},
926−booktitle = {Proceedings of the 2nd ACM SIGPLAN symposium on Haskell},
929−title = {{Unembedding domain-specific languages}},
930−url = {http://dl.acm.org/citation.cfm?id=1596644},
933−@inproceedings{oury2008power,
934−author = {Oury, N. and Swierstra, W.},
935−booktitle = {International Conference on Functional Programming},
936−file = {:home/edwin/Research/Papers/Mendeley/Oury, Swierstra/Oury, Swierstra - 2008 - The power of Pi.pdf:pdf},
937−keywords = {Dependent Types},
938−mendeley-tags = {Dependent Types},
942−title = {{The power of Pi}},
943−url = {http://dl.acm.org/citation.cfm?id=1411213},
947−@article{loh2010tutorial,
948−author = {L\"{o}h, A. and McBride, C. and Swierstra, W.},
949−file = {:home/edwin/Research/Papers/Mendeley/L\"{o}h, McBride, Swierstra/L\"{o}h, McBride, Swierstra - 2010 - A tutorial implementation of a dependently typed lambda calculus.pdf:pdf},
950−journal = {Fundamenta Informaticae},
953−publisher = {IOS Press},
954−title = {{A tutorial implementation of a dependently typed lambda calculus}},
955−url = {http://iospress.metapress.com/index/976W4716TM79M6U8.pdf},
959−@article{gordon2003authenticity,
980+@misc{Interface2012a,
960−author = {Gordon, A.D. and Jeffrey, A.},
981+author = {Kreibich, Jay A.},
961−file = {:home/edwin/Research/Papers/Mendeley/Gordon, Jeffrey/Gordon, Jeffrey - 2003 - Authenticity by typing for security protocols.pdf:pdf},
982+doi = {10.1093/epirev/mxr031},
962−journal = {Journal of computer security},
983+file = {:home/edwin/Research/Papers/Mendeley/Kreibich/Kreibich - Unknown - Using SQLite Chapter 7.pdf:pdf},
963−number = {4},
984+isbn = {9781449394592},
964−pages = {451--520},
985+issn = {1478-6729},
965−publisher = {IOS Press},
986+pmid = {22215642},
966−title = {{Authenticity by typing for security protocols}},
987+title = {{Using SQLite Chapter 7}}
967−url = {http://iospress.metapress.com/index/BHQQUFRA1C7W8TLY.pdf},
971@article{Vytiniotis2011,
989@article{Vytiniotis2011,
972author = {Vytiniotis, Dimitrios and {Peyton Jones}, Simon and Schrijvers, Tom and Sulzmann, Martin},
990author = {Vytiniotis, Dimitrios and {Peyton Jones}, Simon and Schrijvers, Tom and Sulzmann, Martin},
@@ -979,202 +997,99 @@ url = {http://journals.cambridge.org/abstract_S0956796811000098},
979volume = {21},
997volume = {21},
980year = {2011}
998year = {2011}
982−@misc{Attacks2012a,
1000+@inproceedings{Brady2003,
983−author = {Anderson, Ross},
1001+author = {Brady, Edwin and McBride, Conor and McKinna, James},
984−doi = {10.1093/epirev/mxr031},
1002+booktitle = {Types for Proofs and Programs},
985−file = {:home/edwin/Research/Papers/Mendeley/Anderson/Anderson - Unknown - Security Engineering Chapter 18.pdf:pdf},
1003+file = {:home/edwin/Research/Papers/Mendeley/Brady, McBride, McKinna/Brady, McBride, McKinna - 2003 - Inductive families need not store their indices.pdf:pdf},
986−isbn = {9780470068526},
991−title = {{Security Engineering Chapter 18}},
994−@inproceedings{Sheard2005,
995−address = {New York, New York, USA},
996−author = {Sheard, Tim},
997−booktitle = {Proceedings of the 2005 ACM SIGPLAN workshop on Haskell - Haskell '05},
998−doi = {10.1145/1088348.1088356},
999−file = {:home/edwin/Research/Papers/Mendeley/Sheard/Sheard - 2005 - Putting curry-howard to work.pdf:pdf},
1000−isbn = {159593071X},
1001−keywords = {GADT,curry-howard isomorphism,extensional kind system,haskell,logic},
1004−publisher = {ACM Press},
1005−title = {{Putting curry-howard to work}},
1006−url = {http://dl.acm.org/citation.cfm?id=1088348.1088356},
1009−@inproceedings{NanevskiAAMorrisett2008,
1010−abstract = {We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. Coq already includes a powerful functional language that supports dependent types, but that language is limited to pure, total functions. The key contribution of our extension, which we call Ynot, is the added support for computations that may have effects such as non-termination, accessing a mutable store, and throwing/catching exceptions. The axioms of Ynot form a small trusted computing base which has been formally justified in our previous work on Hoare Type Theory (HTT). We show how these axioms can be combined with the powerful type and abstraction mechanisms of Coq to build higher-level reasoning mechanisms which in turn can be used to build realistic, verified software components. To substantiate this claim, we describe here a representative series of modules that implement imperative finite maps, including support for a higher-order (effectful) iterator. The implementations range from simple (e.g., association lists) to complex (e.g., hash tables) but share a common interface which, abstracts the implementation details and ensures that the modules properly implement the finite map abstraction. Copyright 2008 ACM.},
1011−author = {{Nanevski A A Morrisett}, G B Shinnar A B Govereau P B Birkedal L C},
1012−booktitle = {International Conference on Functional Programming},
1013−doi = {10.1145/1411204.1411237},
1014−file = {:home/edwin/Research/Papers/Mendeley/Nanevski A A Morrisett/Nanevski A A Morrisett - 2008 - Ynot Dependent types for imperative programs.pdf:pdf},
1015−isbn = {9781595939197},
1017keywords = {Dependent Types},
1004keywords = {Dependent Types},
1018mendeley-tags = {Dependent Types},
1005mendeley-tags = {Dependent Types},
1019−number = {9},
1006+title = {{Inductive families need not store their indices}},
1020−pages = {229--240},
1007+url = {http://www.springerlink.com/index/WBXJJG717N2W3NU2.pdf},
1021−title = {{Ynot: Dependent types for imperative programs}},
1008+year = {2003}
1022−url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67650032847&partnerID=40&md5=7a5be3083878399cebafda33b1affa6b},
1026−@inproceedings{fisher2005pads,
1010+@inproceedings{swierstra2007beauty,
1027−author = {Fisher, K. and Gruber, R.},
1011+author = {Swierstra, W. and Altenkirch, T.},
1028−booktitle = {ACM SIGPLAN Notices},
1012+booktitle = {Proceedings of the ACM SIGPLAN workshop on Haskell workshop},
1029−number = {6},
1013+file = {:home/edwin/Research/Papers/Mendeley/Swierstra, Altenkirch/Swierstra, Altenkirch - 2007 - Beauty in the beast.pdf:pdf},
1030−pages = {295--304},
1014+pages = {25--36},
1031publisher = {ACM},
1015publisher = {ACM},
1032−title = {{PADS: a domain-specific language for processing ad hoc data}},
1016+title = {{Beauty in the beast}},
1033−url = {http://dl.acm.org/citation.cfm?id=1065046},
1017+url = {http://dl.acm.org/citation.cfm?id=1291206},
1034−volume = {40},
1018+year = {2007}
1037−@inproceedings{McBride2004b,
1020+@book{peyton1987implementation,
1038−author = {McBride, Conor and McKinna, James},
1021+author = {{Peyton Jones}, S.L.},
1039−booktitle = {Haskell Workshop},
1022+publisher = {Prentice-Hall, Inc.},
1040−file = {:home/edwin/Research/Papers/Mendeley/McBride, McKinna/McBride, McKinna - 2004 - I am not a number I am a free variable.pdf:pdf},
1023+title = {{The implementation of functional programming languages (prentice-hall international series in computer science)}},
1041−title = {{I am not a number : I am a free variable}},
1024+url = {http://dl.acm.org/citation.cfm?id=1096899},
1042−year = {2004}
1025+year = {1987}
1044−@article{marlow2006making,
1027+@article{dybjer1994inductive,
1045−author = {Marlow, S. and {Peyton Jones}, S.},
1028+author = {Dybjer, P.},
1046−file = {:home/edwin/Research/Papers/Mendeley/Marlow, Peyton Jones/Marlow, Peyton Jones - 2006 - Making a fast curry pushenter vs. evalapply for higher-order languages.pdf:pdf},
1029+journal = {Formal aspects of computing},
1047−journal = {Journal of Functional Programming},
1030+number = {4},
1048−number = {4-5},
1031+pages = {440--465},
1049−pages = {415--449},
1032+publisher = {Springer},
1050−publisher = {Cambridge University Press},
1033+title = {{Inductive families}},
1051−title = {{Making a fast curry: push/enter vs. eval/apply for higher-order languages}},
1034+url = {http://www.springerlink.com/index/J17824H467X6J288.pdf},
1052−url = {http://dl.acm.org/citation.cfm?id=1166018},
1035+volume = {6},
1053−volume = {16},
1036+year = {1994}
1056−@article{landin1966next,
1038+@inproceedings{lempsink2009type,
1057−author = {Landin, P.J.},
1039+author = {Lempsink, E. and Leather, S. and L\"{o}h, A.},
1058−file = {:home/edwin/Research/Papers/Mendeley/Landin/Landin - 1966 - The next 700 programming languages.pdf:pdf},
1040+booktitle = {Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming},
1059−journal = {Communications of the ACM},
1041+file = {:home/edwin/Research/Papers/Mendeley/Lempsink, Leather, L\"{o}h/Lempsink, Leather, L\"{o}h - 2009 - Type-safe diff for families of datatypes.pdf:pdf},
1060−number = {3},
1042+pages = {61--72},
1062publisher = {ACM},
1043publisher = {ACM},
1063−title = {{The next 700 programming languages}},
1044+title = {{Type-safe diff for families of datatypes}},
1064−url = {http://dl.acm.org/citation.cfm?id=365257 )},
1045+url = {http://dl.acm.org/citation.cfm?id=1596624},
1065−volume = {9},
1046+year = {2009}
1068−@misc{Protocols2012a,
1048+@misc{The2012b,
1069−author = {Anderson, Ross},
1049+author = {Brooks, Fred},
1070doi = {10.1093/epirev/mxr031},
1050doi = {10.1093/epirev/mxr031},
1071−file = {:home/edwin/Research/Papers/Mendeley/Anderson/Anderson - Unknown - Security Engineering Chapter 3.pdf:pdf},
1051+file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 1.pdf:pdf},
1072−isbn = {9780470068526},
1052+isbn = {9780321702081},
1073issn = {1478-6729},
1053issn = {1478-6729},
1074pmid = {22215642},
1054pmid = {22215642},
1075−title = {{Security Engineering Chapter 3}}
1055+title = {{The Design of Design Chapter 1}}
1077−@inproceedings{Sculthorpe2009,
1078−author = {Sculthorpe, Neil and Nilsson, Henrik},
1079−booktitle = {International Conference on Functional Programming ({ICFP} '09)},
1080−file = {:home/edwin/Research/Papers/Mendeley/Sculthorpe, Nilsson/Sculthorpe, Nilsson - 2009 - Safe functional reactive programming through dependent types(2).pdf:pdf;:home/edwin/Research/Papers/Mendeley/Sculthorpe, Nilsson/Sculthorpe, Nilsson - 2009 - Safe functional reactive programming through dependent types.pdf:pdf},
1081−title = {{Safe functional reactive programming through dependent types}},
1082−url = {http://dl.acm.org/citation.cfm?id=1596558},
1086−author = {Fowler, Martin},
1087−booktitle = {Language},
1088−file = {:home/edwin/Research/Papers/Mendeley/Fowler/Fowler - Unknown - Domain Specific Languages Chapter 2.pdf:pdf},
1089−isbn = {9780132107549},
1090−title = {{Domain Specific Languages Chapter 2}}
1093−abstract = {Haskell is the world's leading lazy functional programming language and is widely used in teaching, research, and applications. The language continues to develop rapidly, but in 1998 the programming community decided to capture a stable snapshot of the language by introducing Haskell 98. This book constitutes the agreed definition of Haskell 98, the language itself as well as its supporting libraries, and should be a standard reference work for anyone involved in research, teaching, or applications. All Haskell compilers support Haskell 98, so professioanls and educators have a stable base for their work.},
1094−author = {Jones, Simon Peyton},
1095−editor = {Jones, Simon Peyton},
1096−isbn = {0521826144},
1097−journal = {Language},
1099−publisher = {Cambridge University Press},
1100−title = {{Haskell 98 Language and Libraries The Revised Report}},
1101−url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0521826144},
1105−@article{Brady2006a,
1106−author = {Brady, E and Hammond, K},
1107−file = {:home/edwin/Research/Papers/Mendeley/Brady, Hammond/Brady, Hammond - 2006 - A verified staged interpreter is a verified compiler.pdf:pdf},
1108−journal = {\ldots of the 5th international conference on \ldots},
1109−keywords = {Dependent Types},
1110−mendeley-tags = {Dependent Types},
1111−title = {{A verified staged interpreter is a verified compiler}},
1112−url = {http://portal.acm.org/citation.cfm?id=1173706.1173724},
1115−@article{burrows1990,
1116−author = {Burrows, Michael and Abadi, Martin and Needham, Roger},
1117−file = {:home/edwin/Research/Papers/Mendeley/Burrows, Abadi, Needham/Burrows, Abadi, Needham - 1990 - A logic of authentication.pdf:pdf},
1118−journal = {ACM Transactions on Computer Systems},
1120−title = {{A logic of authentication}},
1121−url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.3569},
1125−@phdthesis{McBride1999,
1057+@misc{The2012c,
1126−author = {McBride, Conor},
1058+author = {Robbins, A and Hannah, E and Lamb, L},
1127−file = {:home/edwin/Research/Papers/Mendeley/McBride/McBride - 1999 - Dependently typed functional programs and their proofs.pdf:pdf},
1059+doi = {10.1093/epirev/mxr031},
1128−keywords = {Dependent Types},
1060+file = {:home/edwin/Research/Papers/Mendeley/Robbins, Hannah, Lamb/Robbins, Hannah, Lamb - Unknown - Learning the vi and Vim Editors.pdf:pdf},
1129−mendeley-tags = {Dependent Types},
1061+isbn = {9780596529833},
1130−school = {University of Edinburgh},
1062+issn = {1478-6729},
1131−title = {{Dependently typed functional programs and their proofs}},
1063+pmid = {22215642},
1132−url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.4785&rep=rep1&type=pdf},
1064+title = {{Learning the vi and Vim Editors}}
1135−@article{mcbride2010ornamental,
1066+@inproceedings{chlipala2010ur,
1136−author = {McBride, Conor},
1067+author = {Chlipala, Adam},
1137−file = {:home/edwin/Research/Papers/Mendeley/McBride/McBride - 2010 - Ornamental algebras, algebraic ornaments.pdf:pdf},
1068+booktitle = {ACM SIGPLAN Notices},
1138−journal = {Journal of Functional Programming},
1069+file = {:home/edwin/Research/Papers/Mendeley/Chlipala/Chlipala - 2010 - Ur statically-typed metaprogramming with type-level record computation.pdf:pdf},
1139−title = {{Ornamental algebras, algebraic ornaments}},
1070+number = {6},
1140−url = {http://personal.cis.strath.ac.uk/$\sim$conor/pub/OAAO/Ornament.pdf},
1071+pages = {122--133},
1073+title = {{Ur: statically-typed metaprogramming with type-level record computation}},
1074+url = {http://dl.acm.org/citation.cfm?id=1806612},
1141year = {2010}
1076year = {2010}
1143−@inproceedings{czarnecki2004dsl,
1078+@misc{dagand2011transporting,
1144−author = {Czarnecki, K. and O’Donnell, J. and Striegnitz, J. and Taha, W.},
1079+author = {Dagand, Pierre-Evariste and McBride, Conor},
1145−booktitle = {Domain-Specific Program Generation},
1080+file = {:home/edwin/Research/Papers/Mendeley/Dagand, McBride/Dagand, McBride - 2011 - Transporting Functions across Ornaments.pdf:pdf},
1146−file = {:home/edwin/Research/Papers/Mendeley/Czarnecki et al/Czarnecki et al. - 2004 - DSL implementation in MetaOCaml, Template Haskell, and C.pdf:pdf},
1081+title = {{Transporting Functions across Ornaments}},
1147−pages = {51--72},
1082+url = {http://personal.cis.strath.ac.uk/$\sim$dagand/stuffs/paper-2011-patch/paper.pdf},
1148−publisher = {Springer},
1083+year = {2011}
1149−title = {{DSL implementation in MetaOCaml, Template Haskell, and C++}},
1150−url = {http://www.springerlink.com/index/NL620EL7N94M161H.pdf},
1153−@article{Chapman2005epigram,
1154−author = {Chapman, James and Altenkirch, Thorsten and McBride, Conor},
1155−file = {:home/edwin/Research/Papers/Mendeley/Chapman, Altenkirch, McBride/Chapman, Altenkirch, McBride - 2005 - Epigram Reloaded A Standalone Typechecker for {ETT}.pdf:pdf},
1156−journal = {Trends in Functional Programming},
1157−publisher = {Intellect Books},
1158−title = {{Epigram Reloaded: A Standalone Typechecker for {ETT}}},
1159−url = {http://books.google.co.uk/books?hl=en&lr=&id=p0yV1sHLubcC&oi=fnd&pg=PA79&dq=epigram+reloaded&ots=x50ou0VMsm&sig=7TjAGohIatNLTWsHcuNcK5hEGGY},
1162−@inproceedings{Levitation2010,
1085+@inproceedings{taha2004gentle,
1163−author = {Chapman, James and Dagand, Pierre-Evariste and McBride, Conor and Morris, Peter},
1086+author = {Taha, W.},
1164−booktitle = {ICFP15th ACM SIGPLAN International Conference on Functional programming (ICFP '10)},
1087+booktitle = {Domain-Specific Program Generation},
1165−doi = {10.1145/1932681.1863547},
1088+pages = {30--50},
1166−file = {:home/edwin/Research/Papers/Mendeley/Chapman et al/Chapman et al. - 2010 - The gentle art of levitation.pdf:pdf},
1089+publisher = {Springer},
1167−isbn = {978-1-60558-794-3},
1090+title = {{A gentle introduction to multi-stage programming}},
1168−issn = {03621340},
1091+url = {http://www.springerlink.com/index/JEMT0D8VYN5JB2L8.pdf},
1169−keywords = {Dependent Types,data structure,metaprogramming,monads,proof assistants,type systems},
1092+year = {2004}
1170−mendeley-tags = {Dependent Types},
1174−title = {{The gentle art of levitation}},
1175−url = {http://dl.acm.org/citation.cfm?id=1932681.1863547},
1179@inproceedings{pj2006gadts,
1094@inproceedings{pj2006gadts,
1180author = {{Peyton Jones}, S. and Vytiniotis, D. and Weirich, S. and Washburn, G.},
1095author = {{Peyton Jones}, S. and Vytiniotis, D. and Weirich, S. and Washburn, G.},
@@ -1188,97 +1103,182 @@ url = {http://dl.acm.org/citation.cfm?id=1159811},
1188volume = {41},
1103volume = {41},
1189year = {2006}
1104year = {2006}
1191−@article{McBride2004a,
1106+@book{Brady2012,
1192−abstract = {ABSTRACT Pattern matching has proved an extremely powerful and durable notion in functional programming. This paper contributes a new programming notation for type theory which elaborates the notion in various ways. First, as is by now quite well-known in the type theory community, definition by pattern matching becomes a more discriminating tool in the presence of dependent types, since it refines the explanation of types as well as values. This becomes all the more true in the presence of the rich class of datatypes known as inductive families (Dybjer, 1991). Secondly, as proposed by Peyton Jones (1997) for Haskell, and independently rediscovered by us, subsidiary case analyses on the results of intermediate computations, which commonly take place on the right-hand side of definitions by pattern matching, should rather be handled on the left. In simply-typed languages, this subsumes the trivial case of Boolean guards; in our setting it becomes yet more powerful. Thirdly, elementary pattern matching decompositions have a well-defined interface given by a dependent type; they correspond to the statement of an induction principle for the datatype. More general, user-definable decompositions may be defined which also have types of the same general form. Elementary pattern matching may therefore be recast in abstract form, with a semantics given by translation. Such abstract decompositions of data generalize Wadler's (1987) notion of ‘view’. The programmer wishing to introduce a new view of a type mathitT, and exploit it directly in pattern matching, may do so via a standard programming idiom. The type theorist, looking through the Curry–Howard lens, may see this as proving a theorem, one which establishes the validity of a new induction principle for mathitT. We develop enough syntax and semantics to account for this high-level style of programming in dependent type theory. We close with the development of a typechecker for the simply-typed lambda calculus, which furnishes a view of raw terms as either being well-typed, or containing an error. The implementation of this view is ipso facto a proof that typechecking is decidable.},
1107+author = {Hunt, Andrew and Thomas, David},
1193−author = {McBride, Conor and McKinna, James},
1108+booktitle = {Carcinogenesis},
1194−doi = {10.1017/S0956796803004829},
1109+doi = {10.1093/carcin/bgs054},
1195−file = {:home/edwin/Research/Papers/Mendeley/McBride, McKinna/McBride, McKinna - 2004 - The view from the left.pdf:pdf},
1110+file = {:home/edwin/Research/Papers/Mendeley/Hunt, Thomas/Hunt, Thomas - Unknown - The Pragmatic Programmer Chapter 5.pdf:pdf},
1196−issn = {09567968},
1111+isbn = {020161622X},
1197−journal = {Journal of Functional Programming},
1112+issn = {1460-2180},
1115+title = {{The Pragmatic Programmer Chapter 5}},
1116+url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
1119+@inproceedings{Pasalic2002,
1120+author = {Pa\v{s}alic, Emir and Taha, Walid and Sheard, Tim},
1121+booktitle = {International Conference on Functional Programming},
1122+doi = {10.1145/583852.581499},
1123+file = {:home/edwin/Research/Papers/Mendeley/Pa\v{s}alic, Taha, Sheard/Pa\v{s}alic, Taha, Sheard - 2002 - Tagless staged interpreters for typed languages.pdf:pdf},
1124+isbn = {1-58113-487-8},
1126+keywords = {calculus of constructions,definitional interpreters,domain-specific languages,multi-stage programming},
1130+title = {{Tagless staged interpreters for typed languages}},
1131+url = {http://dl.acm.org/citation.cfm?id=583852.581499},
1136+author = {Brooks, Fred},
1137+doi = {10.1093/epirev/mxr031},
1138+file = {:home/edwin/Research/Papers/Mendeley/Brooks/Brooks - Unknown - The Design of Design Chapter 3.pdf:pdf},
1139+isbn = {9780321702081},
1142+title = {{The Design of Design Chapter 3}}
1145+author = {Fowler, Martin},
1146+booktitle = {Carcinogenesis},
1147+doi = {10.1093/carcin/bgs054},
1148+file = {:home/edwin/Research/Papers/Mendeley/Fowler/Fowler - Unknown - Domain Specific Languages Chapter 1.pdf:pdf},
1149+isbn = {9780132107549},
1153+title = {{Domain Specific Languages Chapter 1}},
1154+url = {http://www.ncbi.nlm.nih.gov/pubmed/22383472},
1157+@article{Haskell2012a,
1158+author = {Biancuzzi, F and Warden, S},
1159+doi = {10.1093/epirev/mxr031},
1160+file = {:home/edwin/Research/Papers/Mendeley/Biancuzzi, Warden/Biancuzzi, Warden - Unknown - Masterminds of Programming Chapter 8.pdf:pdf},
1161+isbn = {9780596801670},
1164+title = {{Masterminds of Programming Chapter 8}}
1166+@article{McBride2005,
1167+author = {McBride, Conor},
1168+editor = {Vene, Varmo and Uustalu, Tarmo},
1169+isbn = {3540285407},
1170+journal = {Advanced Functional Programming},
1198keywords = {Dependent Types},
1171keywords = {Dependent Types},
1199mendeley-tags = {Dependent Types},
1172mendeley-tags = {Dependent Types},
1200−number = {1},
1173+pages = {130--170},
1201−pages = {69--111},
1174+publisher = {Springer},
1202−publisher = {Cambridge University Press},
1175+series = {Lecture Notes in Computer Science},
1203−title = {{The view from the left}},
1176+title = {{Epigram: Practical programming with dependent types}},
1204−url = {http://www.journals.cambridge.org/abstract_S0956796803004829},
1177+url = {http://www.springerlink.com/index/96j7v5vn8tyebeky.pdf},
1205−volume = {14},
1178+volume = {3622},
1206−year = {2004}
1179+year = {2005}
1208−@article{Altenkirch2010a,
1181+@article{landin1966next,
1209−abstract = {We begin by revisiting the idea of using a universe of types to write generic programs in a dependently typed setting by constructing a universe for Strictly Positive Types (SPTs). Here we extend this construction to cover dependent types, i.e. Strictly Positive Families (SPFs), thereby fixing a gap left open in previous work. Using the approach presented here we are able to represent all of Epigrams datatypes within Epigram including the universe of datatypes itself.},
1182+author = {Landin, P.J.},
1210−author = {Altenkirch, Thorsten and Mcbride, Conor and Morris, Peter},
1183+file = {:home/edwin/Research/Papers/Mendeley/Landin/Landin - 1966 - The next 700 programming languages.pdf:pdf},
1211−file = {:home/edwin/Research/Papers/Mendeley/Altenkirch, Mcbride, Morris/Altenkirch, Mcbride, Morris - 2010 - Generic Programming with Dependent Types.pdf:pdf},
1184+journal = {Communications of the ACM},
1212−journal = {Citeseer},
1185+number = {3},
1213−publisher = {Citeseer},
1186+pages = {157--166},
1214−title = {{Generic Programming with Dependent Types}},
1187+publisher = {ACM},
1215−url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.129.2926&rep=rep1&type=pdf},
1188+title = {{The next 700 programming languages}},
1216−year = {2010}
1189+url = {http://dl.acm.org/citation.cfm?id=365257 )},
1218−@article{Steiner1988,
1193+@misc{Resolution2012a,
1219−author = {Steiner, JG},
1194+author = {Fall, Kevin R and Stevens, W. Richard},
1220−file = {:home/edwin/Research/Papers/Mendeley/Steiner/Steiner - 1988 - Kerberos An authentication service for open network systems.pdf:pdf},
1195+doi = {10.1093/epirev/mxr031},
1221−journal = {Proc. Winter USENIX Conference},
1196+file = {:home/edwin/Research/Papers/Mendeley/Fall, Stevens/Fall, Stevens - Unknown - TCPIP Illustrated Volume 1 Chapter 11.pdf:pdf},
1222−title = {{Kerberos: An authentication service for open network systems}},
1197+issn = {1478-6729},
1223−url = {http://www.cse.nd.edu/$\sim$dthain/courses/cse598z/fall2004/papers/kerberos.pdf},
1198+pmid = {22215642},
1224−year = {1988}
1199+title = {{TCP/IP Illustrated Volume 1 Chapter 11}}
1226−@phdthesis{Okasaki1996,
1201+@phdthesis{Brady2005,
1227−author = {Okasaki, Chris},
1202+author = {Brady, Edwin},
1228−file = {:home/edwin/Research/Papers/Mendeley/Okasaki/Okasaki - 1996 - Purely Functional Data Structures.pdf:pdf},
1203+file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2005 - Practical Implementation of a Dependently Typed Functional Programming Language.pdf:pdf},
1229−school = {Carnegie Mellon University},
1204+keywords = {Dependent Types},
1230−title = {{Purely Functional Data Structures}},
1205+mendeley-tags = {Dependent Types},
1231−year = {1996}
1206+school = {University of Durham},
1207+title = {{Practical Implementation of a Dependently Typed Functional Programming Language}},
1208+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.150.8284&rep=rep1&type=pdf},
1233−@article{Abel2010,
1211+@phdthesis{norell2007thesis,
1234−abstract = {Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track structural descent and guardedness in the type system to make termination checking robust and suitable for strong abstractions like higher-order functions and polymorphism. To study the application of sized types to proof assistants and programming languages based on dependent type theory, we have implemented a core language, MiniAgda, with explicit handling of sizes. New considerations were necessary to soundly integrate sized types with dependencies and pattern matching, which was made possible by concepts such as inaccessible patterns and parametric function spaces. This paper provides an introduction to MiniAgda by example and informal explanations of the underlying principles.},
1212+author = {Norell, Ulf},
1235−author = {Abel, Andreas},
1213+file = {:home/edwin/Research/Papers/Mendeley/Norell/Norell - 2007 - Towards a practical programming language based on dependent type theory.pdf:pdf},
1236−file = {:home/edwin/Research/Papers/Mendeley/Abel/Abel - 2010 - MiniAgda Integrating Sized and Dependent Types.pdf:pdf},
1214+keywords = {Dependent Types},
1237−journal = {EPTCS},
1215+mendeley-tags = {Dependent Types},
1238−pages = {1--15},
1216+publisher = {Citeseer},
1239−title = {{MiniAgda: Integrating Sized and Dependent Types}},
1217+school = {Chalmers University of Technology},
1240−url = {http://arxiv.org/abs/1012.4896},
1218+title = {{Towards a practical programming language based on dependent type theory}},
1241−volume = {43},
1219+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.65.7934&rep=rep1&type=pdf},
1242−year = {2010}
1220+year = {2007}
1244−@inproceedings{Brady2006b,
1222+@inproceedings{Brady2011a,
1223+address = {New York, New York, USA},
1245author = {Brady, Edwin},
1224author = {Brady, Edwin},
1246−booktitle = {Implementation and Application of Functional Languages ({IFL}'06)},
1225+booktitle = {Proceedings of the 5th {ACM} workshop on Programming languages meets program verification - {PLPV} '11},
1247−file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2006 - Ivor, a proof engine.pdf:pdf},
1226+doi = {10.1145/1929529.1929536},
1248−isbn = {978-3-540-74129-9},
1227+file = {:home/edwin/Research/Papers/Mendeley/Brady/Brady - 2011 - Idris --- Systems Programming Meets Full Dependent Types.pdf:pdf},
1249−month = sep,
1228+isbn = {9781450304870},
1250−pages = {145----162},
1229+keywords = {Dependent Types,data description,dependent types},
1251−title = {{Ivor, a proof engine}},
1230+mendeley-tags = {Dependent Types},
1252−url = {http://dl.acm.org/citation.cfm?id=1757028.1757037},
1231+month = jan,
1253−year = {2006}
1232+publisher = {ACM Press},
1233+title = {{Idris --- Systems Programming Meets Full Dependent Types}},
1234+url = {http://dl.acm.org/citation.cfm?id=1929529.1929536},
1255−@article{Hughes1989,
1237+@inproceedings{Kimmell2012,
1256−abstract = {As software becomes more and more complex, it is more and more important to structure it well. Well-structured software is easy to write, easy to debug, and provides a collection of modules that can be re-used to reduce future programming costs. Conventional languages place conceptual limits on the way problems can be modularised. Functional languages push those limits back. In this paper we show that two features of functional languages in particular, higher-order functions and lazy evaluation, can contribute greatly to modularity. As examples, we manipulate lists and trees, program several numerical algorithms, and implement the alpha-beta heuristic (an algorithm from Artificial Intelligence used in game-playing programs). Since modularity is the key to successful programming, functional languages are vitally important to the real world.},
1238+author = {Kimmell, G and Stump, A and {Eades III}, HD and Fu, Peng and Sheard, Tim and Weirich, S and Casinghino, C and Sj\"{o}berg, V and Collins, N and Ahn, KY},
1257−author = {Hughes, J},
1239+booktitle = {Programming Languages meets Program Verification},
1258−chapter = {2},
1240+title = {{Equational reasoning about programs with general recursion and call-by-value semantics}},
1259−doi = {10.1093/comjnl/32.2.98},
1241+url = {http://dl.acm.org/citation.cfm?id=2103780},
1260−editor = {Turner, David A},
1242+year = {2012}
1261−file = {:home/edwin/Research/Papers/Mendeley/Hughes/Hughes - 1989 - Why Functional Programming Matters.pdf:pdf},
1262−institution = {Programming Methodology Group, University of {G\"{o}teborg} and Chalmers Institute of Technology, Sweden},
1263−isbn = {0201172364},
1265−journal = {The Computer Journal},
1268−publisher = {Br Computer Soc},
1269−title = {{Why Functional Programming Matters}},
1270−url = {http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/32.2.98},
1274−@article{mccann2000packet,
1244+@inproceedings{augustsson2008paradise,
1275−author = {McCann, P.J. and Chandra, S.},
1245+author = {Augustsson, L. and Mansell, H. and Sittampalam, G.},
1276−journal = {ACM SIGCOMM Computer Communication Review},
1246+booktitle = {International Conference on Functional Programming},
1277−number = {4},
1247+file = {:home/edwin/Research/Papers/Mendeley/Augustsson, Mansell, Sittampalam/Augustsson, Mansell, Sittampalam - 2008 - Paradise a two-stage DSL embedded in Haskell.pdf:pdf},
1278−pages = {321--333},
1248+number = {9},
1279publisher = {ACM},
1250publisher = {ACM},
1280−title = {{Packet types: abstract specification of network protocol messages}},
1251+title = {{Paradise: a two-stage DSL embedded in Haskell}},
1281−url = {http://dl.acm.org/citation.cfm?id=347563},
1252+url = {http://dl.acm.org/citation.cfm?id=1411203.1411236},
1282−volume = {30},
1253+volume = {43},
1283−year = {2000}
1254+year = {2008}
1256+@misc{altenkirch2005dependent,
1257+author = {Altenkirch, T. and McBride, C. and McKinna, J.},
1258+booktitle = {Manuscript, available online},
1259+file = {:home/edwin/Research/Papers/Mendeley/Altenkirch, McBride, McKinna/Altenkirch, McBride, McKinna - 2005 - Why dependent types matter.pdf:pdf},
1260+title = {{Why dependent types matter}},
1261+url = {http://www.cs.nott.ac.uk/$\sim$txa/talks/splst11.pdf},
1264+@inproceedings{augustsson1999exercise,
1265+author = {Augustsson, L. and Carlsson, M.},
1266+booktitle = {In Workshop on Dependent Types in Programming, Gothenburg},
1268+mendeley-tags = {Depe},
1269+publisher = {Citeseer},
1270+title = {{An exercise in dependent types: A well-typed interpreter}},
1271+url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.2895},
1274+@article{Swierstra2011,
1275+author = {Swierstra, W},
1276+file = {:home/edwin/Research/Papers/Mendeley/Swierstra/Swierstra - 2011 - Sorted Verifying the Problem of the {Dutch National} Flag in {Agda}.pdf:pdf},
1277+journal = {Journal of Functional Programming},
1279+pages = {575----583},
1280+title = {{Sorted: Verifying the Problem of the {Dutch National} Flag in {Agda}}},
1281+url = {http://journals.cambridge.org/abstract_S0956796811000207},