Daniel P. Friedman, William E. Byrd, Oleg Kiselyov, and Jason Hemann
The Reasoned Schemer, Second Edition.
The MIT Press, Cambridge, MA, 2018.
[Source code from the second edition (GitHub)]
Daniel P. Friedman, William E. Byrd and Oleg Kiselyov
The Reasoned Schemer.
The MIT Press, Cambridge, MA, 2005.
[Complete source code from the first edition--R5RS Scheme (GitHub)]
William E. Byrd
Relational Programming in miniKanren: Techniques, Applications, and Implementations.
Indiana University, Bloomington, IN,
September 30, 2009.
[Full Dissertation (PDF file)]
[Easier to read, single-spaced, re-typeset version (PDF file), released under Creative Commons Attribution 4.0 International (CC BY 4.0) license.]
William E. Byrd, Daniel P. Friedman, Ramana Kumar, and Joseph P. Near.
A Shallow Scheme Embedding of Bottom-Avoiding Streams.
To appear in a special issue of Higher-Order and Symbolic Computation, in honor of Mitchell Wand's 60th birthday.
[Preprint (PDF file)]
Lisa Zhang, Gregory Rosenblatt, Ethan Fetaya, Renjie Liao, William E. Byrd, Matthew Might, Raquel Urtasun, Richard Zemel.
Neural Guided Constraint Logic Programming for Program Synthesis.
In Advances in Neural Information Processing Systems 31 (NeurIPS 2018), 2018.
[灯蓝百度云盘]
[灯蓝百度云盘]
William E. Byrd, Michael Ballantyne, Greg Rosenblatt, Matthew Might.
Functional Pearl: A Unified Approach to Solving Seven Programming Problems.
In Proceedings of the 22nd ACM SIGPLAN International Conference on Functional Programming (ICFP 2017), Oxford, 2017.
[Paper (ACM Digital Library, Open Access)]
[Talk]
[Reusable Artifact]
[Interactive version of paper, courtesy of Nada Amin]
Christina M. Woo, Alejandra Felix, William E. Byrd, Devon K. Zuegel, Mayumi Ishihara, Parastoo Azadi, Anthony T. Iavarone, Sharon J. Pitteri, and Carolyn R. Bertozzi.
Development of IsoTaG, a Chemical Glycoproteomics Technique for Profiling Intact N- and O-Glycopeptides from Whole Cell Proteomes.
Journal of Proteome Research, 2017, 16(4), pp 1706--1718.
Paper (ACS Publications)
Jason Hemann, Dan Friedman, William E. Byrd, Matt Might.
A Small Embedding of Logic Programming with a Simple Complete Search.
In Proceedings of the Dynamic Languages Symposium 2016 (DLS '16), Amsterdam, 2016.
[Paper (ACM Digital Library)]
Dakota Fisher, Matthew Hammer, William E. Byrd, Matthew Might.
miniAdapton: A Minimal Implementation of Incremental Computation in Scheme.
In Proceedings of the 2016 Workshop on Scheme and Functional Programming, Nara, Japan, 2016.
[Full paper (PDF file)]
[Complete source code--R6RS Scheme (GitHub)]
Steven Lyde, William E. Byrd, Matthew Might.
Control-Flow of Dynamic Languages via Pointer Analysis.
In the 11th Dynamic Languages Symposium (DLS) at SPLASH 2015, October 27th, 2015.
William E. Byrd, Eric Holk, and Daniel P. Friedman.
miniKanren, Live and Untagged: Quine Generation via Relational Interpreters (Programming Pearl).
In the Proceedings of the 2012 Workshop on Scheme and Functional Programming, Copenhagen, Denmark, 2012.
[Full paper (PDF file)]
[Complete source code--R6RS Scheme (GitHub)]
Claire E. Alvis, Jeremiah J. Willcock, Kyle M. Carter, William E. Byrd, and Daniel P. Friedman.
cKanren: miniKanren with Constraints.
In Proceedings of the 2011 Workshop on Scheme and Functional Programming (Scheme '11), Portland, OR, 2011.
[Full paper (PDF file)]
[比特球云盘 - 让时光传承珍贵:比特球云盘为您提供私人云存储服务,您可伡方便的从本地或网络资源链接保存文件到云盘,并随时随地进行预览、下载]
Eric Holk, William E. Byrd, Nilesh Mahajan, Jeremiah Willcock, Arun Chauhan, and Andrew Lumsdaine.
Declarative Parallel Programming for GPUs.
In Proceedings of the International Conference on Parallel Computing (ParCo), Ghent, Belgium, 2011.
[Complete source code--R6RS Scheme (GitHub)]
[Full paper (PDF file)]
Eric Holk, William E. Byrd, Jeremiah Willcock, Torsten Hoefler, Arun Chauhan, and Andrew Lumsdaine.
Kanor: A Declarative Language for Explicit Communication.
In Proceedings of the Thirteenth International Symposium on the Practical Aspects of Declarative Languages (PADL),
Austin, TX, pp. 190-204, 2011.
[蓝1灯破解版百度云]
Andrew W. Keep, Michael D. Adams, Lindsey Kuper, William E. Byrd, and Daniel P. Friedman.
A Pattern-matcher for miniKanren -or- How to Get into Trouble with CPS Macros
In Proceedings of the 2009 Workshop on Scheme and Functional Programming,
Cal Poly Technical Report CPSLO-CSC-09-03, pp. 37-45, 2009.
[Full proceedings (PDF file)]
Joseph P. Near, William E. Byrd and Daniel P. Friedman.
alphaleanTAP: A Declarative Theorem Prover for First-Order Classical Logic
In Proceedings of the 24th International Conference on Logic Programming (ICLP 2008),
LNCS vol. 5366, Springer-Verlag, Heidelberg, pp. 238-252, 2008.
[Full paper (PDF file)]
[Complete source code--R6RS Scheme and Prolog (.zip file)]
Oleg Kiselyov, William E. Byrd, Daniel P. Friedman and Chung-chieh Shan
Pure, declarative, and constructive arithmetic relations (declarative pearl)
In Proceedings of the 9th international symposium on functional and logic programming,
ed. Jacques Garrigue and Manuel Hermenegildo, pp. 64-80.
LNCS vol. 4989, Springer, 2008.
[Full paper (PDF file)]
William E. Byrd and Daniel P. Friedman
alphaKanren: A Fresh Name in Nominal Logic Programming
Proceedings of the 2007 Workshop on Scheme and Functional Programming,
Universite Laval Technical Report DIUL-RT-0701, pp. 79-90.
[Full paper (PDF file)]
[Author's revised version (recommended) (PDF file)]
[Revised R5RS-compliant source code (.scm file)]
William E. Byrd and Daniel P. Friedman
From Variadic Functions to Variadic Relations: A miniKanren Perspective.
Proceedings of the 2006 Scheme and Functional Programming Workshop,
University of Chicago Technical Report TR-2006-06, 2006, pp. 105-117.
[Full paper (PDF file)]