Modular, higher-order cardinality analysis in theory and practice

DOI10.1145/2535838.2535861zbMath1284.68151OpenAlexW2038401271MaRDI QIDQ5408429

Dimitrios Vytiniotis, Ilya Sergey, Simon L. Peyton Jones

Publication date: 10 April 2014

Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/1550717/1/Sergey_Modular_%20higher_order.pdf

zbMATH Keywords

operational semanticsstatic analysislazy evaluationcompilersfunctional programming languagestypes and effectsprogram optimisationthunkscardinality analysishaskell

Mathematics Subject Classification ID

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

Related Items (2)

The Negligible and Yet Subtle Cost of Pattern Matching ⋮ Modular, higher order cardinality analysis in theory and practice

Uses Software

• Haskell

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