Type-safe modular hash-consing
暂无分享,去创建一个
[1] H. Andersen. An Introduction to Binary Decision Diagrams , 1997 .
[2] Jean Goubault,et al. Implementing Functional Languages with Fast Equality, Sets and Maps: an Exercise in Hash Consing , 1992 .
[3] Chris Okasaki,et al. Fast Mergeable Integer Maps , 1998 .
[4] Henrik Reif Andersen,et al. Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams , 2001, SMC@FLoC.
[5] E BryantRandal. Graph-Based Algorithms for Boolean Function Manipulation , 1986 .
[6] John A. Allen,et al. The anatomy of lisp , 1980 .
[7] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[8] Andrew W. Appel,et al. Hash-consing Garbage Collection , 1993 .
[9] Philip Wadler,et al. Views: a way for pattern matching to cohabit with data abstraction , 1987, POPL '87.
[10] M. Friedman,et al. On Programming of Arithmetic Operations , .
[11] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[12] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.