@@ -0,0 +1,992 @@
1+Automatically generated by Mendeley 1.3.1
2+Any changes to this file will be lost if it is regenerated by Mendeley.
4+@inproceedings{Levitation2010,
5+author = {Chapman, James and Dagand, Pierre-Evariste and McBride, Conor and Morris, Peter},
6+booktitle = {ICFP15th ACM SIGPLAN International Conference on Functional programming (ICFP '10)},
7+doi = {10.1145/1932681.1863547},
8+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Chapman et al. - 2010 - The gentle art of levitation.pdf:pdf},
9+isbn = {978-1-60558-794-3},
11+keywords = {Dependent Types,data structure,metaprogramming,monads,proof assistants,type systems},
12+mendeley-tags = {Dependent Types},
16+title = {{The gentle art of levitation}},
17+url = {http://dl.acm.org/citation.cfm?id=1932681.1863547},
22+author = {Brady, E and Hammond, K},
23+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady, Hammond - 2006 - A verified staged interpreter is a verified compiler.pdf:pdf},
24+journal = {\ldots of the 5th international conference on \ldots},
25+keywords = {Dependent Types},
26+mendeley-tags = {Dependent Types},
27+title = {{A verified staged interpreter is a verified compiler}},
28+url = {http://portal.acm.org/citation.cfm?id=1173706.1173724},
31+@article{Chapman2005epigram,
32+author = {Chapman, James and Altenkirch, Thorsten and McBride, Conor},
33+file = {:Users/edwin/Documents/Papers/Chapman/2005 Chapman-Epigram reloaded a standalone typechecker.pdf:pdf},
34+journal = {Trends in Functional Programming},
35+publisher = {Intellect Books},
36+title = {{Epigram Reloaded: A Standalone Typechecker for {ETT}}},
37+url = {http://books.google.co.uk/books?hl=en&lr=&id=p0yV1sHLubcC&oi=fnd&pg=PA79&dq=epigram+reloaded&ots=x50ou0VMsm&sig=7TjAGohIatNLTWsHcuNcK5hEGGY},
41+author = {McBride, Conor and Paterson, Ross},
42+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride, Paterson - 2007 - Applicative programming with effects.pdf:pdf},
43+journal = {Journal of functional programming},
44+title = {{Applicative programming with effects}},
45+url = {http://journals.cambridge.org/abstract_S0956796807006326},
48+@misc{dagand2011transporting,
49+author = {Dagand, Pierre-Evariste and McBride, Conor},
50+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Dagand, McBride - 2011 - Transporting Functions across Ornaments.pdf:pdf},
51+title = {{Transporting Functions across Ornaments}},
52+url = {http://personal.cis.strath.ac.uk/$\sim$dagand/stuffs/paper-2011-patch/paper.pdf},
55+@inproceedings{Brady2003,
56+author = {Brady, Edwin and McBride, Conor and McKinna, James},
57+booktitle = {Types for Proofs and Programs},
58+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady, McBride, McKinna - 2003 - Inductive families need not store their indices.pdf:pdf},
59+keywords = {Dependent Types},
60+mendeley-tags = {Dependent Types},
61+title = {{Inductive families need not store their indices}},
62+url = {http://www.springerlink.com/index/WBXJJG717N2W3NU2.pdf},
65+@inproceedings{norell2009dependently,
66+author = {Norell, Ulf},
67+booktitle = {Advanced Functional Programming},
68+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Norell - 2009 - Dependently typed programming in Agda.pdf:pdf},
69+keywords = {Dependent Types},
70+mendeley-tags = {Dependent Types},
72+publisher = {Springer},
73+title = {{Dependently typed programming in Agda}},
74+url = {http://www.springerlink.com/index/8X0H38858233VN26.pdf},
77+@article{mcbride2010ornamental,
78+author = {McBride, Conor},
79+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride - 2010 - Ornamental algebras, algebraic ornaments.pdf:pdf},
80+journal = {Journal of Functional Programming},
81+title = {{Ornamental algebras, algebraic ornaments}},
82+url = {http://personal.cis.strath.ac.uk/$\sim$conor/pub/OAAO/Ornament.pdf},
86+author = {Brooks, Fred},
87+doi = {10.1093/epirev/mxr031},
88+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 5.pdf:pdf},
89+isbn = {9780321702081},
94+title = {{The Design of Design Chapter 5}},
97+@inproceedings{brady2011epic,
98+author = {Brady, Edwin},
99+booktitle = {Trends in Functional Programming ({TFP}’11)},
100+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady - 2011 - Epic—A Library for Generating Compilers.pdf:pdf},
101+title = {{Epic --- A Library for Generating Compilers}},
102+url = {http://scholar.google.co.uk/scholar?cites=2588300990390214449&as_sdt=2005&sciodt=0,5&hl=en#1},
105+@inproceedings{chlipala2010ur,
106+author = {Chlipala, Adam},
107+booktitle = {ACM SIGPLAN Notices},
108+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Chlipala - 2010 - Ur statically-typed metaprogramming with type-level record computation.pdf:pdf},
112+title = {{Ur: statically-typed metaprogramming with type-level record computation}},
113+url = {http://dl.acm.org/citation.cfm?id=1806612},
117+@article{loh2010tutorial,
118+author = {L\"{o}h, A. and McBride, C. and Swierstra, W.},
119+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/L\"{o}h, McBride, Swierstra - 2010 - A tutorial implementation of a dependently typed lambda calculus.pdf:pdf},
120+journal = {Fundamenta Informaticae},
123+publisher = {IOS Press},
124+title = {{A tutorial implementation of a dependently typed lambda calculus}},
125+url = {http://iospress.metapress.com/index/976W4716TM79M6U8.pdf},
129+@inproceedings{Brady2010,
130+author = {Brady, Edwin and Hammond, Kevin},
131+booktitle = {Proceedings of the 15th ACM SIGPLAN international conference on Functional programming},
132+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady, Hammond - 2010 - Scrapping your inefficient engine using partial evaluation to improve domain-specific language implementation.pdf:pdf},
133+isbn = {9781605587943},
134+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},
135+mendeley-tags = {Dependent Types},
138+title = {{Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation}},
139+url = {http://portal.acm.org/citation.cfm?id=1863587},
143+author = {Robbins, A and Hannah, E and Lamb, L},
144+doi = {10.1093/epirev/mxr031},
145+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Robbins, Hannah, Lamb - Unknown - Learning the vi and Vim Editors.pdf:pdf},
146+isbn = {9780596529833},
149+title = {{Learning the vi and Vim Editors}}
151+@article{Haskell2012a,
152+author = {Biancuzzi, F and Warden, S},
153+doi = {10.1093/epirev/mxr031},
154+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Biancuzzi, Warden - Unknown - Masterminds of Programming Chapter 8.pdf:pdf},
155+isbn = {9780596801670},
158+title = {{Masterminds of Programming Chapter 8}}
160+@inproceedings{Brady2006b,
161+author = {Brady, Edwin},
162+booktitle = {Implementation and Application of Functional Languages ({IFL}'06)},
163+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady - 2006 - Ivor, a proof engine.pdf:pdf},
164+isbn = {978-3-540-74129-9},
166+pages = {145----162},
167+title = {{Ivor, a proof engine}},
168+url = {http://dl.acm.org/citation.cfm?id=1757028.1757037},
172+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.},
173+author = {Hoare, C A R},
174+doi = {10.1016/0167-6423(87)90028-1},
175+editor = {McKeag, R M and Macnaghten, A M},
176+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Hoare - 1978 - Communicating sequential processes.pdf:pdf},
179+journal = {Communications of the ACM},
182+pmid = {2142694823583477576},
184+series = {International Series in Computer Science},
185+title = {{Communicating sequential processes}},
186+url = {http://linkinghub.elsevier.com/retrieve/pii/0167642387900281},
190+@inproceedings{Sheard2005,
191+address = {New York, New York, USA},
192+author = {Sheard, Tim},
193+booktitle = {Proceedings of the 2005 ACM SIGPLAN workshop on Haskell - Haskell '05},
194+doi = {10.1145/1088348.1088356},
195+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Sheard - 2005 - Putting curry-howard to work.pdf:pdf},
197+keywords = {GADT,curry-howard isomorphism,extensional kind system,haskell,logic},
200+publisher = {ACM Press},
201+title = {{Putting curry-howard to work}},
202+url = {http://dl.acm.org/citation.cfm?id=1088348.1088356},
205+@inproceedings{Pasalic2002,
206+author = {Pa\v{s}alic, Emir and Taha, Walid and Sheard, Tim},
207+booktitle = {International Conference on Functional Programming},
208+doi = {10.1145/583852.581499},
209+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Pa\v{s}alic, Taha, Sheard - 2002 - Tagless staged interpreters for typed languages.pdf:pdf},
210+isbn = {1-58113-487-8},
212+keywords = {calculus of constructions,definitional interpreters,domain-specific languages,multi-stage programming},
216+title = {{Tagless staged interpreters for typed languages}},
217+url = {http://dl.acm.org/citation.cfm?id=583852.581499},
221+@inproceedings{gibbons2011modularising,
222+author = {Gibbons, J. and Ko, H.S. and Others},
223+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
224+title = {{Modularising inductive families}},
225+url = {http://www.cs.ox.ac.uk/publications/publication5008-abstract.html},
228+@inproceedings{NanevskiAAMorrisett2008,
229+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.},
230+author = {{Nanevski A A Morrisett}, G B Shinnar A B Govereau P B Birkedal L C},
231+booktitle = {International Conference on Functional Programming},
232+doi = {10.1145/1411204.1411237},
233+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Nanevski A A Morrisett - 2008 - Ynot Dependent types for imperative programs.pdf:pdf},
234+isbn = {9781595939197},
236+keywords = {Dependent Types},
237+mendeley-tags = {Dependent Types},
240+title = {{Ynot: Dependent types for imperative programs}},
241+url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67650032847&partnerID=40&md5=7a5be3083878399cebafda33b1affa6b},
245+@article{mccann2000packet,
246+author = {McCann, P.J. and Chandra, S.},
247+journal = {ACM SIGCOMM Computer Communication Review},
251+title = {{Packet types: abstract specification of network protocol messages}},
252+url = {http://dl.acm.org/citation.cfm?id=347563},
256+@inproceedings{lempsink2009type,
257+author = {Lempsink, E. and Leather, S. and L\"{o}h, A.},
258+booktitle = {Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming},
259+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Lempsink, Leather, L\"{o}h - 2009 - Type-safe diff for families of datatypes.pdf:pdf},
262+title = {{Type-safe diff for families of datatypes}},
263+url = {http://dl.acm.org/citation.cfm?id=1596624},
266+@inproceedings{augustsson1999exercise,
267+author = {Augustsson, L. and Carlsson, M.},
268+booktitle = {In Workshop on Dependent Types in Programming, Gothenburg},
270+mendeley-tags = {Depe},
271+publisher = {Citeseer},
272+title = {{An exercise in dependent types: A well-typed interpreter}},
273+url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.2895},
276+@article{McBride2005,
277+author = {McBride, Conor},
278+editor = {Vene, Varmo and Uustalu, Tarmo},
280+journal = {Advanced Functional Programming},
281+keywords = {Dependent Types},
282+mendeley-tags = {Dependent Types},
284+publisher = {Springer},
285+series = {Lecture Notes in Computer Science},
286+title = {{Epigram: Practical programming with dependent types}},
287+url = {http://www.springerlink.com/index/96j7v5vn8tyebeky.pdf},
291+@book{peyton1987implementation,
292+author = {{Peyton Jones}, S.L.},
293+publisher = {Prentice-Hall, Inc.},
294+title = {{The implementation of functional programming languages (prentice-hall international series in computer science)}},
295+url = {http://dl.acm.org/citation.cfm?id=1096899},
299+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.},
300+author = {Jones, Mark P},
302+publisher = {Citeseer},
303+title = {{Typing Haskell in Haskell}},
304+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.134.7274&rep=rep1&type=pdf},
308+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.},
309+author = {Bove, Ana and Dybjer, Peter},
311+doi = {10.1007/978-3-642-03153-3_2},
312+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Bove, Dybjer - 2008 - Dependent Types at Work.pdf:pdf},
315+publisher = {Springer},
316+title = {{Dependent Types at Work}},
317+url = {http://www.springerlink.com/index/1039q8qk71257677.pdf},
321+@inproceedings{madhavapeddy2010turning,
322+author = {Madhavapeddy, A. and Mortier, R. and Sohan, R. and Gazagnaire, T. and Hand, S. and Deegan, T. and McAuley, D. and Crowcroft, J.},
323+booktitle = {Proceedings of the 2nd USENIX conference on Hot topics in cloud computing},
324+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Madhavapeddy et al. - 2010 - Turning down the LAMP software specialisation for the cloud.pdf:pdf},
325+publisher = {USENIX Association},
326+title = {{Turning down the LAMP: software specialisation for the cloud}},
327+url = {http://dl.acm.org/citation.cfm?id=1863114},
330+@article{gordon2003authenticity,
331+author = {Gordon, A.D. and Jeffrey, A.},
332+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Gordon, Jeffrey - 2003 - Authenticity by typing for security protocols.pdf:pdf},
333+journal = {Journal of computer security},
336+publisher = {IOS Press},
337+title = {{Authenticity by typing for security protocols}},
338+url = {http://iospress.metapress.com/index/BHQQUFRA1C7W8TLY.pdf},
342+@inproceedings{ko2011modularising,
343+author = {Ko, H.S. and Gibbons, J.},
344+booktitle = {Proceedings of the seventh ACM SIGPLAN workshop on Generic programming},
347+title = {{Modularising inductive families}},
348+url = {http://dl.acm.org/citation.cfm?id=2036921},
352+author = {L\"{a}mmel, R. and Jones, S.P.},
353+booktitle = {ACM SIGPLAN Notices},
354+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/L\"{a}mmel, Jones - 2003 - Scrap your boilerplate a practical design pattern for generic programming.pdf:pdf},
358+title = {{Scrap your boilerplate: a practical design pattern for generic programming}},
359+url = {http://dl.acm.org/citation.cfm?id=640136.604179},
363+@inproceedings{bhargavan2010modular,
364+author = {Bhargavan, K. and Fournet, C. and Gordon, A.D.},
365+booktitle = {ACM Sigplan Notices},
369+title = {{Modular verification of security protocol code by typing}},
370+url = {http://dl.acm.org/citation.cfm?id=1707801.1706350},
374+@inproceedings{stump2010resource,
375+author = {Stump, A. and Austin, E.},
376+booktitle = {Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification},
377+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Stump, Austin - 2010 - Resource typing in Guru.pdf:pdf},
380+title = {{Resource typing in Guru}},
381+url = {http://dl.acm.org/citation.cfm?id=1707796},
384+@phdthesis{norell2007thesis,
385+author = {Norell, Ulf},
386+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Norell - 2007 - Towards a practical programming language based on dependent type theory.pdf:pdf},
387+keywords = {Dependent Types},
388+mendeley-tags = {Dependent Types},
389+publisher = {Citeseer},
390+school = {Chalmers University of Technology},
391+title = {{Towards a practical programming language based on dependent type theory}},
392+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.65.7934&rep=rep1&type=pdf},
395+@article{Epstein2011,
396+author = {Epstein, Jeff and Black, Andrew P and Peyton-jones, Simon},
397+institution = {Microsoft Research},
398+journal = {researchmicrosoftcom},
399+number = {Section 8},
401+title = {{Haskell for the cloud}},
402+url = {http://research.microsoft.com/en-us/um/people/simonpj/papers/parallel/remote.pdf},
405+@inproceedings{Visser2008,
406+author = {Visser, E},
407+booktitle = {Generative and Transformational Techniques in Software Engineering},
408+title = {{WebDSL: A case study in domain-specific language engineering}},
409+url = {http://www.springerlink.com/index/A3213003X6268032.pdf},
412+@inproceedings{taha1997multi,
413+author = {Taha, W. and Sheard, T.},
414+booktitle = {ACM SIGPLAN Notices},
418+title = {{Multi-stage programming with explicit annotations}},
419+url = {http://dl.acm.org/citation.cfm?id=259019},
424+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.},
425+author = {Hughes, J},
427+doi = {10.1093/comjnl/32.2.98},
428+editor = {Turner, David A},
429+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Hughes - 1989 - Why Functional Programming Matters.pdf:pdf},
430+institution = {Programming Methodology Group, University of {G\"{o}teborg} and Chalmers Institute of Technology, Sweden},
433+journal = {The Computer Journal},
436+publisher = {Br Computer Soc},
437+title = {{Why Functional Programming Matters}},
438+url = {http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/32.2.98},
442+@article{marlow2006making,
443+author = {Marlow, S. and {Peyton Jones}, S.},
444+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Marlow, Peyton Jones - 2006 - Making a fast curry pushenter vs. evalapply for higher-order languages.pdf:pdf},
445+journal = {Journal of Functional Programming},
448+publisher = {Cambridge University Press},
449+title = {{Making a fast curry: push/enter vs. eval/apply for higher-order languages}},
450+url = {http://dl.acm.org/citation.cfm?id=1166018},
454+@article{Mandelbaum2007,
455+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.},
456+author = {Mandelbaum, Yitzhak and Fisher, Kathleen and Walker, David and Fernandez, Mary and Gleyzer, Artem},
457+doi = {10.1145/1190215.1190231},
460+journal = {SIGPLAN Not},
465+title = {{PADS/ML: a functional data description language}},
466+url = {http://doi.acm.org/10.1145/1190216.1190231},
470+@phdthesis{McBride1999,
471+author = {McBride, Conor},
472+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride - 1999 - Dependently typed functional programs and their proofs.pdf:pdf},
473+keywords = {Dependent Types},
474+mendeley-tags = {Dependent Types},
475+school = {University of Edinburgh},
476+title = {{Dependently typed functional programs and their proofs}},
477+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.4785&rep=rep1&type=pdf},
480+@inproceedings{oury2008power,
481+author = {Oury, N. and Swierstra, W.},
482+booktitle = {International Conference on Functional Programming},
483+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Oury, Swierstra - 2008 - The power of Pi.pdf:pdf},
484+keywords = {Dependent Types},
485+mendeley-tags = {Dependent Types},
489+title = {{The power of Pi}},
490+url = {http://dl.acm.org/citation.cfm?id=1411213},
494+@inproceedings{atkey2009unembedding,
495+author = {Atkey, R. and Lindley, S. and Yallop, J.},
496+booktitle = {Proceedings of the 2nd ACM SIGPLAN symposium on Haskell},
499+title = {{Unembedding domain-specific languages}},
500+url = {http://dl.acm.org/citation.cfm?id=1596644},
504+author = {Abel, Andreas},
505+booktitle = {Language},
506+file = {:Users/edwin/Downloads/10.1.1.44.3494.pdf:pdf},
507+title = {{foetus - Termination Checker for Simple Functional Programs}},
510+@inproceedings{Brady2005a,
511+author = {Brady, E and Hammond, K},
512+booktitle = {Implementation and Application of Functional \ldots},
513+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady, Hammond - 2005 - A dependently typed framework for static analysis of program execution costs.pdf:pdf},
514+keywords = {Dependent Types},
515+mendeley-tags = {Dependent Types},
516+title = {{A dependently typed framework for static analysis of program execution costs}},
517+url = {http://www.springerlink.com/index/P446P2HH70107759.pdf},
520+@misc{altenkirch2005dependent,
521+author = {Altenkirch, T. and McBride, C. and McKinna, J.},
522+booktitle = {Manuscript, available online},
523+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Altenkirch, McBride, McKinna - 2005 - Why dependent types matter.pdf:pdf},
524+title = {{Why dependent types matter}},
525+url = {http://www.cs.nott.ac.uk/$\sim$txa/talks/splst11.pdf},
528+@misc{Resolution2012a,
529+author = {Fall, Kevin R and Stevens, W. Richard},
530+doi = {10.1093/epirev/mxr031},
531+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Fall, Stevens - Unknown - TCPIP Illustrated Volume 1 Chapter 11.pdf:pdf},
534+title = {{TCP/IP Illustrated Volume 1 Chapter 11}}
536+@inproceedings{madhavapeddy2007melange,
537+author = {Madhavapeddy, A. and Ho, A. and Deegan, T. and Scott, D. and Sohan, R.},
538+booktitle = {ACM SIGOPS Operating Systems Review},
539+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Madhavapeddy et al. - 2007 - Melange creating a functional internet.pdf:pdf},
543+title = {{Melange: creating a functional internet}},
544+url = {http://dl.acm.org/citation.cfm?id=1273009},
549+author = {Brooks, Fred},
550+doi = {10.1093/epirev/mxr031},
551+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 1.pdf:pdf},
552+isbn = {9780321702081},
555+title = {{The Design of Design Chapter 1}}
557+@phdthesis{Brady2005,
558+author = {Brady, Edwin},
559+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady - 2005 - Practical Implementation of a Dependently Typed Functional Programming \ldots.pdf:pdf},
560+keywords = {Dependent Types},
561+mendeley-tags = {Dependent Types},
562+school = {University of Durham},
563+title = {{Practical Implementation of a Dependently Typed Functional Programming Language}},
564+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.150.8284&rep=rep1&type=pdf},
567+@inproceedings{swierstra2007beauty,
568+author = {Swierstra, W. and Altenkirch, T.},
569+booktitle = {Proceedings of the ACM SIGPLAN workshop on Haskell workshop},
570+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Swierstra, Altenkirch - 2007 - Beauty in the beast.pdf:pdf},
573+title = {{Beauty in the beast}},
574+url = {http://dl.acm.org/citation.cfm?id=1291206},
577+@article{McBride2004a,
578+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.},
579+author = {McBride, Conor and McKinna, James},
580+doi = {10.1017/S0956796803004829},
581+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride, McKinna - 2004 - The view from the left.pdf:pdf},
583+journal = {Journal of Functional Programming},
584+keywords = {Dependent Types},
585+mendeley-tags = {Dependent Types},
588+publisher = {Cambridge University Press},
589+title = {{The view from the left}},
590+url = {http://www.journals.cambridge.org/abstract_S0956796803004829},
594+@inproceedings{Augustsson1998,
595+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.},
596+author = {Augustsson, Lennart},
597+booktitle = {International Conference on Functional Programming},
598+doi = {10.1097/MEG.0b013e328342f213},
599+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Augustsson - 1998 - Cayenne - a language with dependent types.pdf:pdf},
601+keywords = {Depe,Dependent Types},
602+mendeley-tags = {Depe,Dependent Types},
606+publisher = {ACM Press},
607+title = {{Cayenne - a language with dependent types}},
608+url = {http://www.cs.chalmers.se/$\sim$augustss/cayenne/paper.ps},
612+@article{fisher2006next,
613+author = {Fisher, K. and Mandelbaum, Y. and Walker, D.},
614+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Fisher, Mandelbaum, Walker - 2010 - The next 700 data description languages.pdf:pdf},
615+journal = {Journal of the ACM},
619+title = {{The next 700 data description languages}},
620+url = {http://dl.acm.org/citation.cfm?id=1111039},
624+@inproceedings{Wadler1989,
625+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.},
626+author = {Wadler, Philip},
627+booktitle = {Proceedings of the fourth international conference on Functional programming languages and computer architecture},
628+doi = {10.1145/99370.99404},
629+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Wadler - 1989 - Theorems for free!.pdf:pdf},
635+title = {{Theorems for free!}},
636+url = {http://portal.acm.org/citation.cfm?id=99404},
639+@misc{Protocols2012a,
640+author = {Anderson, Ross},
641+doi = {10.1093/epirev/mxr031},
642+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Anderson - Unknown - Security Engineering Chapter 3.pdf:pdf},
643+isbn = {9780470068526},
646+title = {{Security Engineering Chapter 3}}
648+@inproceedings{barras2008implicit,
649+author = {Barras, B. and Bernardo, B.},
650+booktitle = {Foundations of Software Science and Computational Structures},
651+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Barras, Bernardo - 2008 - The implicit calculus of constructions as a programming language with dependent types.pdf:pdf},
653+publisher = {Springer},
654+title = {{The implicit calculus of constructions as a programming language with dependent types}},
655+url = {http://www.springerlink.com/index/m84h82904546l265.pdf},
658+@article{landin1966next,
659+author = {Landin, P.J.},
660+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Landin - 1966 - The next 700 programming languages.pdf:pdf},
661+journal = {Communications of the ACM},
665+title = {{The next 700 programming languages}},
666+url = {http://dl.acm.org/citation.cfm?id=365257 )},
671+author = {Brooks, Fred},
672+doi = {10.1093/epirev/mxr031},
673+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 2.pdf:pdf},
674+isbn = {9780321702081},
677+title = {{The Design of Design Chapter 2}}
680+author = {Brooks, Fred},
681+doi = {10.1093/epirev/mxr031},
682+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 3.pdf:pdf},
683+isbn = {9780321702081},
686+title = {{The Design of Design Chapter 3}}
689+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.},
690+author = {Abel, Andreas},
691+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Abel - 2010 - MiniAgda Integrating Sized and Dependent Types.pdf:pdf},
694+title = {{MiniAgda: Integrating Sized and Dependent Types}},
695+url = {http://arxiv.org/abs/1012.4896},
700+author = {Bird, Richard},
701+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Bird - 2010 - Pearls of Functional Algorithm Design.pdf:pdf},
702+isbn = {9780521513388},
703+title = {{Pearls of Functional Algorithm Design}},
706+@inproceedings{czarnecki2004dsl,
707+author = {Czarnecki, K. and O’Donnell, J. and Striegnitz, J. and Taha, W.},
708+booktitle = {Domain-Specific Program Generation},
709+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Czarnecki et al. - 2004 - DSL implementation in MetaOCaml, Template Haskell, and C.pdf:pdf},
711+publisher = {Springer},
712+title = {{DSL implementation in MetaOCaml, Template Haskell, and C++}},
713+url = {http://www.springerlink.com/index/NL620EL7N94M161H.pdf},
716+@article{danielsson2011parsing,
717+author = {Danielsson, N. and Norell, U.},
718+journal = {Implementation and Application of Functional Languages},
720+publisher = {Springer},
721+title = {{Parsing mixfix operators}},
722+url = {http://www.springerlink.com/index/386243257W504252.pdf},
726+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.},
727+author = {Jones, Simon Peyton},
728+editor = {Jones, Simon Peyton},
730+journal = {Language},
732+publisher = {Cambridge University Press},
733+title = {{Haskell 98 Language and Libraries The Revised Report}},
734+url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0521826144},
738+@article{Altenkirch2010a,
739+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.},
740+author = {Altenkirch, Thorsten and Mcbride, Conor and Morris, Peter},
741+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Altenkirch, Mcbride, Morris - 2010 - Generic Programming with Dependent Types.pdf:pdf},
742+journal = {Citeseer},
743+publisher = {Citeseer},
744+title = {{Generic Programming with Dependent Types}},
745+url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.129.2926&rep=rep1&type=pdf},
748+@phdthesis{Okasaki1996,
749+author = {Okasaki, Chris},
750+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Okasaki - 1996 - Purely Functional Data Structures.pdf:pdf},
751+school = {Carnegie Mellon University},
752+title = {{Purely Functional Data Structures}},
755+@misc{altenkirch2008nσ,
756+author = {Altenkirch, T. and Oury, N.},
757+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Altenkirch, Oury - 2008 - $Pi$$Sigma$ A Core Language for Dependently Typed Programming.pdf:pdf},
758+title = {{$\Pi$$\Sigma$: A Core Language for Dependently Typed Programming}},
759+url = {http://verse.aasemoon.com/images/6/6f/PiSigma.pdf},
762+@inproceedings{Brady2011a,
763+address = {New York, New York, USA},
764+author = {Brady, Edwin},
765+booktitle = {Proceedings of the 5th {ACM} workshop on Programming languages meets program verification - {PLPV} '11},
766+doi = {10.1145/1929529.1929536},
767+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brady - 2011 - Idris --- Systems Programming Meets Full Dependent Types.pdf:pdf},
768+isbn = {9781450304870},
769+keywords = {Dependent Types,data description,dependent types},
770+mendeley-tags = {Dependent Types},
772+publisher = {ACM Press},
773+title = {{Idris --- Systems Programming Meets Full Dependent Types}},
774+url = {http://dl.acm.org/citation.cfm?id=1929529.1929536},
777+@article{Steiner1988,
778+author = {Steiner, JG},
779+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Steiner - 1988 - Kerberos An authentication service for open network systems.pdf:pdf},
780+journal = {Proc. Winter USENIX Conference},
781+title = {{Kerberos: An authentication service for open network systems}},
782+url = {http://www.cse.nd.edu/$\sim$dthain/courses/cse598z/fall2004/papers/kerberos.pdf},
785+@inproceedings{augustsson2008paradise,
786+author = {Augustsson, L. and Mansell, H. and Sittampalam, G.},
787+booktitle = {International Conference on Functional Programming},
788+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Augustsson, Mansell, Sittampalam - 2008 - Paradise a two-stage DSL embedded in Haskell.pdf:pdf},
792+title = {{Paradise: a two-stage DSL embedded in Haskell}},
793+url = {http://dl.acm.org/citation.cfm?id=1411203.1411236},
798+author = {Brooks, Fred},
799+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Brooks - Unknown - The Design of Design Chapter 4.pdf:pdf},
800+isbn = {9780321702081},
801+title = {{The Design of Design Chapter 4}}
803+@article{burrows1990,
804+author = {Burrows, Michael and Abadi, Martin and Needham, Roger},
805+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Burrows, Abadi, Needham - 1990 - A logic of authentication.pdf:pdf},
806+journal = {ACM Transactions on Computer Systems},
808+title = {{A logic of authentication}},
809+url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.3569},
813+@misc{TheMendeleySupportTeam2011,
814+abstract = {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.},
816+author = {{The Mendeley Support Team}},
817+booktitle = {Mendeley Desktop},
818+file = {:Applications/Mendeley Desktop.app/Contents/Resources/FAQ.pdf:pdf},
819+keywords = {Mendeley,how-to,user manual},
821+publisher = {Mendeley Ltd.},
822+title = {{Getting Started with Mendeley}},
823+url = {http://www.mendeley.com},
826+@misc{Interface2012a,
827+author = {Kreibich, Jay A.},
828+doi = {10.1093/epirev/mxr031},
829+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Kreibich - Unknown - Using SQLite Chapter 7.pdf:pdf},
830+isbn = {9781449394592},
833+title = {{Using SQLite Chapter 7}}
835+@misc{pollack1997believe,
836+author = {Pollack, R.},
837+file = {:Users/edwin/Documents/Papers/Pollack/1997 Pollack-How to Believe a Machine-Checked.pdf:pdf},
838+title = {{How to believe a machine-checked proof}},
839+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},
842+@inproceedings{ko2011modularising,
843+author = {Ko, H.S. and Gibbons, J.},
844+booktitle = {Proceedings of the seventh ACM SIGPLAN workshop on Generic programming},
845+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Ko, Gibbons - 2011 - Modularising inductive families.pdf:pdf},
848+title = {{Modularising inductive families}},
849+url = {http://www.cs.ox.ac.uk/publications/publication5008-abstract.html http://dl.acm.org/citation.cfm?id=2036921},
852+@article{mcbride2008functional,
853+author = {McBride, C. and Paterson, R.},
854+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride, Paterson - 2008 - Functional pearl Applicative programming with effects.pdf:pdf},
855+journal = {Journal of functional programming},
858+publisher = {Cambridge Univ Press},
859+title = {{Functional pearl: Applicative programming with effects}},
860+url = {http://journals.cambridge.org/production/action/cjoGetFulltext?fulltextid=1457860},
864+@article{Altenkirch2010,
865+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.},
866+author = {Altenkirch, Thorsten and Danielsson, Nils Anders and L, Andres and Oury, Nicolas},
867+doi = {10.1007/978-3-642-12251-4_5},
868+editor = {Blume, Matthias and Kobayashi, Naoki and Vidal, Germ\'{a}n},
869+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Altenkirch et al. - 2010 - Dependent Types without the Sugar.pdf:pdf},
870+isbn = {9783642122507},
871+journal = {Computing},
872+number = {Sheard 2005},
874+publisher = {Springer Berlin Heidelberg},
875+series = {Lecture Notes in Computer Science},
876+title = {{Dependent Types without the Sugar}},
877+url = {http://www.springerlink.com/index/91W712G2806R575H.pdf},
881+@inproceedings{morris2006exploring,
882+author = {Morris, P. and Altenkirch, T. and McBride, C.},
883+booktitle = {Types for Proofs and Programs},
884+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Morris, Altenkirch, McBride - 2006 - Exploring the regular tree types.pdf:pdf},
886+publisher = {Springer},
887+title = {{Exploring the regular tree types}},
888+url = {http://www.springerlink.com/index/f9p1317716614834.pdf},
891+@inproceedings{Xi1999,
892+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.},
893+author = {Xi, Hongwei and Pfenning, Frank},
894+booktitle = {Proceedings of the 26th ACM SIGPLANSIGACT symposium on Principles of programming languages POPL 99},
895+doi = {10.1145/292540.292560},
896+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Xi, Pfenning - 1999 - Dependent types in practical programming.pdf:pdf},
899+keywords = {Dependent Types},
900+mendeley-tags = {Dependent Types},
901+organization = {Carnegie Mellon University},
903+publisher = {ACM Press},
905+title = {{Dependent types in practical programming}},
906+url = {http://portal.acm.org/citation.cfm?doid=292540.292560},
911+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.},
912+author = {Wadler, Philip},
913+doi = {10.1007/3-540-59451-5_2},
914+editor = {Jeuring, Johan and Meijer, Erik},
915+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Wadler - 2001 - Monads for functional programming.pdf:pdf},
918+journal = {Advanced Functional Programming},
919+number = {August 1992},
921+publisher = {Springer},
922+series = {Lecture Notes in Computer Science},
923+title = {{Monads for functional programming}},
924+url = {http://www.springerlink.com/index/715264614rh13340.pdf},
928+@inproceedings{taha2004gentle,
930+booktitle = {Domain-Specific Program Generation},
932+publisher = {Springer},
933+title = {{A gentle introduction to multi-stage programming}},
934+url = {http://www.springerlink.com/index/JEMT0D8VYN5JB2L8.pdf},
937+@inproceedings{McBride2004b,
938+author = {McBride, Conor and McKinna, James},
939+booktitle = {Haskell Workshop},
940+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/McBride, McKinna - 2004 - I am not a number I am a free variable.pdf:pdf},
941+title = {{I am not a number : I am a free variable}},
944+@inproceedings{fisher2005pads,
945+author = {Fisher, K. and Gruber, R.},
946+booktitle = {ACM SIGPLAN Notices},
950+title = {{PADS: a domain-specific language for processing ad hoc data}},
951+url = {http://dl.acm.org/citation.cfm?id=1065046},
955+@article{Okasaki1993,
956+author = {Okasaki, Chris},
957+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Okasaki - 1993 - Red-Black Trees in A Functional Setting.pdf:pdf},
958+journal = {Journal of functional programming},
959+title = {{Red-Black Trees in A Functional Setting}},
963+author = {Anderson, Ross},
964+doi = {10.1093/epirev/mxr031},
965+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Anderson - Unknown - Security Engineering Chapter 18.pdf:pdf},
966+isbn = {9780470068526},
971+title = {{Security Engineering Chapter 18}},
975+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.},
976+author = {Xi, Hongwei and Pfenning, Frank},
977+doi = {10.1145/277652.277732},
978+file = {:Users/edwin/Library/Application Support/Mendeley Desktop/Downloaded/Xi, Pfenning - 1998 - Eliminating array bound checking through dependent types.pdf:pdf},
981+journal = {ACM Sigplan Notices},
982+keywords = {Dependent Types},
983+mendeley-tags = {Dependent Types},
988+title = {{Eliminating array bound checking through dependent types}},
989+url = {http://portal.acm.org/citation.cfm?doid=277652.277732},