Related articles
Articles that can be useful in the future.
https://www.microsoft.com/en-us/research/wp-content/uploads/2016/07/ennals-thesis.pdf
Abstracting Abstract Machines https://arxiv.org/pdf/1007.4446.pdf
http://fare.tunes.org/tmp/phd/thesis.pdf
Trees that Grow http://www.jucs.org/jucs_23_1/trees_that_grow/jucs_23_01_0042_0062_najd.pdf
A Nanopass Framework for Compiler Education: https://www.cs.indiana.edu/~dyb/pubs/nano-jfp.pdf
Bottom-up Type Annotation with the Cofree Comonad: https://brianmckenna.org/blog/type_annotation_cofree
[Edited] Grin.Research module was created to reflect this idea. https://github.com/grin-tech/grin/commit/3a55f035970a67b35e3bcea4adb83085e37ee83a
Logical Relations - Compiler verification AhmedLR.pdf
https://github.com/ekmett/bound/blob/master/examples/Overkill.hs
https://gergo.erdi.hu/blog/2015-02-05-typed_embedding_of_stlc_into_haskell/
Monadic Augment and Generalised Short Cut Fusion http://www.cs.appstate.edu/~johannp/jfp06-revised.pdf
Combining Effects and Coeffects via Grading https://www.cs.kent.ac.uk/people/staff/dao7/publ/combining-effects-and-coeffects-icfp16.pdf http://www.cs.ox.ac.uk/conferences/fscd2017/preproceedings_unprotected/TLLA_Orchard.pdf
Total Haskell is Reasonable Coq 1711.09286.pdf
Explaning Type Errors explaining-errors-slides.pdf
Comonadic functional attribute evaluation tfp05-book.pdf
Structured Computation on Trees uustalu0812-slides.pdf
A Syntactic Type System for Recursive Modules oopsla2011.pdf
Introducing the backprop library https://blog.jle.im/entry/introducing-the-backprop-library.html
A Denotational Semantics for Weak Memory Concurrency brookesslides.pdf
Cedille-core: https://github.com/MaiaVictor/cedille-core
Generic Derivation of Induction for Impredicative Encodings in Cedille http://homepage.divms.uiowa.edu/~astump/papers/cpp-2018.pdf
Supercompilation by Evaluation https://www.microsoft.com/en-us/research/wp-content/uploads/2016/07/supercomp-by-eval.pdf
https://www.ponylang.org/
Calculating Correct Compilers: http://www.cs.nott.ac.uk/~pszgmh/ccc.pdf
Making a Fast Curry: Push/Enter vs Eval/Apply for higher order languages:
- https://www.microsoft.com/en-us/research/wp-content/uploads/2016/07/eval-apply.pdf
- https://www.microsoft.com/en-us/research/publication/make-fast-curry-pushenter-vs-evalapply/?from=http%3A%2F%2Fresearch.microsoft.com%2Fen-us%2Fum%2Fpeople%2Fsimonpj%2Fpapers%2Feval-apply%2F
- https://www.microsoft.com/en-us/research/uploads/prod/2016/07/eval-apply-icfp.pdf
Compiling Agda to Haskell with fewer coercions Thesis.pdf
This thesis investigates the viability of trace-based just-in-time (JIT) compilation for optimising programs written in the lazy functional programming language Haskell. Trace-based Just-in-time Compilation for Lazy Functional Programming Languages
Secrets of the Glasgow Haskell Compiler inliner https://ghc.haskell.org/trac/ghc/wiki/Inlining