GitHub - fangfeixue/gems: my most beautiful programs

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 34 Commits
README		README
boolean-simp.ss		boolean-simp.ss
bottom-up-typing.ss		bottom-up-typing.ss
cek.ss		cek.ss
cps.ss		cps.ss
encoding.scm		encoding.scm
infer-tests.ss		infer-tests.ss
infer.ss		infer.ss
interp-call-by-name.ss		interp-call-by-name.ss
interp-call-by-value.ss		interp-call-by-value.ss
interp-delim.ss		interp-delim.ss
interp-lazy.rkt		interp-lazy.rkt
lazy-ski.ss		lazy-ski.ss
meta-interp.ss		meta-interp.ss
mk-c.scm		mk-c.scm
mut-y.ss		mut-y.ss
pmatch.scm		pmatch.scm
zipper.ss		zipper.ss

Repository files navigation

Some very interesting code. They are extremely short, yet extremely powerful.

* cps.ss - a CPS transformer

* meta-interp.ss - a meta-circular interpreter (reflection tower)

* infer.ss - a type inferencer for the lambda calculus. It can infer
  infinite types (such as delta, omega, and the Y-combinator)

* bottom-up-typing.ss - a bottom-up type inference algorithm for
  Hindley-Milner system

* mk-c.ss - a modified miniKanren implementation with a negation
  operator

* interp-call-by-need.ss - a lazy interpreter

* lazy-ski.ss - a compiler from lambda calculus to "lazy combinators"

* interp-delim.ss - a simple interpreter with delimited continuation
  operators (shift/reset/shift0/reset0)

* encoding.scm - encodings of various things in the lambda calculus

* pmatch.scm - supporting macro for pattern matching