Constraint microKanren in the CLP Scheme
Loading...
Can’t use the file because of accessibility barriers? Contact us with the title of the item, permanent link, and specifics of your accommodation need.
Date
2020-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
[Bloomington, Ind.] : Indiana University
Permanent Link
Abstract
Programmers in related constraint-logic languages should have language semantics that span different implementations and enable reasoning generally about the shared parts of languages’ behaviors while reflecting their differences. A wide class of miniKanren languages are syntactic extensions over a small kernel logic programming language with interrelated semantics parameterized by their constraint systems. This thesis characterizes succinctly a set of miniKanren CLP languages parameterized by their constraints, for pure, relational programming by instantiating, for each, portions of the constraint domain. This set of languages carry related components of their declarative and operational semantics that are independent of a particular host language or their particular constraint sets. This characterization bolsters the development of useful tools and aids in solving important tasks with pure relational programming.
Description
Thesis (Ph.D.) - Indiana University, School of Informatics, Computing, and Engineering, 2020
Keywords
constraints, logic programming, macro systems, negative constraints, relations
Citation
Journal
DOI
Link(s) to data and video for this item
Relation
Rights
Type
Doctoral Dissertation