Dissertation/Thesis Abstract

Relational programming in miniKanren: Techniques, applications, and implementations
by Byrd, William E., Ph.D., Indiana University, 2009, 296; 3380156
Abstract (Summary)

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. For example, a relational interpreter for a subset of Scheme might use nominal unification to support variable binding and scope, Constraint Logic Programming over Finite Domains (CLP(FD)) to implement relational arithmetic, and tabling to improve termination behavior.

In this dissertation I present miniKanren, a family of languages specifically designed for relational programming, and which supports a variety of relational idioms and techniques. I show how miniKanren can be used to write interesting relational programs, including an extremely flexible lean tableau theorem prover and a novel constraint-free binary arithmetic system with strong termination guarantees. I also present interesting and practical techniques used to implement miniKanren, including a nominal unifier that uses triangular rather than idempotent substitutions and a novel “walk”-based algorithm for variable lookup in triangular substitutions.

The result of this research is a family of languages that supports a variety of relational idioms and techniques, making it feasible and useful to write interesting programs as relations.

Indexing (document details)
Advisor: Friedman, Daniel P.
Commitee: Haynes, Christopher T., Moss, Lawrence S., Sabry, Amr
School: Indiana University
Department: Computer Sciences
School Location: United States -- Indiana
Source: DAI-B 70/12, Dissertation Abstracts International
Subjects: Computer science
Keywords: Logic programming, Relational programming, Schemes, miniKanren
Publication Number: 3380156
ISBN: 978-1-109-50468-2
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy