algebraic 1
Algebraic Generating Functions for Languages Avoiding Riordan Patterns
amortized 1
The (aux fds sbral) module
arrays 1
Purely functional random-access lists
callcc 4
Final shift for call/cc Call with Current Continuation Patterns The Seasoned Schemer Representing monads
canonical 1
Functions and Jordan canonical forms of Riordan matrices
centralities 1
Axioms for Centrality
circular 1
Pattern matching
constraints 1
miniKanren, live and untagged
continuations 1
Hyperfunctions
functional 3
The (aux fds sbral) module Efficient representations for triangular substitutions Purely functional random-access lists
generating functions 1
Algebraic Generating Functions for Languages Avoiding Riordan Patterns
hermite 1
Functions and Jordan canonical forms of Riordan matrices
igraph 2
Rust bindings for igraph The igraph software package for complex network research
indexing 2
The (aux fds sbral) module Purely functional random-access lists
interpreter 1
Pattern matching
interpreters 1
miniKanren, live and untagged
jordan 1
Functions and Jordan canonical forms of Riordan matrices
kanren 2
Efficient representations for triangular substitutions miniKanren, live and untagged
lists 1
Purely functional random-access lists
logarithmic 1
Purely functional random-access lists
logic 2
Efficient representations for triangular substitutions miniKanren, live and untagged
lookup 3
The (aux fds sbral) module Efficient representations for triangular substitutions Purely functional random-access lists
macrology 1
Pattern matching
matching 1
miniKanren, live and untagged
matrices 2
Functions and Jordan canonical forms of Riordan matrices Algebraic Generating Functions for Languages Avoiding Riordan Patterns
meta 1
Pattern matching
minikanren 2
Efficient representations for triangular substitutions miniKanren, live and untagged
monads 2
Final shift for call/cc Representing monads
pattern matching 2
Pattern matching Guarded commands, nondeterminacy and formal derivation of programs
patterns 1
Algebraic Generating Functions for Languages Avoiding Riordan Patterns
persistent 2
The (aux fds sbral) module Purely functional random-access lists
postgresql 1
Running PostgreSQL natively vs into containers
quines 1
miniKanren, live and untagged
randomaccess 1
Purely functional random-access lists
relational 1
miniKanren, live and untagged
reset 2
Final shift for call/cc Representing monads
riordan 2
Functions and Jordan canonical forms of Riordan matrices Algebraic Generating Functions for Languages Avoiding Riordan Patterns
satisfiability 2
TAOCP, Volume 4, Fascicle 6: Satisfiability The Silent (R)evolution of SAT
sbral 2
The (aux fds sbral) module Efficient representations for triangular substitutions
scheme 3
The (aux fds sbral) module Efficient representations for triangular substitutions miniKanren, live and untagged
sequences 1
The (aux fds sbral) module
shift 2
Final shift for call/cc Representing monads
substitutions 1
Efficient representations for triangular substitutions
taocp 1
Teaching the art of computer programming
trees 1
The (aux fds sbral) module
triangular 1
Efficient representations for triangular substitutions
unification 1
Efficient representations for triangular substitutions
untagged 1
miniKanren, live and untagged
update 2
The (aux fds sbral) module Purely functional random-access lists