A relational programming language for defining and evaluating relations between terms in the simply-typed lambda calculus. Uses Huet's higher-order unification algorithm for equality relations, and a miniKanren-like interface for constructing relations and querying substitutions/solutions to relations with unification variables.
-
Notifications
You must be signed in to change notification settings - Fork 0
A proof-of-concept Kanren-like relational programming language to generate lambda calculus terms. Will implement a lambda-term unification algorithm.
License
jar2333/Quine
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A proof-of-concept Kanren-like relational programming language to generate lambda calculus terms. Will implement a lambda-term unification algorithm.
Resources
License
Stars
Watchers
Forks
Releases
No releases published