44 lines
1.4 KiB
BibTeX
44 lines
1.4 KiB
BibTeX
|
@unpublished{dune,
|
||
|
|
title = {{Dune: A composable build system}},
|
||
|
|
author = {{Jane~Street}},
|
||
|
|
year = {2018},
|
||
|
|
note = "\url{https://dune.build}"
|
||
|
|
}
|
||
|
|
|
||
|
|
@article{mokhov2020build,
|
||
|
|
title={Build systems {\`a} la carte: Theory and practice},
|
||
|
|
author={Mokhov, Andrey and Mitchell, Neil and Peyton Jones, Simon},
|
||
|
|
journal={Journal of Functional Programming},
|
||
|
|
volume={30},
|
||
|
|
year={2020},
|
||
|
|
publisher={Cambridge University Press},
|
||
|
|
note={\url{https://doi.org/10.1017/S0956796820000088}}
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{gueneau2019cycles,
|
||
|
|
title={Formal proof and analysis of an incremental cycle detection algorithm},
|
||
|
|
author={Gu{\'e}neau, Arma{\"e}l and Jourdan, Jacques-Henri and Chargu{\'e}raud, Arthur and Pottier, Fran{\c{c}}ois},
|
||
|
|
booktitle={Interactive Theorem Proving},
|
||
|
|
number={141},
|
||
|
|
year={2019},
|
||
|
|
organization={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}
|
||
|
|
}
|
||
|
|
|
||
|
|
@unpublished{incremental,
|
||
|
|
title = {{Incremental: Library for incremental computations}},
|
||
|
|
author = {{Jane~Street}},
|
||
|
|
year = {2015},
|
||
|
|
note = "\url{https://opensource.janestreet.com/incremental}"
|
||
|
|
}
|
||
|
|
|
||
|
|
@article{hammer2014adapton,
|
||
|
|
title={Adapton: Composable, demand-driven incremental computation},
|
||
|
|
author={Hammer, Matthew and Phang, Khoo Yit and Hicks, Michael and Foster, Jeffrey},
|
||
|
|
journal={ACM SIGPLAN Notices},
|
||
|
|
volume={49},
|
||
|
|
number={6},
|
||
|
|
pages={156--166},
|
||
|
|
year={2014},
|
||
|
|
publisher={ACM New York, NY, USA}
|
||
|
|
}
|