Stephen Diehl
d8deca44e0
added jit compiler images
2016-01-10 21:47:58 -05:00
Stephen Diehl
4acb416e10
integrate jit compilation with llvm
2016-01-10 21:25:31 -05:00
Stephen Diehl
0b2fa923d7
case expansion algorithm
2016-01-10 21:25:18 -05:00
Stephen Diehl
7662432760
rework tables in introduction
2015-12-31 02:38:45 -05:00
Stephen Diehl
4c13c06936
rewwork table layouts
2015-12-31 02:28:43 -05:00
Stephen Diehl
e8116f5e3d
rephrase path section
2015-12-31 02:03:17 -05:00
Stephen Diehl
afbfd28137
change prompt characters
2015-12-31 02:00:04 -05:00
Stephen Diehl
84762f56a3
deploy pdf
2015-12-31 01:53:36 -05:00
Stephen Diehl
ff22627a01
bump license
2015-12-31 01:51:14 -05:00
Stephen Diehl
8f48a31b04
add datatypes to index
2015-12-31 01:36:05 -05:00
Stephen Diehl
e9d84a9daa
upate ir introduction
2015-12-31 01:34:18 -05:00
Stephen Diehl
e093cbe1db
enable build for chapter 11
2015-12-31 01:29:11 -05:00
Stephen Diehl
d5b2af46fd
spelling
2015-12-22 13:27:34 -05:00
Stephen Diehl
0ae112b173
stack build commands
2015-12-22 13:22:52 -05:00
Stephen Diehl
3d4fd0a074
added readme for poly_constraints
2015-12-22 12:56:52 -05:00
Stephen Diehl
8b91de803d
poly constraint generator solver
2015-12-22 12:55:45 -05:00
Stephen Diehl
480252bf0e
rework poly directory
2015-12-22 12:52:10 -05:00
Stephen Diehl
1b9f62c1d2
rework build directions
2015-12-13 22:16:16 -05:00
Stephen Diehl
ac2eedb58f
crosslink chapter10
2015-12-13 18:19:34 -05:00
Stephen Diehl
dd53d46d0f
added example generics cases
2015-12-13 17:44:06 -05:00
Stephen Diehl
e48d07acd7
except handling for alex lexer
2015-12-13 17:30:02 -05:00
Stephen Diehl
534f229626
fix partiality for evaluation
2015-12-13 16:57:50 -05:00
Stephen Diehl
456dde3faa
refine happy parser example
2015-12-13 13:58:00 -05:00
Stephen Diehl
041b118c5d
crossslink chapter 10
2015-12-12 13:42:06 -05:00
Stephen Diehl
d0c03bb085
memory layout of adts
2015-12-12 12:46:28 -05:00
Stephen Diehl
8c82c07a77
use make under stack shell
2015-12-11 15:20:06 -05:00
Stephen Diehl
46846a99a3
punt on 7.10 for now
2015-12-11 14:30:18 -05:00
Stephen Diehl
3490618206
relax upper bound
2015-12-11 12:13:00 -05:00
Stephen Diehl
5a8b365573
rephrase introduction
2015-12-11 12:06:09 -05:00
Stephen Diehl
671bdddb4e
start work on Chapter 9
2015-12-11 11:49:06 -05:00
Stephen Diehl
9937f91af2
ghc 7.10 for travis
2015-12-11 11:48:54 -05:00
Stephen Diehl
51d32c6f89
update poly implementation to use stack
2015-12-11 11:48:26 -05:00
Stephen Diehl
41b74185f1
fix latex travis build
2015-12-11 11:24:55 -05:00
Stephen Diehl
133c1d82af
bump lambda calculus examples
2015-12-10 10:55:42 -05:00
Stephen Diehl
142b1628a9
added stack support
2015-11-26 19:16:46 -05:00
Stephen Diehl
c536b30c9a
note about latex build
2015-11-21 09:55:41 -05:00
Stephen Diehl
0ecbb87423
build environment
2015-11-21 09:52:39 -05:00
Stephen Diehl
f23c18bf17
Merge pull request #70 from samvher/patch-4
...
Some additions for clarification and minor changes
2015-11-02 09:03:19 -05:00
Stephen Diehl
a61d1a9a2b
Merge pull request #71 from samvher/patch-5
...
Added missing TArr to the type definition
2015-08-10 10:19:17 -04:00
samvher
d8bb6deb0c
Added missing TArr to the type definition
...
TArr is referenced in the code a few times but is never defined. In the code it is part of the Type datatype, so I added it there.
2015-08-09 18:24:01 +02:00
samvher
5443cfd6f3
Some additions for clarification and minor changes
...
I got confused in the beginning due to the different lambda notation, so I read up on wikipedia and found out there was actually no reason to be confused. Still I imagine it could happen to others so I would suggest the short additional paragraph at the beginning.
Also, I just noticed/found out that there is a strong relationship between the SKI combinators and Reader, i.e. that S is ``<*>``, K is ``const``/``pure`` (and I is ``id``/``ask``). And indeed ``const <*> const = id`` so SKK evaluates to I. Maybe this is interesting to mention? (I found it interesting. It's a bit unrelated, but might make people who have more experience with coding Haskell than with lambda calculus feel more familiar.)
I found the Y f = f(Y f) derivation a bit difficult to make in my mind, I think it would be good to show it.
That's it, thanks a lot for the tutorial, I'm finding it very interesting.
2015-08-08 23:18:06 +02:00
Stephen Diehl
70952229ba
Merge pull request #68 from samvher/patch-1
...
Some edits in "Code generation" section
2015-08-08 08:05:46 -04:00
samvher
1ac88fb834
Some edits in "Code generation" section
...
The role of the first few snippets is not completely clear from the text, I think it would be good to give some more context.
2015-08-08 11:09:42 +02:00
Stephen Diehl
9c57331bc1
Merge pull request #67 from dstein64/master
...
"Infix" --> "Prefix" in comment
2015-06-10 15:51:42 -07:00
Daniel Steinberg
a80a1543ed
"Infix" --> "Prefix" in comment
2015-06-10 13:23:49 -04:00
Stephen Diehl
169b738671
Merge pull request #66 from yupferris/master
...
Small fixes in the Introduction chapter
2015-05-17 11:10:03 -04:00
ferris
52cf53031b
Added Jake Taylor to contributors list
2015-05-16 23:12:01 -07:00
ferris
2378153384
Fixed a quite broken sentence in 000_introduction.md
2015-05-16 23:11:05 -07:00
ferris
d52a92fcbd
Small cosmetic fixes in 000_introduction.md
2015-05-16 23:10:04 -07:00
Stephen Diehl
1e26e8fa23
Merge pull request #63 from chsievers/ch008
...
changes to the Extended Parser chapter
2015-04-14 14:22:14 -04:00
