| Wheeler graphs | |
| Gagie, Manzini, Siren | |
| Theoretical Computer Science, 2017 | |
| https://www.sciencedirect.com/science/article/pii/S0304397517305285 | |
| Notes of a whiteboard presentation to the Bonsai team in Lille. | |
| These notes largely follow the paper. | |
| Rayan Chikhi, 2019 |
| title | author |
|---|---|
Glassery |
Oleg Grenrus |
After I have
improved the raw performance
of optika – a JavaScript optics library,
it's time to make the library (feature-)complete and sound.
Gathering and classifying all possible optic types, gives us a reference point
| #!/usr/bin/env stack | |
| {- stack --resolver lts-7 --install-ghc runghc | |
| --package aeson | |
| --package servant-server | |
| --package text | |
| --package transformers | |
| --package unordered-containers | |
| --package warp | |
| -} |
This document is licensed CC0.
These are some questions to give a sense of what you know about FP. This is more of a gauge of what you know, it's not necessarily expected that a single person will breeze through all questions. For each question, give your answer if you know it, say how long it took you, and say whether it was 'trivial', 'easy', 'medium', 'hard', or 'I don't know'. Give your answers in Haskell for the questions that involve code.
Please be honest, as the interviewer may do some spot checking with similar questions. It's not going to look good if you report a question as being 'trivial' but a similar question completely stumps you.
Here's a bit more guidance on how to use these labels:
