/lambda-in-purescript

simple lambda calculus in purescript

Primary LanguagePureScript

Lambda in PureScript

See test directory

Is a lambda claculus implemented in purescript

It supports 3 evaluation types:

  • LAZY:

    • pro: most efficient execution
    • cons: unpredictable performance

  • EAGER:

    • pro: good for debugging, predictable
    • cons: some unused arguments could be evaluated

  • SYMBOLIC:

    • pro: good for suggestions and metaprogramming
    • cons: executes unneeded code

optimal use cases symbolic at compile time, eager at debug, lazy at runtime

a naive implementation of and execution broker could be 3 queues lazy, eager, symbolic, where the evaluations will be partitioned naively the all the jobs from lazy would be executed before proceeding to eager and then lazy but a worker could get a task from eager before all from lazy are executed based on data locality (aka cost)

VSCode extension

TODO

  • introduce types and metaprogramming

  • debugger

  • source maps

  • resolve some non terminating samples

  • analyze program for code duplication (η-conversion + α-conversion)

  • check for undeclared variables

  • hoisting and mutually recursive functions

  • memoization

  • infix operators

  • autocompletion

  • wrap syntax errors

  • atoms

  • FFI

  • implement standard data structures

  • documentation

  • documentation generation

  • playground

  • named parameters

  • common design patterns (ex: dependency injection)

  • common functional data structures

  • implement unit testing

  • good practices assistant (clean code, code complete, TDD, DDD, PEA, GOF)

  • implement other languages features

  • refactoring tools

  • code navigation and view tools

  • refactor

  • bundling for browser and node with npm and bower

  • finish tests

  • parallel execution

  • distributed execution

  • rename symbol (F2 in vscode) with reify

  • import system (throught url + git)

  • derive like in typeclasses

  • stackless interpret (lazy, eager, symbolic)

  • compiler ANF backaend llvm?

  • rust-wasm interpreter

  • extract type from expression with free variables

  • implement beta-abstraction (for free variables binding)

  • eta-abstraction (maybe useful for type restrictions)

  • syntax sugars

    (a.b.c) (c (b a))

    (a, b, c) (a (b c))

    [a b c] (start => cons => (cons (cons (cons start a) b) c))

    [a, b, c] (endin => cons => (cons a (cons b (cons c endin)))

    { x = 1; y = 2; 3 } (joiner => joiner(1, x => joiner(2, y => 3)))

For sake of completeness