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.
Discovered public repositories for sergei-romanenko in the GitHub catalog.
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
Normalization by evaluation and big-step normalization formalized in Agda
Constructive proofs of Higman’s lemma formalized in Agda
Almost-full relations: an Agda version for "Stop when you are almost-full"
Intuitionistic Ramsey theorem (a proof in Agda)
Experiments with Sat4j.
Staged multi-result supercompilation (a model in Agda)
A markdown test.
A collection of samples in Agda
Hereditary substitutions for simple types (revised)
A simple supercompiler formally verified in Agda
Experiments with Agda
A variation of mrsc based on traits + self-types
Domain-specific supercompilation for transition systems (based on the MRSC toolkit).