|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Relational Programming in miniKanren
If you have a question about this talk, please contact Jonathan Hayman.
The promise of logic programming is that programs can be written relationally, without distinguishing between input and output arguments. Relational programs are remarkably flexible—-for example, a relational type-inferencer also performs type checking and type inhabitation, while a relational theorem prover generates theorems as well as proofs and can even be used as a simple proof assistant. Unfortunately, writing relational programs is difficult, and requires many interesting and unusual tools and techniques.
William E. Byrd is a Research Associate in the U Combinator programming languages research group at the University of Utah. He received his PhD from Indiana University in 2009, under Daniel P. Friedman. He is co-author of The Reasoned Schemer, and co-designer of several declarative languages: miniKanren (logic programming), Harlan (GPU programming), and Kanor (cluster programming).
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsHumanitarian Centre Centre of South Asian Studies occasional events Program verification reading group.
Other talksTitle: Reality checkpoint: The good the bad and the ugly of cancer immunotherapy The Power Switch; How Power is Changing in a Networked World - an international symposium Dr Becca Asquith: KIRs, CD8 T cell dynamics and control of chronic viral infection Group Discussions (Isaac Newton Institute & Centre for Mathematical Sciences) Graphene For Satellites Thermal Control Mapping regulatory variation in human cells