https://github.com/yinwang0/historical

Some educational code written 10+ years ago at IU
https://github.com/yinwang0/historical

Last synced: about 2 months ago
JSON representation

Some educational code written 10+ years ago at IU

• Host: GitHub
• URL: https://github.com/yinwang0/historical
• Owner: yinwang0
• Created: 2011-07-22T09:27:08.000Z (about 13 years ago)
• Default Branch: master
• Last Pushed: 2022-04-20T09:53:28.000Z (over 2 years ago)
• Last Synced: 2024-07-18T18:57:14.849Z (2 months ago)
• Language: Scheme
• Homepage:
• Size: 98.6 KB
• Stars: 25
• Watchers: 4
• Forks: 28
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
* cps.ss - CPS transformer without administrative redexes

* compiler.ss - a compiler from Scheme to X64 assembly

* meta-interp.ss - meta-circular interpreter that can interpret itself

  to any level

* infer.ss - Hindly-Milner style type inferencer for lambda calculus

  (without let-polymorphism)

* mk-c.ss - modified implementation of the logic language miniKanren with a

  constraint-based negation operator

* interp-call-by-value.ss - simple call-by-value interpreter

* interp-call-by-name.ss - simple call-by-name interpreter

* interp-lazy.ss - interpreter with lazy semantics

* interp-delim.ss - simple interpreter with delimited continuation

  operators (shift/reset/shift0/reset0)

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

* cek.ss - a "reversible" CEK abstract machine which can run forwards and

  backwards and change directions.

* encoding.scm - "church encoding" of various things in the lambda

  calculus, used by some other code (e.g. lazy-ski.ss)

* pmatch.scm - supporting macro for pattern matching, used by some

  other programs here (compatible with most Scheme implementations)