mrdomino/hsnock
1
1
Fork 0
mirror of https://github.com/mrdomino/hsnock.git synced 2024-10-05 17:47:44 +03:00
Code Issues Packages Projects Releases Wiki Activity
Nock 5K interpreter in Haskell
44 Commits 1 Branch 10 Tags 73 KiB
Haskell 100%
2c33b12f83
Go to file
Steven Dee 2c33b12f83 Collapse the fas recursive cases together 
This "obviously" works. Just in case, I've added a check.
2013-10-26 17:58:05 -04:00
Language Collapse the fas recursive cases together 2013-10-26 17:58:05 -04:00
hsnock.cabal Bump to 0.4.1 2013-10-26 16:37:27 -04:00
hsnock.lhs Clean things up a bit 2013-10-20 22:09:42 -04:00
README Add a real README 2013-10-21 10:12:27 -04:00
Setup.hs Cabal-ize and readline-ize 2013-10-20 18:43:55 -04:00
test.hs Collapse the fas recursive cases together 2013-10-26 17:58:05 -04:00

README 

Usage:
./hsnock.lhs

Try forms like:
[42 1 0]
[42 0 1]
[[1 3 2] 0 3]
[42 [8 [1 0] 8 [1 6 [5 [0 7] 4 0 6] [0 6] 9 2 [0 2] [4 0 6] 0 7] 9 2 0 1]]
[[42 43] [8 [1 0] [8 [1 [6 [5 [0 6] [0 14]] [1 0] [6 [5 [0 6] [0 15]] [1 1] [9 2 [[0 2] [4 0 6] [0 7]]]]]] [9 2 0 1]]]]
[[43 42] [8 [1 0] [8 [1 [6 [5 [0 6] [0 14]] [1 0] [6 [5 [0 6] [0 15]] [1 1] [9 2 [[0 2] [4 0 6] [0 7]]]]]] [9 2 0 1]]]]

See also:
http://www.urbit.org/2013/08/22/Chapter-2-nock.html