| 1 |
Tutorial: Transparent interfaces in Haskell |
text |
| 2 |
Can you Church-encode a stream? |
text |
| 3 |
On how I write (recognizing skimming) |
text |
| 4 |
Build systems are logic programming languages (à la Carte paper discussion) |
text |
| 5 |
Highlights on Kovács' NbE STLC thesis |
text |
| 6 |
How to read code: the next generation |
text |
| 7 |
Hierarchical Free Monads: Myopic alternative to Tagless Final |
text |
| 8 |
Partial evaluation with expansion and contraction |
text |
| 9 |
This is not a monad tutorial |
text |
| 10 |
Linear continuations and cla***ical linear logic |
text |
| 11 |
Typechecking for justified nets |
text |
| 12 |
Optimal reduction with sausages |
text |
| 13 |
Continuations for normalising sum types |
text |
| 14 |
Understand IO Monad and implement it yourself in Haskell |
text |
| 15 |
Hereditary subst**utions |
text |
| 16 |
Typechecking for Cla***ical Linear Logic sequents |
text |
| 17 |
The categorical abstract machine Mk.2 |
text |
| 18 |
Game semantics & cartesian closed categories |
text |
| 19 |
Adjoint functors & normalization |
text |
| 20 |
Dependent types and pullbacks |
text |
| 21 |
Typechecking & parametric polymorphism in cartesian closed categories |
text |
| 22 |
Adjoint functors visualized |
text |
| 23 |
Inverted representation of dependent types |
text |
| 24 |
Adjoint functors |
text |
| 25 |
Geometric algebra (duals) (cont) |
text |
| 26 |
Interpreting geometric algebra |
text |
| 27 |
s***fting functors: Alternative for numerical towers? |
text |
| 28 |
Things to say about typescript |
text |
| 29 |
Sugar prevents weight loss |
text |
| 30 |
Preparing wordprocessing-format dogfood |
text |
| 31 |
Granularizing "Not P" for error messages |
text |
| 32 |
"Structure of interaction" interesting paper |
text |
| 33 |
Elm experiences |
text |
| 34 |
Implemented linear abstract machine |
text |
| 35 |
Geometry of interaction and optimal reduction |
text |
| 36 |
Quadratic equation solution (it's actually a nice trick) |
text |
| 37 |
Sketch of a language |
text |
| 38 |
Error correcting Earley parsing |
text |
| 39 |
Merging of Lisp with Lisp with types |
text |
| 40 |
Invertible lexical analysis & Regular expressions |
text |
| 41 |
Ideas on word processing |
text |
| 42 |
Error correction in LR parsing |
text |
| 43 |
Layout sensitive LR(1) algorithm analysis |
text |
| 44 |
How to write your own LR(1) parsing tables (and generate them) |
text |
| 45 |
Flaws in structured programming |
text |
| 46 |
Idris2 & Vim channels & Vim plugin development |
text |
| 47 |
Implicit arguments can trip you |
text |
| 48 |
Grabbag of Idris tricks |
text |
| 49 |
Earley parsing in Idris: WellFounded (Part 2) |
text |
| 50 |
Earley parsing in Idris (Part 1) |
text |