sergei-romanenko/unmix
A simple program specializer (based on partial evaluation) for a subset of Scheme. It includes a binding time analyzer, a residual program generator and an arity raiser. Imported from Google Code.
Normalization by evaluation and big-step normalization formalized in Agda
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
A simple program specializer (based on partial evaluation) for a subset of Scheme. It includes a binding time analyzer, a residual program generator and an arity raiser. Imported from Google Code.
Automatically exported from code.google.com/p/cilpe
Constructive proofs of Higman’s lemma formalized in Agda
Almost-full relations: an Agda version for "Stop when you are almost-full"