Related articles

[andorp]

Articles that can be useful in the future.

[andorp]

https://www.microsoft.com/en-us/research/wp-content/uploads/2016/07/ennals-thesis.pdf

[andorp]

Abstracting Abstract Machines https://arxiv.org/pdf/1007.4446.pdf

[andorp]

http://fare.tunes.org/tmp/phd/thesis.pdf

[andorp]

Trees that Grow http://www.jucs.org/jucs_23_1/trees_that_grow/jucs_23_01_0042_0062_najd.pdf

[andorp]

A Nanopass Framework for Compiler Education: https://www.cs.indiana.edu/~dyb/pubs/nano-jfp.pdf

[andorp]

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

[andorp]

Logical Relations - Compiler verification AhmedLR.pdf

[andorp]

https://github.com/ekmett/bound/blob/master/examples/Overkill.hs

[andorp]

https://gergo.erdi.hu/blog/2015-02-05-typed_embedding_of_stlc_into_haskell/

[andorp]

Monadic Augment and Generalised Short Cut Fusion http://www.cs.appstate.edu/~johannp/jfp06-revised.pdf

[andorp]

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

[andorp]

Total Haskell is Reasonable Coq 1711.09286.pdf

[andorp]

Explaning Type Errors explaining-errors-slides.pdf

[andorp]

Comonadic functional attribute evaluation tfp05-book.pdf

[andorp]

Structured Computation on Trees uustalu0812-slides.pdf

[andorp]

Functorial Data Migration.pdf

[andorp]

A Syntactic Type System for Recursive Modules oopsla2011.pdf

[andorp]

Introducing the backprop library https://blog.jle.im/entry/introducing-the-backprop-library.html

[andorp]

A Denotational Semantics for Weak Memory Concurrency brookesslides.pdf

[andorp]

On the type structure of standard ML

[andorp]

Cedille-core: https://github.com/MaiaVictor/cedille-core

[andorp]

Generic Derivation of Induction for Impredicative Encodings in Cedille http://homepage.divms.uiowa.edu/~astump/papers/cpp-2018.pdf

[csabahruska]

Supercompilation by Evaluation https://www.microsoft.com/en-us/research/wp-content/uploads/2016/07/supercomp-by-eval.pdf

[csabahruska]

https://www.ponylang.org/

[andorp]

Calculating Correct Compilers: http://www.cs.nott.ac.uk/~pszgmh/ccc.pdf

[andorp]

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

[andorp]

Compiling Agda to Haskell with fewer coercions Thesis.pdf

[csabahruska]

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

[csabahruska]

Secrets of the Glasgow Haskell Compiler inliner https://ghc.haskell.org/trac/ghc/wiki/Inlining

[andorp]

Ready Set Verify!

[andorp]

Incremental Garbage Collection for GHC: gc-exploringbarriertoentry.pdf

[csabahruska]

https://ghc.haskell.org/trac/ghc/wiki/ReadingList

[andorp]

Sequent Calculus as a Compiler Intermediate Language

[andorp]

http://cs.nott.ac.uk/~jph/progs4cheap.pdf

[andorp]

Categorical Programming with Abstract Data Types

[andorp]

Random access to Abstract Data Types

[andorp]

Absal is a cleaned up adaptation of Lamping's Abstract Algorithm. https://github.com/MaiaVictor/abstract-algorithm Interaction combinators

[csabahruska]

Supporting Separate Compilation in a Defunctionalizing Compiler

Abstract Interpretation of Functional Programs using an Attribute Grammar System

[csabahruska]

Compiling Tree Transforms to Operate on Packed Representations https://engineering.purdue.edu/~milind/docs/ecoop17.pdf

[andorp]

Demand Analysis https://www.microsoft.com/en-us/research/publication/demand-analysis/ https://www.microsoft.com/en-us/research/wp-content/uploads/2006/07/demand-1.pdf

[csabahruska]

GPU Data-Flow: http://matt.might.net/papers/prabhu2011eigencfa.pdf

[csabahruska]

A parallel approach for solving data flow analysis problems https://www.researchgate.net/publication/287083768_A_parallel_approach_for_solving_data_flow_analysis_problems

[csabahruska]

Olin Shivers, PhD thesis: Control-Flow Analysis of Higher-Order Languages http://www.ccs.neu.edu/home/shivers/papers/diss.pdf

[csabahruska]

Incrementalized Pointer and Escape Analysis (Frédéric Vivien, Martin Rinard)

[csabahruska]

Dijkstra, A., Fokker, J.D. & Swierstra, S.D. (2009). The architecture of the Utrecht Haskell compiler

[csabahruska]

Paper about more efficient data-flow analysis execution: A Graph–Free Approach to Data–Flow Analysis

[andorp]

Regions, Linearity, Garbage collection https://cyclone.thelanguage.org/wiki/Papers/

[andorp]

Secrets of the Glasgow Haskell Compiler inliner https://www.microsoft.com/en-us/research/wp-content/uploads/2002/07/inline.pdf

[csabahruska]

http://fixpt.de/blog/2018-12-30-strictness-analysis-part-2.html

[csabahruska]

Optimizing Lazy Functional Programs Using Flow Inference (Karl-Filip Faxen) https://www.researchgate.net/publication/221477317_Optimizing_Lazy_Functional_Programs_Using_Flow_Inference