You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 

105 lines
3.2 KiB

@article{Bryant86,
author = {Bryant, Randal E.},
title = {Graph-Based Algorithms for Boolean Function Manipulation},
journal = {IEEE Trans. Comput.},
issue_date = {August 1986},
volume = {35},
number = {8},
month = aug,
year = {1986},
issn = {0018-9340},
pages = {677--691},
numpages = {15},
url = {http://dx.doi.org/10.1109/TC.1986.1676819},
doi = {10.1109/TC.1986.1676819},
acmid = {6433},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
keywords = {Boolean functions, binary decision diagrams, logic design
verification, symbolic manipulation, symbolic manipulation, Boolean
functions, binary decision diagrams, logic design verification},
}
@article{Mohring93,
author = {Paulin-Mohring, Christine and Werner, Benjamin},
title = {Synthesis of ML Programs in the System Coq},
journal = {J. Symb. Comput.},
issue_date = {May/June 1993},
volume = {15},
number = {5-6},
month = may,
year = {1993},
issn = {0747-7171},
pages = {607--640},
numpages = {34},
url = {http://dx.doi.org/10.1016/S0747-7171(06)80007-6},
doi = {10.1016/S0747-7171(06)80007-6},
acmid = {162217},
publisher = {Academic Press, Inc.},
address = {Duluth, MN, USA},
}
@misc{Andersen97,
author = {Henrik Reif Andersen},
title = {An Introduction to Binary Decision Diagrams},
howpublished = {Lectures notes from Technical University of Denmark},
year = 1997,
note = {\url{http://www.cs.utexas.edu/~isil/cs389L/bdd.pdf}}
}
@article{Hayes97,
author = {Hayes, Barry},
title = {Ephemerons: A New Finalization Mechanism},
journal = {SIGPLAN Not.},
issue_date = {Oct. 1997},
volume = {32},
number = {10},
month = oct,
year = {1997},
issn = {0362-1340},
pages = {176--183},
numpages = {8},
url = {http://doi.acm.org/10.1145/263700.263733},
doi = {10.1145/263700.263733},
acmid = {263733},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {finzlization, garbage collection, resource management, weak pointers},
}
@article{Leroy00,
author = {Xavier Leroy},
title = {A modular module system},
journal = {Journal of Functional Programming},
volume = 10,
number = 3,
year = 2000,
pages = {269--303},
urllocal = {http://xavierleroy.org/publi/modular-modules-jfp.pdf},
urlpublisher = {http://journals.cambridge.org/action/displayAbstract?aid=54525},
abstract = {A simple implementation of a SML-like module system is presented as a
module parameterized by a base language and its type-checker. This
demonstrates constructively the applicability of that module system to
a wide range of programming languages. Full source code available
in the Web appendix \url{http://gallium.inria.fr/~xleroy/publi/modular-modules-appendix/}},
xtopic = {modules}
}
@InProceedings{ConchonFilliatre06,
author = {Sylvain Conchon and Jean-Christophe Filli\^atre},
title = {{Type-Safe Modular Hash-Consing}},
booktitle = {ACM SIGPLAN Workshop on ML},
address = {Portland, Oregon},
month = sep,
year = 2006,
url = {http://www.lri.fr/~filliatr/ftp/publis/hash-consing2.pdf},
}
@book{Knuth11,
author = {Knuth, Donald E.},
title = {The Art of Computer Programming, volume 4A: Combinatorial
Algorithms, Part 1},
year = 2011,
edition = {1st},
publisher = {Addison-Wesley Professional}
}