local.bib

@article{extended_version,
   author = {{Bernardy}, J.-P. and {Boespflug}, M. and {Newton}, R.~R. and {Jones}, S.~P. and {Spiwack}, A.},
   title = "{Linear Haskell: practical linearity in a higher-order polymorphic language}",
   journal = {ArXiv e-prints},
   archivePrefix = "arXiv",
   eprint = {1710.09756},
   keywords = {Computer Science - Programming Languages},
   year = 2017,
   month = oct,
   adsurl = {http://adsabs.harvard.edu/abs/2017arXiv171009756B},
   adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}

@Inbook{zhu_linear-views_2005,
  author="Zhu, Dengping and Xi, Hongwei",
  editor="Hermenegildo, Manuel V.  and Cabeza, Daniel",
  title="Safe Programming with Pointers Through Stateful Views",
  bookTitle="Practical Aspects of Declarative Languages: 7th International Symposium, PADL 2005, Long Beach, CA, USA, January 10-11, 2005. Proceedings",
  year="2005",
  publisher="Springer Berlin Heidelberg",
  address="Berlin, Heidelberg",
  pages="83--97",
  abstract="The need for direct memory manipulation through pointers is essential in many applications. However, it is also commonly understood that the use (or probably misuse) of pointers is often a rich source of program errors. Therefore, approaches that can effectively enforce safe use of pointers in programming are highly sought after. ATS is a programming language with a type system rooted in a recently developed framework Applied Type System, and a novel and desirable feature in ATS lies in its support for safe programming with pointers through a novel notion of stateful views. In particular, even pointer arithmetic is allowed in ATS and guaranteed to be safe by the type system of ATS. In this paper, we give an overview of this feature in ATS, presenting some interesting examples based on a prototype implementation of ATS to demonstrate the practicality of safe programming with pointer through stateful views.",
  isbn="978-3-540-30557-6",
  doi="10.1007/978-3-540-30557-6_8",
  url="https://doi.org/10.1007/978-3-540-30557-6_8"
}

@article{weirich_dependent-haskell_2017,
 author = {Weirich, Stephanie and Voizard, Antoine and de Amorim, Pedro Henrique Azevedo and Eisenberg, Richard A.},
 title = {A Specification for Dependent Types in Haskell},
 journal = {Proc. ACM Program. Lang.},
 issue_date = {September 2017},
 volume = {1},
 number = {ICFP},
 month = aug,
 year = {2017},
 issn = {2475-1421},
 pages = {31:1--31:29},
 articleno = {31},
 numpages = {29},
 url = {http://doi.acm.org/10.1145/3110275},
 doi = {10.1145/3110275},
 acmid = {3110275},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Dependent Types, Haskell},
}

@unpublished{atkey_qtt_2017,
  title={The Syntax and Semantics of Quantitative Type Theory},
  author={Atkey, Robert},
  year={2017},
  note={Under submission}
}

@article{brady_uniqueness_2017,
	author = {Edwin Brady},
	title = {Type-driven Development of Concurrent Communicating Systems},
	journal = {Computer Science},
	volume = {18},
	number = {3},
	year = {2017},
	keywords = {},
	abstract = {Modern software systems rely on communication, for example mobile applcations communicating with a central server, distributed systems coordinaing a telecommunications network, or concurrent systems handling events and processes in a desktop application. However, reasoning about concurrent prgrams is hard, since we must reason about each process and the order in which communication might happen between processes. In this paper, I describe a type-driven approach to implementing communicating concurrent programs, using the dependently typed programming language Idris. I show how the type system can be used to describe resource access protocols (such as controlling access to a file handle) and verify that programs correctly follow those prtools. Finally, I show how to use the type system to reason about the order of communication between concurrent processes, ensuring that each end of a communication channel follows a defined protocol.},
	issn = {2300-7036},
	url = {https://journals.agh.edu.pl/csci/article/view/1413},

}

@inproceedings{dolan_mlsub_2017,
 author = {Dolan, Stephen and Mycroft, Alan},
 title = {Polymorphism, Subtyping, and Type Inference in MLsub},
 booktitle = {Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages},
 series = {POPL 2017},
 year = {2017},
 isbn = {978-1-4503-4660-3},
 location = {Paris, France},
 pages = {60--72},
 numpages = {13},
 url = {http://doi.acm.org/10.1145/3009837.3009882},
 doi = {10.1145/3009837.3009882},
 acmid = {3009882},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Algebra, Polymorphism, Subtyping, Type Inference},
}

@inproceedings{amani_cogent_2016,
    doi              = {10.1145/2872362.2872404},
    author           = {Amani, Sidney and Hixon, Alex and Chen, Zilin and Rizkallah, Christine and Chubb, Peter and
                        O'Connor, Liam and Beeren, Joel and Nagashima, Yutaka and Lim, Japheth and Sewell, Thomas and Tuong,
                        Joseph and Keller, Gabriele and Murray, Toby and Klein, Gerwin and Heiser, Gernot},
    month            = apr,
    year             = {2016},
    title            = {{Cogent}: Verifying High-Assurance File System Implementations},
    booktitle        = {International Conference on Architectural Support for Programming Languages and Operating Systems},
    pages            = {175-188},
    address          = {Atlanta, GA, USA}
  }

@inproceedings{sulzmann_fc_2007,
 author = {Sulzmann, Martin and Chakravarty, Manuel M. T. and Jones, Simon Peyton and Donnelly, Kevin},
 title = {System F with Type Equality Coercions},
 booktitle = {Proceedings of the 2007 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation},
 series = {TLDI '07},
 year = {2007},
 isbn = {1-59593-393-X},
 location = {Nice, Nice, France},
 pages = {53--66},
 numpages = {14},
 url = {http://doi.acm.org/10.1145/1190315.1190324},
 doi = {10.1145/1190315.1190324},
 acmid = {1190324},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {advanced type features, typed intermediate language},
}

@mastersthesis{czaplicki_elm_2012,
  title={Elm: Concurrent {FRP} for functional guis},
  author={Czaplicki, Evan},
  type={Senior thesis},
  school={Harvard University},
  year={2012}
},

@inproceedings{eisenberg_levity_2017,
  author    = {Richard A. Eisenberg and
               Simon {Peyton Jones}},
  title     = {Levity polymorphism},
  booktitle = {Proceedings of the 38th {ACM} {SIGPLAN} Conference on Programming
               Language Design and Implementation, {PLDI} 2017, Barcelona, Spain,
               June 18-23, 2017},
  pages     = {525--539},
  year      = {2017},
  url       = {http://doi.acm.org/10.1145/3062341.3062357},
  doi       = {10.1145/3062341.3062357},
  timestamp = {Mon, 19 Jun 2017 08:37:26 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/pldi/EisenbergJ17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
},

@article{launchbury_state_1995,
  author    = {John Launchbury and
               Simon L. {Peyton Jones}},
  title     = {State in Haskell},
  journal   = {Lisp and Symbolic Computation},
  volume    = {8},
  number    = {4},
  pages     = {293--341},
  year      = {1995},
  timestamp = {Thu, 03 Jan 2002 12:25:42 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/lisp/LaunchburyJ95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
},

@inproceedings{strom_typestate_1983,
  title={Mechanisms for compile-time enforcement of security},
  author={Strom, Robert E},
  booktitle={Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages},
  pages={276--284},
  year={1983},
  organization={ACM}
},

@inproceedings{altenkirch_monads_2010,
  author    = {Thorsten Altenkirch and
               James Chapman and
               Tarmo Uustalu},
  title     = {Monads Need Not Be Endofunctors},
  booktitle = {Foundations of Software Science and Computational Structures, 13th
               International Conference, {FOSSACS} 2010, Held as Part of the Joint
               European Conferences on Theory and Practice of Software, {ETAPS} 2010,
               Paphos, Cyprus, March 20-28, 2010. Proceedings},
  pages     = {297--311},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-12032-9_21},
  doi       = {10.1007/978-3-642-12032-9_21},
  timestamp = {Fri, 02 Jun 2017 20:48:43 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/fossacs/AltenkirchCU10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
},

@inproceedings{devries_uniqueness_2007,
  author    = {Edsko de Vries and
               Rinus Plasmeijer and
               David M. Abrahamson},
  title     = {Uniqueness Typing Simplified},
  booktitle = {Implementation and Application of Functional Languages, 19th International
               Workshop, {IFL} 2007, Freiburg, Germany, September 27-29, 2007. Revised
               Selected Papers},
  pages     = {201--218},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-85373-2_12},
  doi       = {10.1007/978-3-540-85373-2_12},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ifl/VriesPA07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
},

@techreport{gunter_partial-big-step_1993,
  title={A proof-theoretic assessment of runtime type errors},
  author={Carl A. Gunter and Didier Rémy},
  institution ={AT\&T Bell laboratories},
  note={Technical Memo 11261-921230-43TM},
  year={1993}
},

@unpublished{chakravarty_spritekit_2017,
  author = {Manuel M. T. Chakravarty and Gabriele Keller},
  title = {Haskell SpriteKit -- Transforming an Imperative Object-oriented API into a Purely Functional One},
  year = {2017},
  url = {http://www.cse.unsw.edu.au/~chak/papers/CK17.html},
},

@inproceedings{igarashi_garbage_2000,
 author = {Atsushi Igarashi and Naoki Kobayashi},
 title = {Garbage Collection Based on a Linear Type System},
 booktitle = {Preliminary Proceedings of the 3rd ACM SIGPLAN Workshop on Types in Compilation (TIC2000)},
 year = {1999},
},

@inproceedings{mogensen_types_1997,
  author    = {Torben {\AE}. Mogensen},
  title     = {Types for 0, 1 or Many Uses},
  booktitle = {Implementation of Functional Languages, 9th International Workshop,
               IFL'97, St. Andrews, Scotland, UK, September 10-12, 1997, Selected
               Papers},
  pages     = {112--122},
  year      = {1997},
  url       = {https://doi.org/10.1007/BFb0055427},
  doi       = {10.1007/BFb0055427},
  timestamp = {Tue, 23 May 2017 11:53:58 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/ifl/Mogensen97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
},
@InProceedings{vollmer_gibbon_2017,
  author =	{Michael Vollmer and Sarah Spall and Buddhika Chamith and Laith Sakka and Chaitanya Koparkar and Milind Kulkarni and Sam Tobin-Hochstadt and Ryan R. Newton},
  title =	{{Compiling Tree Transforms to Operate on Packed Representations}},
  booktitle =	{31st European Conference on Object-Oriented Programming (ECOOP 2017)},
  pages =	{26:1--26:29},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-035-4},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{74},
  editor =	{Peter M{\"u}ller},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7273},
  URN =		{urn:nbn:de:0030-drops-72737},
  doi =		{10.4230/LIPIcs.ECOOP.2017.26},
  annote =	{Keywords: compiler optimization, program transformation, tree traversal}
}

@phdthesis{parente_logical_2015,
	author = {Bernardo {Parente Coutinho Fernandes Toninho}},
	title = {A Logical Foundation for Session-based Concurrent Computation},
	school = {Carnegie Mellon University and Universidade Nova de Lisboa},
	type = {PhD Thesis},
	year = {2015}
},

@article{balabonski_mezzo_2016,
 author = {Balabonski, Thibaut and Pottier, Fran\c{c}ois and Protzenko, Jonathan},
 title = {The Design and Formalization of Mezzo, a Permission-Based Programming Language},
 journal = {ACM Trans. Program. Lang. Syst.},
 issue_date = {October 2016},
 volume = {38},
 number = {4},
 month = aug,
 year = {2016},
 issn = {0164-0925},
 pages = {14:1--14:94},
 articleno = {14},
 numpages = {94},
 url = {http://doi.acm.org/10.1145/2837022},
 doi = {10.1145/2837022},
 acmid = {2837022},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Aliasing, concurrency, ownership, side effects, static type systems},
}

@inproceedings{marcu_flink_2016,
author={O. C. Marcu and A. Costan and G. Antoniu and M. S. Pérez-Hernández},
booktitle={2016 IEEE International Conference on Cluster Computing (CLUSTER)},
title={Spark Versus Flink: Understanding Performance in Big Data Analytics Frameworks},
year={2016},
pages={433-442},
keywords={Big Data;directed graphs;software performance evaluation;Apache-hosted data analytics;Flink;Hadoop;Spark;big data analytics;data on-demand;directly acyclic graph patterns;multistep data pipelines;performance evaluation;Benchmark testing;Big data;Data analysis;Iterative methods;Libraries;Optimization;Sparks;Big Data;Flink;Spark;performance evaluation},
doi={10.1109/CLUSTER.2016.22},
month={Sept}
}

@misc{thompson_streaming_2015,
	author = {Michael Thompson},
	title = {The streaming package},
	url = {https://github.com/michaelt/streaming},
	year = {2017}
},

@inproceedings{chargueraud_functional_2008,
  author    = {Arthur Chargu{\'{e}}raud and
               Fran{\c{c}}ois Pottier},
  title     = {Functional translation of a calculus of capabilities},
  booktitle = {Proceeding of the 13th {ACM} {SIGPLAN} international conference on
               Functional programming, {ICFP} 2008, Victoria, BC, Canada, September
               20-28, 2008},
  pages     = {213--224},
  year      = {2008},
  url       = {http://doi.acm.org/10.1145/1411204.1411235},
  doi       = {10.1145/1411204.1411235},
  timestamp = {Fri, 23 Jan 2009 12:54:21 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icfp/ChargueraudP08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@article{boespflug_project_2014,
  author ={Mathieu Boespflug and Facundo Dominguez and Alexander Vershilov and Allen Brown},
  title = {Project {H}: Programming {R} in Haskell},
  note = {Talk at IFL 2014},
  year = {2014}
}

@inbook{peyton_jones_awkward-squad_1999,
author = {Peyton Jones, Simon},
title = {Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell},
booktitle = {Engineering theories of software construction},
year = {2001},
month = {January},
publisher = {IOS Press},
url = {https://www.microsoft.com/en-us/research/publication/tackling-awkward-squad-monadic-inputoutput-concurrency-exceptions-foreign-language-calls-haskell/},
address = {},
pages = {47-96},
journal = {},
volume = {},
chapter = {},
isbn = {ISBN 1 58603 1724},
}

@inproceedings{minamide_hole_1998,
    author = {Yasuhiko Minamide},
    title = {A Functional Representation of Data Structures with a Hole},
    booktitle = {In Conference Record of the 25th Symposium on Principles of Programming Languages (POPL '98)},
    year = {1998},
    pages = {75--84}
}

@techreport{larus_destination_1998,
  title={Restructuring symbolic programs for concurrent execution on multiprocessors},
  author={Larus, James R},
  year={1989},
  institution={California univ berkeley dept of electrical engineering and computer sciences}
}

@inproceedings{benton_monad-linear_1996,
author={N. Benton and P. Wadler},
booktitle={Proceedings 11th Annual IEEE Symposium on Logic in Computer Science},
title={Linear logic, monads and the lambda calculus},
year={1996},
pages={420-431},
keywords={formal logic;lambda calculus;Moggi's computational metalanguage;adjoint calculus;adjoint presentation;call-by-name;call-by-value;intuitionistic linear logic;lambda calculus;linear logic;monads;Calculus;Computational modeling;Ear;Laboratories;Logic;Proposals},
doi={10.1109/LICS.1996.561458},
ISSN={1043-6871},
month={Jul},}


@article{barendsen_uniqueness_1993,
  author    = {Erik Barendsen and
               Sjaak Smetsers},
  title     = {Uniqueness Typing for Functional Languages with Graph Rewriting Semantics},
  journal   = {Mathematical Structures in Computer Science},
  volume    = {6},
  number    = {6},
  pages     = {579--612},
  year      = {1996},
  timestamp = {Thu, 03 Jan 2002 12:25:50 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/mscs/BarendsenS96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

@article{devries_linearity_2017,
  title = {Linearity, Uniqueness, and Haskell},
  author = {de Vries, Edsko},
  note = {\HREF{Blog post}{http://edsko.net/2017/01/08/linearity-in-haskell/}},
  year = {2017},
}

@article{pusher_latency_2016,
  title = {Low latency, large working set, and GHC’s garbage collector: pick two of three},
  author = {Fisher, James},
  note = {\HREF{Blog post}{https://blog.pusher.com/latency-working-set-ghc-gc-pick-two/}},
  year = {2016},
}

@article{thrippleton_memory_2007,
  title={Memory safety with exceptions and linear types},
  author={Thrippleton, Richard and Mycroft, Alan},
  year = {2007},
}

@article{sergey_cardinality_2014,
 author = {Sergey, Ilya and Vytiniotis, Dimitrios and Peyton Jones, Simon},
 title = {Modular, Higher-order Cardinality Analysis in Theory and Practice},
 journal = {SIGPLAN Not.},
 issue_date = {January 2014},
 volume = {49},
 number = {1},
 month = jan,
 year = {2014},
 issn = {0362-1340},
 pages = {335--347},
 numpages = {13},
 url = {http://doi.acm.org/10.1145/2578855.2535861},
 doi = {10.1145/2578855.2535861},
 acmid = {2535861},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {cardinality analysis, compilers, functional programming languages, haskell, lazy evaluation, operational semantics, program optimisation, static analysis, thunks, types and effects},
}

@inproceedings{brunel_coeffect_core_2014,
 author = {Brunel, Alo\"{\i}s and Gaboardi, Marco and Mazza, Damiano and Zdancewic, Steve},
 title = {A Core Quantitative Coeffect Calculus},
 booktitle = {Proceedings of the 23rd European Symposium on Programming Languages and Systems - Volume 8410},
 year = {2014},
 isbn = {978-3-642-54832-1},
 pages = {351--370},
 numpages = {20},
 url = {http://dx.doi.org/10.1007/978-3-642-54833-8_19},
 doi = {10.1007/978-3-642-54833-8_19},
 acmid = {2961774},
 publisher = {Springer-Verlag New York, Inc.},
 address = {New York, NY, USA},
}

@Inbook{petricek_coeffects_2013,
author="Petricek, Tomas
and Orchard, Dominic
and Mycroft, Alan",
editor="Fomin, Fedor V.
and Freivalds, R{\={u}}si{\c{n}}{\v{s}}
and Kwiatkowska, Marta
and Peleg, David",
title="Coeffects: Unified Static Analysis of Context-Dependence",
bookTitle="Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II",
year="2013",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="385--397",
isbn="978-3-642-39212-2",
doi="10.1007/978-3-642-39212-2_35",
url="http://dx.doi.org/10.1007/978-3-642-39212-2_35"
}

@inproceedings{liu_burstbuffer_2012,
author={N. Liu and J. Cope and P. Carns and C. Carothers and R. Ross and G. Grider and A. Crume and C. Maltzahn},
booktitle={012 IEEE 28th Symposium on Mass Storage Systems and Technologies (MSST)},
title={On the role of burst buffers in leadership-class storage systems},
year={2012},
pages={1-11},
keywords={buffer storage;file organisation;input-output programs;parallel architectures;parallel machines;program interpreters;CODES storage system simulator;HPC storage architecture;I/O forwarding layer;I/O kernel description language;I/O pattern;I/O request;bandwidth aggregation;burst buffer model;high-performance system;interpreter;large-scale HPC system;leadership class storage system;multiapplication I/O workload;parallel file system;solid-state burst buffer;storage system design;Bandwidth;Buffer storage;Computational modeling;Kernel;Protocols;Throughput},
doi={10.1109/MSST.2012.6232369},
ISSN={2160-195X},
month={April},}

@InProceedings{curien_focus_2010,
  Title                    = {{T}he duality of computation under focus},
  Author                   = {Curien, Pierre-Louis and Munch-Maccagnoni, Guillaume},
  Booktitle                = {IFIP TCS},
  Year                     = {2010},
  Editor                   = {Calude, Christian S. and Sassone, Vladimiro},
  Pages                    = {165-181},
  Publisher                = {Springer},
  Series                   = {IFIP Advances in Information and Communication Technology},
  Volume                   = {323}
}

@article{marlow_async_exceptions_2001,
 author = {Marlow, Simon and Jones, Simon Peyton and Moran, Andrew and Reppy, John},
 title = {Asynchronous Exceptions in Haskell},
 journal = {SIGPLAN Not.},
 issue_date = {May 2001},
 volume = {36},
 number = {5},
 month = may,
 year = {2001},
 issn = {0362-1340},
 pages = {274--285},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/381694.378858},
 doi = {10.1145/381694.378858},
 acmid = {378858},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@article{peyton_jones_exceptions_1999,
 author = {Peyton Jones, Simon and Reid, Alastair and Henderson, Fergus and Hoare, Tony and Marlow, Simon},
 title = {A Semantics for Imprecise Exceptions},
 journal = {SIGPLAN Not.},
 issue_date = {May 1999},
 volume = {34},
 number = {5},
 month = may,
 year = {1999},
 issn = {0362-1340},
 pages = {25--36},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/301631.301637},
 doi = {10.1145/301631.301637},
 acmid = {301637},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@techreport{pottier_subtyping_1998,
  TITLE = {{Type Inference in the Presence of Subtyping: from Theory to Practice}},
  AUTHOR = {Pottier, Fran{\c c}ois},
  URL = {https://hal.inria.fr/inria-00073205},
  TYPE = {Research Report},
  NUMBER = {RR-3483},
  INSTITUTION = {{INRIA}},
  YEAR = {1998},
  KEYWORDS = {READABILITY ; CONSTRAINTS ; EFFICIENCY ; PROGRAM ANALYSIS ; SIMPLIFICATION ; INFERENCE ; ML ; TYPING ; SUBTYPING ; POLYMORPHISM},
  PDF = {https://hal.inria.fr/inria-00073205/file/RR-3483.pdf},
  HAL_ID = {inria-00073205},
  HAL_VERSION = {v1},
}

@Inbook{benton_mixed_1995,
author="Benton, P. N.",
editor="Pacholski, Leszek and Tiuryn, Jerzy",
title="A mixed linear and non-linear logic: Proofs, terms and models",
bookTitle="Computer Science Logic: 8th Workshop, CSL '94 Kazimierz, Poland, September 25--30, 1994 Selected Papers",
year="1995",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="121--135",
isbn="978-3-540-49404-1",
doi="10.1007/BFb0022251",
url="http://dx.doi.org/10.1007/BFb0022251"
}

@article{launchbury_st_1995,
author="Launchbury, John
and Peyton Jones, Simon L.",
title="State in Haskell",
journal="LISP and Symbolic Computation",
year="1995",
volume="8",
number="4",
pages="293--341",
abstract="Some algorithms make critical internal use of updatable state, even though their external specification is purely functional. Based on earlier work on monads, we present a way of securely encapsulating stateful computations that manipulate multiple, named, mutable objects, in the context of a non-strict, purely-functional language. The security of the encapsulation is assured by the type system, using parametricity. The same framework is also used to handle input/output operations (state changes on the external world) and calls to C.",
issn="1573-0557",
doi="10.1007/BF01018827",
url="http://dx.doi.org/10.1007/BF01018827"
}


@article{valiant_bridging_1990,
 author = {Valiant, Leslie G.},
 title = {A Bridging Model for Parallel Computation},
 journal = {Commun. ACM},
 issue_date = {Aug. 1990},
 volume = {33},
 number = {8},
 month = aug,
 year = {1990},
 issn = {0001-0782},
 pages = {103--111},
 numpages = {9},
 url = {http://doi.acm.org/10.1145/79173.79181},
 doi = {10.1145/79173.79181},
 acmid = {79181},
 publisher = {ACM},
 address = {New York, NY, USA},
}

@article{little_proof_1961,
author = {John D. C. Little},
title = {A Proof for the Queuing Formula: L = λW},
journal = {Operations Research},
volume = {9},
number = {3},
pages = {383-387},
year = {1961},
doi = {10.1287/opre.9.3.383},

URL = {http://dx.doi.org/10.1287/opre.9.3.383},
eprint = {http://dx.doi.org/10.1287/opre.9.3.383} ,
abstract = { In a queuing process, let 1/λ be the mean time between the arrivals of two consecutive units, L be the mean number of units in the system, and W be the mean time spent by a unit in the system. It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L = λW. }
}

@inproceedings{yang_compact_2015,
 author = {Yang, Edward Z. and Campagna, Giovanni and A\u{g}acan, \"{O}mer S. and El-Hassany, Ahmed and Kulkarni, Abhishek and Newton, Ryan R.},
 title = {Efficient Communication and Collection with Compact Normal Forms},
 booktitle = {Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming},
 series = {ICFP 2015},
 year = {2015},
 isbn = {978-1-4503-3669-7},
 location = {Vancouver, BC, Canada},
 pages = {362--374},
 numpages = {13},
 url = {http://doi.acm.org/10.1145/2784731.2784735},
 doi = {10.1145/2784731.2784735},
 acmid = {2784735},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Message Passing, Regions, Serialization},
}

@Inbook{westbrook_permissions_2012,
author="Westbrook, Edwin
and Zhao, Jisheng
and Budimli{\'{c}}, Zoran
and Sarkar, Vivek",
editor="Noble, James",
title="Practical Permissions for Race-Free Parallelism",
bookTitle="ECOOP 2012 -- Object-Oriented Programming: 26th European Conference, Beijing, China, June 11-16, 2012. Proceedings",
year="2012",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="614--639",
isbn="978-3-642-31057-7",
doi="10.1007/978-3-642-31057-7_27",
url="http://dx.doi.org/10.1007/978-3-642-31057-7_27"
}

@inproceedings{kiselyov_regions_2008,
 author = {Kiselyov, Oleg and Shan, Chung-chieh},
 title = {Lightweight Monadic Regions},
 booktitle = {Proceedings of the First ACM SIGPLAN Symposium on Haskell},
 series = {Haskell '08},
 year = {2008},
 isbn = {978-1-60558-064-7},
 location = {Victoria, BC, Canada},
 pages = {1--12},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/1411286.1411288},
 doi = {10.1145/1411286.1411288},
 acmid = {1411288},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {effect systems, monads, parametric polymorphism, regions, resource management, subtyping, type classes, type systems},
}

@inproceedings{dominguez_parafusion_2006,
  title={Program fusion with paramorphisms},
  author={Dom{\i}nguez, Facundo and Pardo, Alberto},
  booktitle={Mathematically Structured Func. Programming, Electronic Workshops in Computing. BCS},
  year={2006}
}

@inproceedings{eisenberg_promoting_2014,
 author = {Eisenberg, Richard A. and Stolarek, Jan},
 title = {Promoting Functions to Type Families in Haskell},
 booktitle = {Proceedings of the 2014 ACM SIGPLAN Symposium on Haskell},
 series = {Haskell '14},
 year = {2014},
 isbn = {978-1-4503-3041-1},
 location = {Gothenburg, Sweden},
 pages = {95--106},
 numpages = {12},
 url = {http://doi.acm.org/10.1145/2633357.2633361},
 doi = {10.1145/2633357.2633361},
 acmid = {2633361},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Haskell, defunctionalization, type-level programming},
}


@article{memcached,
 author = {Fitzpatrick, Brad},
 title = {Distributed Caching with Memcached},
 journal = {Linux J.},
 issue_date = {August 2004},
 volume = {2004},
 number = {124},
 month = aug,
 year = {2004},
 issn = {1075-3583},
 pages = {5--},
 url = {http://dl.acm.org.proxyiub.uits.iu.edu/citation.cfm?id=1012889.1012894},
 acmid = {1012894},
 publisher = {Belltown Media},
 address = {Houston, TX},
}


@article{multicore-haskell,
 author = {Marlow, Simon and Peyton Jones, Simon and Singh, Satnam},
 title = {Runtime Support for Multicore Haskell},
 journal = {SIGPLAN Not.},
 issue_date = {September 2009},
 volume = {44},
 number = {9},
 month = aug,
 year = {2009},
 issn = {0362-1340},
 pages = {65--78},
 numpages = {14},
 url = {http://doi.acm.org/10.1145/1631687.1596563},
 doi = {10.1145/1631687.1596563},
 acmid = {1596563},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Haskell parallel runtime},
}