-
-
Notifications
You must be signed in to change notification settings - Fork 36
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Related articles #1
Comments
Abstracting Abstract Machines |
A Nanopass Framework for Compiler Education: |
Bottom-up Type Annotation with the Cofree Comonad: [Edited] |
Logical Relations - Compiler verification |
Monadic Augment and Generalised Short Cut Fusion |
Combining Effects and Coeffects via Grading |
Total Haskell is Reasonable Coq |
Explaning Type Errors |
Comonadic functional attribute evaluation |
Structured Computation on Trees |
A Syntactic Type System for Recursive Modules |
Introducing the backprop library |
A Denotational Semantics for Weak Memory Concurrency |
Cedille-core: |
Generic Derivation of Induction for Impredicative Encodings in Cedille |
Supercompilation by Evaluation |
Calculating Correct Compilers: |
Compiling Agda to Haskell with fewer coercions |
What is contification? |
Language Support for Programming High-Performance Code |
SIMD@OpenMP: A Programming Model Approach to Leverage SIMD Features |
Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap Kinds Are Calling Conventions https://blog.cloudflare.com/building-fast-interpreters-in-rust/ |
Control-Flow Analysis of Functional Programs good overview for CFA and related analyses |
VeGen, The Vectorizer Generator for SIMD and Beyond |
Lecture Notes on Static Analysis good intro material |
A Flow-Sensitive Approach for Steensgaard’s Pointer Analysis Making Context-sensitive Points-to Analysis with Heap Cloning Practical For The Real World |
Heap Abstractions for Static Analysis |
papers for next-gen compiler design: Calculating correct compilers II: Return of the register machines Systematic abstraction of abstract machines Abstracting Abstract Machines |
Trace-based just-in-time compiler for Haskell with RPython |
Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis |
Ningning Xie: Perceus: garbage free reference counting with reuse |
Compositional Pointer and Escape Analysis for Java Programs, 1999 Incrementalized Pointer and Escape Analysis, 2001 Fast Escape Analysis and Stack Allocation for Object-Based Programs, 2000 Escape Analysis in the Context of Dynamic Compilation and Deoptimization, 2005 Compiling with Continuations, or without? Whatever. Can a Shape Analysis Work at Run-time, 2001 Pointer and Escape Analysis for Multithreaded Programs, 2001 Shape Analysis (2000) |
https://www.mmtk.io/ |
Declarative Whole-Program Escape Analysis for Java |
Defensive Points-To Analysis: Effective Soundness via Laziness |
A massively parallel, optimal functional runtime in Rust |
Bidirectional typing in souffle datalog |
Calculating Dependently-Typed Compilers (Functional Pearl) |
Scheme Workshop Keynote: Andy Keep Flow-Sensitive Type Recovery in Linear-Log Time The Development of Chez Scheme A Practical and Flexible Flow Analysis for Higher-Order Languages Fast and Effective Procedure Inlining |
Efficient and Scalable Parallel Functional Programming Through Disentanglement |
On a Strongly Normalizing STG Machine |
Example for great Integrated Development Environment |
Better Defunctionalization through Lambda Set Specialization |
FP^2: Fully in-Place Functional Programming |
Articles that can be useful in the future.
The text was updated successfully, but these errors were encountered: