We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
  Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Feedback

miniKanren: a minimal declarative language for relational programming

36
 Cite
 Share
 Download
 Purchase
Logo of FOSDEM VZWFOSDEM VZW
 Byrd, William

Formal Metadata

Title
miniKanren: a minimal declarative language for relational programming
Title of Series
Number of Parts
637
Author
Contributors
Et al.
License
CC Attribution 2.0 Belgium:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date2021
LanguageEnglish

Content Metadata

Subject Area
Genre
Abstract
In this talk I will give an introduction to miniKanren, a minimal embedded domain-specific language for constraint logic programming. miniKanren is designed to support relational programming, in which all code is written as mathematical relations, with no distinction between inputs and outputs. miniKanren uses a complete interleaving search, combined with unification and other constraints, to solve for variables representing unknown values. In effect, every miniKanren query is a program synthesis problem.