Cool! I&#x27;m also working on a visual functional language conceptually similar Haskell. I&#x27;m a founder of <a href="http:&#x2F;&#x2F;www.filterforge.com" rel="nofollow">http:&#x2F;&#x2F;www.filterforge.com</a>, and I want to develop a proper (i.e. Turing-complete, strongly typed with type inference, pure, lazily-evaluated) visual language for the next major rewrite of Filter Forge. Here&#x27;s what I&#x27;ve been able to achieve so far:<p>A simple program (with equivalent Haskell and Racket code):
<a href="http:&#x2F;&#x2F;i.imgur.com&#x2F;dsNJYyx.png" rel="nofollow">http:&#x2F;&#x2F;i.imgur.com&#x2F;dsNJYyx.png</a><p>List of strings, with element insertion GUI:
<a href="http:&#x2F;&#x2F;i.imgur.com&#x2F;Re64IJE.png" rel="nofollow">http:&#x2F;&#x2F;i.imgur.com&#x2F;Re64IJE.png</a><p>A more complex program, a function definition, and some sugar for infix math:
<a href="http:&#x2F;&#x2F;i.imgur.com&#x2F;KoxjoOM.png" rel="nofollow">http:&#x2F;&#x2F;i.imgur.com&#x2F;KoxjoOM.png</a><p>Fold using a lambda, with equivalent Haskell code:
<a href="http:&#x2F;&#x2F;i.imgur.com&#x2F;avQNHXS.png" rel="nofollow">http:&#x2F;&#x2F;i.imgur.com&#x2F;avQNHXS.png</a><p>Complex signatures, polymorphism and typeclasses:
<a href="http:&#x2F;&#x2F;i.imgur.com&#x2F;cZ4KMzt.png" rel="nofollow">http:&#x2F;&#x2F;i.imgur.com&#x2F;cZ4KMzt.png</a>