sanchayanmaity/haskell-notebooks
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

Compare commits

base: sanchayanmaity:9db42001f421c53f458dbb943b01335c798f5a4c
Branches Tags
sanchayanmaity:master
..
compare: sanchayanmaity:ca5e28e244706cc90d5987188523ce9d24b4ad62
Branches Tags
sanchayanmaity:master

2 commits
9db42001f4 ... ca5e28e244

Author SHA1 Message Date
Sanchayan Maity ca5e28e244 Add another blog post for existential types 2023-03-20 21:03:04 +05:30
Sanchayan Maity 0686c83ab2 Add a note on Final Tagless 2023-03-20 21:02:52 +05:30
2 changed files with 3 additions and 1 deletions
Show stats Expand all files Collapse all files

2
FinalTagless.md
View file

@ -57,7 +57,7 @@ This is the final tagless style.
```haskell
data Tree v where
Leaf :: forall v. v -> Tree v
Node :: forall v. Tree v -> Tree v -> Tree v.
Node :: forall v. Tree v -> Tree v -> Tree v
```
and

2
existential-types.md
View file

@ -2,6 +2,8 @@ https://gist.github.com/CMCDragonkai/b203769c588caddf8cb051529339635c
http://iveselov.info/posts/2012-08-30-existential-types.html
https://markkarpov.com/post/existential-quantification.html
Great explanation by Anupam Jain in FPNCR Telegram channel :)
Everything gets a forall.