TODO

Planned features:

Apps

• WebApp - only for JS
• CliApp - for all targets

Languages and Modules

• Functional
  • Lambda Calculus Calculator
  • (Self Hosted) Untyped Haskell or PrimaryScripter
  • Hygienic MacroSchemer
• Imperative
  • Holy C-like TransCompiler
  • TCL for PreProcessor and High Portable Assembler
  • Minimal Automaton

Lambda Calculus Calculator

Lambda Calculus Styles

• Haskell where style (UnTyped Haskell)
• Haskell let style
• LambdaCraft Style
• Lazier style
• Fruit style

Encodings

Some of these are for Untyped Haskell

• https://en.wikipedia.org/wiki/Church_encoding, List encoding
  • Two pairs as a list node
  • One pair as a list node
  • Represent the list using right fold (System F)
  • Represent the list using Scott encoding

Calculators

• Lambda Calculator BadLam
• Combinator Calculators
  • LazyK
  • Crazy L
  • Ultimate Lambda
• Binary Calculators
  • Zot
  • Binary Lambda Calculus
    • John's Lambda Calculus and Combinatory Logic Playground
  • Universal Lambda

Improvements of calculators

• Interactive Calculator. First calculators are pure but not interactive. Use only simply lazy stream to Input and Output. We can change it with:
  • Tagless Final
  • MTL
  • Free Monad - it is better then Tagless ?
• Other Improvements
  • Continuation Monad - Every step of compiler as ContT
  • Arrow
  • Kleisli vel ReaderT
  • GADTs - it is better then ADT?

Untyped Haskell

• The Scott encoding
  • https://en.wikipedia.org/wiki/Mogensen%E2%80%93Scott_encoding
  • https://crypto.stanford.edu/~blynn/compiler/scott.html
• The Parigot encoding
  • https://gist.github.com/kamil-adam/0a8fa211cd73b5d949c2178991951a01
  • https://homepage.divms.uiowa.edu/~astump/talks/colloq-10-24-2014.pdf
• https://en.wikipedia.org/wiki/System_F
• https://en.wikipedia.org/wiki/System_U
• https://en.wikipedia.org/wiki/Lambda-mu_calculus