William E. Byrd
where else to find them
what they talk about
all 7 in the filters
where they keep going back
- miniKanren4 editions2021–2026
- Clojure/Conj4 editions2011–2016
- FOSDEM2 editions2021–2022
all 11 in the filters
on a stage with
all 24 in the filters
who talks about the same things
- Jason Hemann9 talks
- Daniel Friedman6 talks
- Nada Amin26 talks
- Edward Kmett5 talks
- Xinyu Wang14 talks
- Michael Ballantyne4 talks
| title | conference | date |
|---|---|---|
| Programming Challenge to Attendees | miniKanren 2026 | 2026-08-24 |
Challenge frames transforming a small number of input sentences (often two) into new token sequences using relational techniques. Options include a simple… | ||
| Demos of Attendee Programs and Open Mic | miniKanren 2026 | 2026-08-24 |
Live demos show five independent implementations that parse given start/end states, build transition graphs or bi-gram matrices, and enumerate sentences by… | ||
| Introduction to relational programming in miniKanren | miniKanren 2026 | 2026-08-24 |
Hands-on tour of miniKanren (faster-minikanren in Scheme/Racket) that demos core primitives and limits: first-order unification with occurs-check via equal==… | ||
| Beyond Cons: Purely Relational Data Structures | miniKanren and Relational Programming Workshop 2025 | 2025-10-17 |
Adds a constraint-enabled extension to miniKanren that implements first-class set objects and association-list constraints, giving membership, set… | ||
| Multi-stage Relational Programming | PLDI 2025 | 2025-06-16 |
Implements a multi-stage extension of miniKanren that compiles known parts of relational interpreters and defers unknown holes to a runtime relational… | ||
| VerMCTS: Synthesizing Multi-Step Programs using a Verifier, a Large Language Model,(…) | Dafny 2025 | 2025-01-19 |
VerMCTS combines a logical verifier, an LLM (FinCode Llama v2), and a modified Monte Carlo Tree Search to synthesize Dafny and Coq programs and proofs; it… | ||
| An Imperishable Wonderland of Infinite Fun | Lambda World 2024 | 2024-10-02 |
Claim: functional programming ideas are mainstream but logic programming deserves a revival. Uses miniKanren embedded in Scheme to build a relational… | ||
| Addressing Treatment-Relevance in Biomedical Relation Extraction | DeclMed 2023 | 2023-09-09 |
Fine-tuned encoder models on the BioRed corpus (NIH LitCoin) use entity-marked, modified abstracts and the CLS embedding in a multitask setup to predict four… | ||
| miniKanren: Tutorial | miniKanren 2023 | 2023-09-08 |
Demo shows a relational interpreter for a Scheme subset implemented in faster-miniKanren that exposes eval as an evalo relational interpreter, supports… | ||
| A Tutorial Reconstruction of miniKanren with constraints | miniKanren 2022 | 2022-09-15 |
Reconstructs the appendix D implementation to show exactly how miniKanren adds constraints and how to extend it, providing a four-part recipe for implementing… | ||
| A Relational Exploration of McCarthy's 'Amb' | FOSDEM 2022 | 2022-02-05 |
We will investigate what weirdness occurs when John McCarthy's non-deterministic 'amb' operator is added to a LISP interpreter written in a relational style… | ||
| Strange Dreams of Stranger Loops | Strange Loop 2021 | 2021-09-30 |
Relational programming with miniKanren actually synthesizes quines and twines: a two-place evalo relational evaluator yields expressions that evaluate to… | ||
| metaKanren: Towards a Metacircular Relational Interpreter | miniKanren 2021 | 2021-08-26 |
metaKanren implements a deep relational interpreter for a microKanren-like language and claims to enable metacircular behavior that a shallow embedding cannot… | ||
| miniKanren: a minimal declarative language for relational programming | FOSDEM 2021 | 2021-02-06 |
In this talk I will give an introduction to miniKanren, a minimal
embedded domain-specific language for constraint logic programming.
miniKanren is designed to… | ||
| What can we Learn from Pro Gamers | Code Mesh LDN 2020 | 2020-11-05 |
Argument claims that studying StarCraft pro practice reveals teachable, repeatable learning methods for programming: pros hit 400 APM, train 12+ hours/day, use… | ||
| Relational Interpreters, Program Synthesis, and Barliman | Code Mesh 2017 | 2017-11-08 |
miniKanren encodes a Scheme relational interpreter so the system synthesizes code by running eval backwards; it actually generates quines, 99 distinct programs… | ||
| Barliman: trying the halting problem backwards, blindfolded | Clojure/conj 2016 | 2016-12-01 |
Barliman is a prototype smart editor that completes programs from partial definitions and tests using a relational interpreter written in miniKanren EDSL… | ||
| A Vision for Relational Programming in miniKanren | Code Mesh 2015 | 2015-11-03 |
Implementation details dominate: miniKanren code runs in a web-based veneer REPL, defines a lambda-calculus syntax checker that also generates every syntactic… | ||
| From Greek to Clojure! | Clojure/conj 2013 | 2013-11-14 |
Translates paper inference rules into working Clojure: implements Peano naturals and a three‑place plus as both a function and a relation, a simply‑typed… | ||
| A Relational Exploration of the Chomsky Hierarchy | Strange Loop 2013 | 2013-09-18 |
miniKanren implementation claims to encode deterministic and non-deterministic finite automata plus push‑down automata and Turing Machines and it actually… | ||
| miniKanren Philosophy | Clojure/conj 2012 | 2012-11-15 |
Description of a logic language with a tiny core: a few primitives (fresh, unification, disequality, conde) let relations replace functions and let queries run… | ||
| miniKanren | Clojure/conj 2011 | 2011-11-10 |
Live demo of miniKanren shows relations translated from functions (appen with an extra answer arg) and an interpreter that can run backward generation to… | ||
| nothing matches | ||