sergei-romanenko/agda-Ramsey-theorem

Stars
5
Rank 2,861,937 (Top 57 %)
Language Agda
Created about 10 years ago
Updated about 10 years ago

sergei-romanenko/agda-Ramsey-theorem

sergei-romanenko

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Intuitionistic Ramsey theorem (a proof in Agda)

spsc

SPSC: A Small Positive Supercompiler

agda-simple-scp

A simple supercompiler formally verified in Agda

staged-mrsc-agda

Staged multi-result supercompilation (a model in Agda)

agda-samples

A collection of samples in Agda

spsc-scala

A Small Positive Supercompiler in Scala

agda-miscellanea

Experiments with Agda

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.

agda-almost-full

Almost-full relations: an Agda version for "Stop when you are almost-full"

spsc-idris

A Small Positive Supercompiler in Idris

chapman-big-step-normalization

Big-step normalization (formalized in Agda)

spinalhdl-samples

Some experiments with SpinalHDL

sat4j-experiments

Experiments with Sat4j.

mrsc-trs

Domain-specific supercompilation for transition systems (based on the MRSC toolkit).

agda-Higman-lemma

Constructive proofs of Higman’s lemma formalized in Agda

mrsct

A variation of mrsc based on traits + self-types

scp-notes-ru

Notes on supercompilation (in Russian). The sources for the site

idris-samples

A collection of samples in Idris

idris-norm-by-traversals

Traversal-based normalization for ULC

chapman-normalization-delay-monad

Normalization by evaluation in the delay monad (formalized in Agda)

sergei-romanenko.github.io

The sources for the site

agda-hsubst-revised

Hereditary substitutions for simple types (revised)

agda-normalization

Normalization by evaluation and big-step normalization formalized in Agda

staged-mrsc-idris2

Staged multi-result supercompilation (in Idris2)