BiRank
Towards Ranking on Bipartite Graphs
Efficient representations for triangular substitutions
A comparison in miniKanren
This paper studies efficient representations for triangular substitutions in miniKanren, showing how skew binary random-access lists reduce lookup costs while preserving the advantages of a purely functional Scheme implementation.
[Read More]
Axioms for Centrality
miniKanren, live and untagged
Quine generation via relational interpreters
This paper presents relational interpreters for subsets of Scheme in miniKanren, emphasizing backward execution, quine generation, constraint-based reasoning, and untagged representations that simplify interpreter design.
[Read More]
Teaching the art of computer programming
The igraph software package for complex network research
Final shift for call/cc
Direct implementation of shift and reset
Call with Current Continuation Patterns
Cogen in six lines
Posts