HackerPapers

arXiv:1701.00633cs.PL

A Framework for Extending microKanren with Constraints

Jason Hemann, Daniel P. Friedman

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We present a framework for building CLP languages with symbolic constraints based on microKanren, a domain-specific logic language shallowly embedded in Racket. We rely on Racket's macro system to generate a constraint solver and other components of the microKanren embedding. The framework itself and the constraints' implementations amounts to just over 100 lines of code. Our framework is both a teachable implementation for CLP as well as a test-bed and prototyping tool for symbolic constraint systems.

arXiv comments
In Proceedings WLP'15/'16/WFLP'16, arXiv:1701.00148
Journal reference
EPTCS 234, 2017, pp. 135-149
DOI
doi:10.4204/EPTCS.234.10
Subjects
cs.PLProgramming Languages

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jul 2017 to Jul 2017.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Logic Programming (Prolog, ASP, etc) and GRAKN.AI (a distributed knowledge base) 1 comment

    • I am neither Byrd nor Friedman but I will try my best. The short answer is that it doesn't compose very well, especially when doing relational programming. Let's say that `people` is a record of some sort, and not a relation. That is, when we extract people, we get records of…

      DonbunEf7View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.