lambda2js alternatives and similar packages
Based on the "Compiler" category.
Alternatively, view lambda2js alternatives based on common mentions on social networks and blogs.

accelerate
Embedded language for highperformance array computations 
piforall
A demo implementation of a simple dependentlytyped language 
hyperhaskellserver
The strongly hyped Haskell interpreter. 
huskscheme
A full implementation of the Scheme programming language for the Haskell Platform. 
hint
Runtime Haskell interpreter [Moved to: https://github.com/haskellhint/hint] 
bound
Combinators for manipulating locallynameless generalized de Bruijn terms 
lambdacubecompiler
LambdaCube 3D is a Haskelllike purely functional language for GPU. Try it out: 
elmstreet
:deciduous_tree: Crossing the road between Haskell and Elm 
haskelltoelm
Generate Elm types, encoders, and decoders from Haskell types 
unbound
Replib: generic programming & Unbound: generic treatment of binders 
accelerateio
Read and write Accelerate arrays in various formats 
haskelm
Haskell to Elm translation using Template Haskell. Contains both a library and executable. 
acceleratefft
FFT library for Haskell based on the embedded array language Accelerate 
elmsyntax
Library for generating Elm syntax from Haskell in a scopesafe way 
lazyboy
An EDSL implemented in Haskell for programming the Nintendo Game Boy. 
feldsparcompiler
This is the compiler for the Feldspar Language.
Static code analysis for 29 languages.
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of lambda2js or a related project?
README
Welcome to lambda2js
Before you get any further: lambda2js is mainly a fun project. So if you are not in the mood simply leave as it is not for you.
If you need something serious, try PureScript, Haste, elm, or Fay.
As you can guess just by looking at the name, lambda2js is compiler that takes simple syntactically sugared untyped lambda calculus and produces JavaScript code. Though this project is meant as fun, it actually works.
Lambda2js is open source (licensed under GPL3) and patches are welcome.
Motivation
Have you ever found yourselves writing JavaScript code and thinking:
"Oh my... How nice would it be to have this function with flipped arguments.
And now I have to write wrapper function, or at least some anonymous function
that will do what I need. In functional language I would simply use
flip
and that would be it!" Well, now it is your time as lambda2js
was brought to light.
Example
In examples you can find [simple example](examples/example.ulc), that will get compiled into
K = function(x){return function(y){return x}}
S = function(f){return function(g){return function(x){return f(x)(g(x))}}}
I = S(K)(K)
Dot = function(f){return function(g){return function(x){return f(g(x))}}}
Flip = function(f){return function(x){return function(y){return f(y)(x)}}}
True = K
Not = Flip
False = Not(True)
If = I
Zero = function(s){return function(z){return z}}
Succ = function(n){return function(s){return function(z){return n(s)(s(z))}}}
IsZero = function(n){return n(K(False))(True)}
Add = function(m){return function(n){return function(s){return function(z){return m(s)(n(s)(z))}}}}
Mul = function(m){return function(n){return function(s){return function(z){return m(n(s))(z)}}}}
Pow = function(m){return function(n){return function(s){return function(z){return n(m)(s)(z)}}}}
One = Succ(Zero)
Two = Succ(One)
Three = Succ(Two)
Tup = function(x){return function(y){return function(p){return p(x)(y)}}}
Fst = function(t){return t(K)}
Snd = function(t){return t(Flip(K))}
Fac = function(n){return Snd(n(function(t){return t(function(x){return function(y){return Tup(Succ(x))(Mul(x)(y))}})})(Tup(One)(One)))}
which is fully functional (pun intended) JavaScript. It can be played with:
combined with small [helper library for seamless integration](examples/helper.js),
one can compute (2+3)!
.
alert(funToInt(Fac(Add(Two)(Three))))
Flipping arguments can be as simple as
alert(uncurry2(Flip(curry2(Math.pow)))(2,3))
...and much more.
Origin
I was playing with JavaScript the other day, pondering higher functions.
Trying the usual stuff like Church numerals
and other. I found myself under avalanche of JavaScript
boilerplate. Just compare function(x){return x}
and \ x . x
.
And then it occurred to me: this can be easily automated! I can write code I like and get code I need. So I sat down to my console and in just couple of moments I came up with 10 commandm^W^Wthis little project. Enjoy.
*Note that all licence references and agreements mentioned in the lambda2js README section above
are relevant to that project's source code only.