Write Yourself a Haskell in Lisp
gergo.erdi.hu
Write Yourself a Haskell in Lisp
1–10 of 14 posts
Re: Write Yourself a Haskell in Lisp
#2Cool. Does it qualify as some sort of mutual recursion if you use haskell to build a lisp which builds haskell?
Re: Write Yourself a Haskell in Lisp
#3Cool. Does it qualify as some sort of mutual recursion if you use haskell to build a lisp which builds haskell?
You can use this tutorial for the first step if you want to do it: Write Yourself a Scheme in 48 Hours by Jonathan Tang. http://jonathan.tang.name/files/scheme_in_48/tutorial/overvi...
Re: Write Yourself a Haskell in Lisp
#4Make the Yule-tide gay.
Re: Write Yourself a Haskell in Lisp
#5If you're interested in something similar but a little more theoretical, take a look at "Simply Easy"[1], a little paper on implementing a couple of variations on the lambda calculus. The main idea is to demonstrate how to evaluate a dependently typed language.
It starts by looking at how to evaluate the simply typed lambda calculus and then going from that to a dependently typed lambda calculus. Surprisingly, the transformation is not all that complicated!
The actual code is in Haskell.
Re: Write Yourself a Haskell in Lisp
#6Another 'X written in Y' post. Awesome.
I think I'll save myself the wasted time and just use X from the get-go.
Re: Write Yourself a Haskell in Lisp
#7Cool. Does it qualify as some sort of mutual recursion if you use haskell to build a lisp which builds haskell?
You can use this tutorial for the first step if you want to do it: Write Yourself a Scheme in 48 Hours by Jonathan Tang. http://jonathan.tang.name/files/scheme_in_48/tutorial/overvi...
It would be interesting to see how many languages you could nest before the interpreter becomes too slow to be of use.
Re: Write Yourself a Haskell in Lisp
#8Another 'X written in Y' post. Awesome. I think I'll save myself the wasted time and just use X from the get-go.
Well, the semantics of a lazy language are a bit different than usual. While I agree that pages of s-expressions are hard to feel, seeing the graph reduction algorithm on a few examples was quite refreshing.
Re: Write Yourself a Haskell in Lisp
#9Another 'X written in Y' post. Awesome. I think I'll save myself the wasted time and just use X from the get-go.
The point isn't to replace X. It's to learn more about X and Y.
Re: Write Yourself a Haskell in Lisp
#10Earlier quoted context omitted.
You can use this tutorial for the first step if you want to do it: Write Yourself a Scheme in 48 Hours by Jonathan Tang. http://jonathan.tang.name/files/scheme_in_48/tutorial/overvi...
It would be interesting to see how many languages you could nest before the interpreter becomes too slow to be of use.
What would be interesting about it?