We present a binding-time analysis algorithm for miniKanren. It is capable to determine the order in which names within a program are bound and can be used to facilitate specialization and as a step of conversion into a functional language.
You may also like
Evidential transactions (ETs) provide auditable and composable evidence that serves as a witness or a proof that a transaction has been correctly […]
We present an approach to pattern matching code generation based on application of relational programming and, in particular, relational interpreters. Attachments Abstract […]
We discuss the influences of structural proof theory on logic programming and vice versa. Attachments Abstract Dale Miller (87 kB)
In this paper we research methods of supercompilation in the context of relational program specialization. We implement a supercompiler for miniKanren with […]