Safety of Nöcker's strictness analysis

DOI10.1017/S0956796807006624zbMATH Open1153.68012MaRDI QIDQ3520168FDOQ3520168

Authors: David Sabel, Marko Schütz, Manfred Schmidt-Schauß 

Publication date: 15 August 2008

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

Recommendations

• On the power and limitations of strictness analysis
• Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^†
• scientific article; zbMATH DE number 3967886
• Publication:4721629
• Strictness and totality analysis

zbMATH Keywords

contextual semanticsClean compilerfunctional core language

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18)

Cites Work

• Secrets of the Glasgow Haskell Compiler inliner
• Title not available (Why is that?)
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The revised report on the syntactic theories of sequential control and state
• Term Rewriting and All That
• Properties of a first-order functional language with sharing
• Strictness and totality analysis
• Strictness, totality, and non-standard-type inference
• A co-induction principle for recursively defined domains
• Skew confluence and the lambda calculus with letrec
• Parametric polymorphism and operational equivalence
• Lambda calculus with explicit recursion
• Title not available (Why is that?)
• Discrimination by parallel observers: the algorithm.
• Title not available (Why is that?)
• Deciding inclusion of set constants over infinite non-strict data structures

Cited In (18)

• A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
• Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
• Title not available (Why is that?)
• Nominal unification with letrec and environment-variables
• Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
• Nominal unification with atom-variables
• Title not available (Why is that?)
• Proof Tool Support for Explicit Strictness
• Algebraic correctness proofs for compiling recursive function definitions with strictness information
• Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
• Towards Fast Nominal Anti-unification of Letrec-Expressions
• On the power and limitations of strictness analysis
• Making ``stricterness more relevant
• Deciding inclusion of set constants over infinite non-strict data structures
• On generic context lemmas for higher-order calculi with sharing
• Title not available (Why is that?)
• Nominal Unification and Matching of Higher Order Expressions with Recursive Let
• Title not available (Why is that?)

Uses Software

• Haskell

This page was built for publication: Safety of Nöcker's strictness analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520168)