Safety of Nöcker's strictness analysis
From MaRDI portal
Publication:3520168
DOI10.1017/S0956796807006624zbMath1153.68012MaRDI QIDQ3520168
Marko Schütz, David Sabel, Manfred Schmidt-Schauss
Publication date: 15 August 2008
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items (11)
Nominal unification with atom-variables ⋮ Nominal Unification and Matching of Higher Order Expressions with Recursive Let ⋮ Unnamed Item ⋮ Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec ⋮ A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case ⋮ Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) ⋮ Making ``stricterness more relevant ⋮ On generic context lemmas for higher-order calculi with sharing ⋮ Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi ⋮ Deciding inclusion of set constants over infinite non-strict data structures ⋮ Nominal unification with letrec and environment-variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of a first-order functional language with sharing
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The revised report on the syntactic theories of sequential control and state
- 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
- A co-induction principle for recursively defined domains
- Lambda calculus with explicit recursion
- Strictness and totality analysis
- Skew confluence and the lambda calculus with letrec
- Discrimination by parallel observers: the algorithm.
- Secrets of the Glasgow Haskell Compiler inliner
- Parametric polymorphism and operational equivalence
- Term Rewriting and All That
- Deciding inclusion of set constants over infinite non-strict data structures
- Strictness, totality, and non-standard-type inference
This page was built for publication: Safety of Nöcker's strictness analysis