InfoQ Homepage Presentations A Relational Exploration of the Chomsky Hierarchy
A Relational Exploration of the Chomsky Hierarchy
49:52
Summary
Friedman and Byrd explain how to encode deterministic and non-deterministic finite automata, push-down automata, and Turing Machines in miniKanren, a DSL for relational (pure logic) programming.
Bio
Daniel Friedman is Professor of CS at Indiana University. He is co-author of The Little Schemer, The Seasoned Schemer, The Reasoned Schemer, Scheme and the Art of Programming, Essentials of Programming Languages. William Byrd is a Postdoctoral Researcher in the School of Computing at the University of Utah. He is co-author of The Reasoned Schemer, and co-designer of several declarative languages.
About the conference
Strange Loop is a multi-disciplinary conference that aims to bring together the developers and thinkers building tomorrow's technology in fields such as emerging languages, alternative databases, concurrency, distributed systems, mobile development, and the web.
Feb 19, 2014