ICFP 2021
Sun 22 - Sat 28 August 2021
Thu 26 Aug 2021 21:05 - 21:30 at miniKanren - Session A Chair(s): William E. Byrd

lambdaKanren, adapted from lambdaProlog, extends miniKanren with the higher-order logic programming. The existing higher-order unification algorithms, however, are not sound nor complete w.r.t. an intuitive understanding of alpha-equivalence. This paper shows these gaps and proposes a new method to handle alpha-equivalence in higher-order unification.

Thu 26 Aug

Displayed time zone: Seoul change

20:00 - 21:30
Session AminiKanren at miniKanren
Chair(s): William E. Byrd University of Alabama at Birmingham, USA
20:00
5m
Day opening
Opening Remarks
miniKanren

20:05
30m
Paper
A Complexity Study for Interleaving Search
miniKanren
Dmitry Rozplokhas , Dmitri Boulytchev Saint Petersburg State University / JetBrains Research
Pre-print Media Attached
20:35
30m
Paper
metaKanren: Towards a Metacircular Relational Interpreter
miniKanren
Bharathi Ramana Joshi IIIT Hyderabad, William E. Byrd University of Alabama at Birmingham, USA
Pre-print Media Attached
21:05
25m
Paper
A New Higher-order Unification Algorithm for λKanren
miniKanren
Weixi Ma , Daniel P. Friedman Indiana University, USA
Pre-print Media Attached