Books and proceedings (1)
  1. Daniel P. Friedman, William E. Byrd, and Oleg Kiselyov. The Reasoned Schemer. MIT Press, Cambridge, MA, 2005. [bibtex-entry]

Thesis (1)
  1. William E. Byrd. Relational Programming in miniKanren: Techniques, Applications, and Implementations. PhD thesis, Indiana University, September 2009. [bibtex-entry]

Conference articles (9)
  1. Joseph A. Cottam, Eric Holk, William E. Byrd, Arun Chauhan, and Andrew Lumsdaine. High-level Coordination Specification: Operational semantics for Kanor. In Workshop on Leveraging Abstractions and Semantics in High-performance Computing (LASH-C; Workshop at PPoPP'13), February 2013. [bibtex-entry]

  2. Claire E. Alvis, Jeremiah J. Willcock, Kyle M. Carter, William E. Byrd, and Daniel P. Friedman. cKanren: miniKanren with Constraints. In Workshop on Scheme and Functional Programming, October 2011. [bibtex-entry]

  3. Eric Holk, William 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), September 2011. [bibtex-entry]

  4. Eric Holk, William E. Byrd, Jeremiah Willcock, Torsten Hoefler, Arun Chauhan, and Andrew Lumsdaine. Kanor -- A Declarative Language for Explicit Communication. In Thirteenth International Symposium on Practical Aspects of Declarative Languages (PADL'11), Austin, Texas, January 2011. [bibtex-entry]

  5. 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 John Clements, editor, Proc. of the 2009 Workshop on Scheme and Functional Programming, Boston, Mass., Aug. 22, 2009, Cal Poly Technical Report CPSLO-CSC-09-03, pages 37--45, 2009. [bibtex-entry]

  6. Oleg Kiselyov, William E. Byrd, Daniel P. Friedman, and Chung-chieh Shan. Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl). In Jacques Garrigue and Manuel V. Hermenegildo, editors, FLOPS '08: Proc. of the 9th Intl. Symp. on Functional and Logic Programming, Ise, Japan, Apr. 14--16, 2008, volume 4989 of LNCS, pages 64--80, 2008. Springer. [bibtex-entry]

  7. Joseph P. Near, William E. Byrd, and Daniel P. Friedman. \m box\alpha\s f leanT\!\!A\!P: A Declarative Theorem Prover for First-Order Classical Logic. In Maria Garcia de la Banda and Enrico Pontelli, editors, ICLP '08: Proc. of the 24th Intl. Conf. on Logic Programming, Udine, Italy, Dec. 9--13, 2008, volume 5366 of LNCS, pages 238--252, 2008. Springer. [bibtex-entry]

  8. William E. Byrd and Daniel P. Friedman. \a lphakanren: A Fresh Name in Nominal Logic Programming. In Danny Dub?, editor, Proc. of the 2007 Workshop on Scheme and Functional Programming, Freiburg, Germany, Sep. 30, 2007, Universit? Laval Technical Report DIUL-RT-0701, pages 79--90 (\textitsee also \mboxrl webyrd \textitfor improvements), 2007. [bibtex-entry]

  9. William E. Byrd and Daniel P. Friedman. From Variadic Functions to Variadic Relations: A miniKanren Perspective. In Robby Findler, editor, Proc. of the 2006 Scheme and Functional Programming Workshop, Portland, Sep. 17, 2006, University of Chicago Technical Report TR-2006-06, pages 105--117, 2006. [bibtex-entry]



This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Last modified: Mon Feb 27 13:25:18 2017
Author: apache.

This document was translated from BibTEX by bibtex2html