Laurent Théry. Proving Pearl: Knuth s Algorithm for Prime Numbers. In David A. Basin, Burkhart Wolff, editors, Theorem Proving in Higher Order Logics, 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings. Volume 2758 of Lecture Notes in Computer Science, pages 304-318, Springer, 2003. [doi]
@inproceedings{Thery03,
title = {Proving Pearl: Knuth s Algorithm for Prime Numbers},
author = {Laurent Théry},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2758&spage=304},
researchr = {https://researchr.org/publication/Thery03},
cites = {0},
citedby = {0},
pages = {304-318},
booktitle = {Theorem Proving in Higher Order Logics, 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings},
editor = {David A. Basin and Burkhart Wolff},
volume = {2758},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-40664-6},
}