Barliman: trying the halting problem backwards, blindfolded - William Byrd, Greg Rosenblatt

Channel:ClojureTV · Length:36:14 · Published:2016-12-03 · Views:7862

Watch on YouTube

Summary

A Clojure/conj 2016 talk demoing Barliman, a prototype smart editor that does program synthesis. Given a partial program and tests, it completes the program using a relational interpreter written in miniKanren.

Why HN recommends it

HN people point to it as an amazing demonstration of relational programming and program synthesis that still looks exciting after LLM code generation.

I work on miniKanren, which is a logic programming language with a complete search that doesn't hit the nontermination issues you mention. — HN, 2017

Functional programming · Testing, debugging & developer tools · Logic & formal methods

Subtitles (excerpt)

it's great to be here again I think dan Friedman and I spoke at an unsession at the con five years ago and since then the closure community has been by far the most supportive group of the work we've been doing and I think it's accurate to say that what you're about to see wouldn't exist if it weren't for the closure community and folks like David Nolan has worked on CoreLogic really gave us a big boost and stew Holloway's infamous question about flying generation has basically driven my research for the last four years so I'm you know seriously thank you I think this is an amazing community and I found it super inspirational when there have been times where academia hasn't always been as supportive as you know now giving me a you know part of the jobs for rocks it's things and they're pretty good at it but you know the closure community's enthusiasm is really what's driven this so so what we're gonna where you're gonna see wouldn't exist if it weren't for you also thank you so introducing barliman 4.3 and inspired by Rich's talk we've decided to go with an immutable versioning scheme so at all times in the future this will be 4.3 I think that was the takeaway if I understood it yeah you got it right I said what we're gonna try to show you is is

On Hacker News

You might enjoy this amazing talk. I've linked to a part when the next 20 seconds of explanation turns the amazing up to 11. [VIDEO] — kanzenryu2, 2021-06
Have you checked out any of the minikanren logic programming environments people have implemented in scheme? The Reasoned Schemer is an accessible introduction to that space if you’re not put off by the socratic-themed dialogue. & the Barliman demo is still pretty exciting even after LLM codegen. [VIDEO] — thuuuomas, 2024-01
For anyone who finds this topic interesting, you might be interested in the following resources: [LINK] The second edition of `The Reasoned Schemer` (MIT Press, 2018): [LINK] The Clojure/conj 2016 talk Greg Rosenblatt and I gave on Barliman: [VIDEO] `A Unified Approach to Solving Seven Programming Problems (Functional Pearl)`, William E. Byrd, Michael Ballantyne, Gregory Rosenblatt, Matthew Might… — will_byrd, 2021-06
Other search algorithms can take up lots of memory to store progress they've made down different paths. Having only one active state also lets you map unification down to efficient low level cpu operations. If you have multiple states, you either have to copy lots of data when you fork the state or you use a persistent data structure but can't use side effects, so everything is a bit slower. It's… — mballantyne, 2017-04

Related videos