Reference17 articles.
1. R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C--35(8):677--691, 1986.
2. R. Bryant. Binary decision diagrams and beyond: enabling technologies for formal verification. In Computer-Aided Design, 1995. ICCAD-95. Digest of Technical Papers., 1995 IEEE/ACM International Conference on, pages 236--243, 1995.
3. P. Cegielski and D. Richard. On arithmetical first-order theories allowing encoding and decoding of lists. Theoretical Computer Science, 222(1-2):55--75, 1999.
4. D. E. Knuth. Mathematics and Computer Science: Coping with Finiteness. Science, 194(4271):1235--1242, 1976.
5. D. E. Knuth. The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams. Addison-Wesley Professional, 2009. ISBN 0321580508, 9780321580504.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On a uniform representation of combinators, arithmetic, lambda terms and types;Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming;2015-07-14