Modular, higher order cardinality analysis in theory and practice

DOI10.1017/S0956796817000016zbMath1418.68046OpenAlexW2573436692MaRDI QIDQ5372006

Joachim Breitner, Ilya Sergey, Dimitrios Vytiniotis, Simon L. Peyton Jones

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796817000016

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Logic in computer science (03B70)

Uses Software

• nofib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Making ``stricterness more relevant
• Operational interpretations of linear logic
• A transformation-based optimiser for Haskell
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• Deriving a lazy abstract machine
• Tail recursion without space leaks
• A generic usage analysis with subeffect qualifiers
• Abstracting abstract machines
• A type based sharing analysis for update avoidance and optimisation
• Modular, higher-order cardinality analysis in theory and practice
• Making a fast curry: push/enter vs. eval/apply for higher-order languages
• Improving flow analyses via ΓCFA

This page was built for publication: Modular, higher order cardinality analysis in theory and practice