Loading...

miniKanren Hangout #8, 5 May 2013

Loading...

Loading...

Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Streamed live on May 5, 2013

Dan and Jason demonstrate a cool way to represent Scheme's 'letrec' form in an interpreter. Then Will and the group live code a general interpreter for Deterministic Finite Automata in Scheme, then port it to miniKanren to make it run backwards.

Scheme and miniKanren code at:

https://github.com/webyrd/relational-dfa

Loading...


to add this to Watch Later

Add to

Loading playlists...