Safety of Nöcker's strictness analysis

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Journal of functional programming

• Publication date

  2007-11-08

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1017/S0956796807006624
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Lambda Calculus

  2009influential reference
• Deciding inclusion of set constants over infinite non-strict data structures

  2007cited by this paper
• Deciding subset relationship of co-inductively defined set constants

  2005influential reference
• Skew confluence and the lambda calculus with letrec

  2002cited by this paper
• Secrets of the Glasgow Haskell Compiler inliner

  2002cited by this paper
• Strictness, totality, and non-standard-type inference

  2002cited by this paper
• Lambda Calculi and Linear Speedups

  2002cited by this paper
• Striktheitsanalysen funktionaler Sprachen

  2000cited by this paper
• Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures

  2000cited by this paper
• Operational Semantics and Program Equivalence

  2000cited by this paper
• Safety of Strictness Analysis via Term Graph Rewriting

  2000influential reference
• Analyzing demand in non-strict functional programming languages

  2000influential reference
• Discrimination by Parallel Observers: The Algorithm

  1999cited by this paper
• Improvement in a lazy context: an operational theory for call-by-need

  1999cited by this paper
• Erratic Fudgets: a semantic theory for an embedded coordination language

  1999influential reference
• The call-by-need lambda calculus

  1998cited by this paper
• Strictness and Totality Analysis

  1998cited by this paper
• Existential Types: Logical Relations and Operational Equivalence

  1998cited by this paper
• Inference of polymorphic and conditional strictness properties

  1998cited by this paper
• Higher Order Demand Propagation

  1998cited by this paper
• Term rewriting and all that

  1998cited by this paper
• Discrimination by parallel observers

  1997cited by this paper
• Lambda Calculus with Explicit Recursion

  1997cited by this paper
• Compiling Laziness Using Projections

  1996cited by this paper
• Implementation of Functional Languages

  1996cited by this paper
• State in Haskell

  1995cited by this paper
• Compilation by transformation in non-strict functional languages

  1995cited by this paper
• Properties of a First-Order Functional Language with Sharing

  1995cited by this paper
• Abstract Reduction Using a Tableau Calculus

  1995cited by this paper
• Infinitary Lambda Calculi and Böhm Models

  1995cited by this paper
• A Tutorial on Co-induction and Functional Programming

  1994cited by this paper
• A co-Induction Principle for Recursively Defined Domains

  1994cited by this paper
• Compilation by Transformation in the Glasgow Haskell Compiler

  1994cited by this paper
• Strictness analysis using abstract reduction

  1993cited by this paper
• Term graph rewriting: theory and practice

  1993cited by this paper
• Abstract reduction: towards a theory via abstract interpretation

  1993cited by this paper
• Imperative functional programming

  1993cited by this paper
• The Revised Report on the Syntactic Theories of Sequential Control and State

  1992cited by this paper
• Concurrent Clean

  1991influential reference
• Lazy functional languages - abstract interpretation and compilation

  1991cited by this paper
• Strictness analysis: a new perspective based on type inference

  1989cited by this paper
• The | lambda-Calculus.

  1988cited by this paper
• Projections for strictness analysis

  1987cited by this paper
• The Lambda Calculus: Its Syntax and Semantics

  1985cited by this paper
• Functional Programming Languages and Computer Architecture

  1985cited by this paper
• Strictness analysis on non-fiat domains (by abstract interpretation over finite domains)

  1985cited by this paper
• The theory of strictness analysis for higher order functions

  1985cited by this paper
• Abstract interpretation and optimising transformations for applicative programs

  1982cited by this paper
• Principles of programming languages

  1981cited by this paper
• Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

  1977cited by this paper
• An Algebraic Interpretation of the lambda beta K-Calculus; and an Application of a Labelled lambda -Calculus

  1976cited by this paper
• Call-by-Name, Call-by-Value and the lambda-Calculus

  1975cited by this paper

• A Probabilistic Call-by-Need Lambda-Calculus - Extended Version

  2022cites this paper
• Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus

  2022influential citation
• Nominal Unification and Matching of Higher Order Expressions with Recursive Let

  2021cites this paper
• Nominal Unification with Letrec and Environment-Variables

  2020cites this paper
• Nominal unification with atom-variables

  2019influential citation
• Nominal Unification with Atom and Context Variables

  2018cites this paper
• Space Improvements and Equivalences in a Functional Core Language

  2018cites this paper
• Automating the Diagram Method to Prove Correctness of Program Transformations

  2018cites this paper
• Sequential and Parallel Improvements in a Concurrent Functional Programming Language

  2018cites this paper
• An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages

  2017cites this paper
• Fachbereich Informatik und Mathematik Rewriting of Higher-Order-Meta-Expressions with Recursive Bindings

  2017cites this paper
• Alpha-renaming of higher-order meta-expressions

  2017influential citation
• Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations

  2017cites this paper
• Improvements for Concurrent Haskell with Futures ?

  2017cites this paper
• Matching of Meta-Expressions with Recursive Bindings

  2017cites this paper
• Space Improvements and Equivalences in a Polymorphically Typed Functional Core Language : Context Lemmas and Proofs

  2017cites this paper
• Unification of program expressions with recursive bindings

  2016cites this paper
• A Call-by-Need Lambda Calculus with Scoped Work Decorations

  2016cites this paper
• Nominal Unification of Higher Order Expressions with Recursive Let

  2016influential citation
• Improvements in a functional core language with call-by-need operational semantics

  2015cites this paper
• Sharing-aware improvements in a call-by-need functional core language

  2015cites this paper
• Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq

  2015influential citation
• Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)

  2014cites this paper
• Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk)

  2014cites this paper
• Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings

  2013cites this paper
• Free theorems in languages with real-world programming features

  2013cites this paper
• 24th International Conference on Rewriting Techniques and Applications, RTA 2013, Eindhoven, The Netherlands, June 24-26, 2013

  2013cites this paper
• Algorithms for Extended Alpha-Equivalence and Complexity

  2013cites this paper
• Conservative Concurrency in Haskell

  2012cites this paper
• Encoding induction in correctness proofs of program transformations as a termination problem

  2012cites this paper
• Correctness of Program Transformations as a Termination Problem

  2012influential citation
• Computing Overlappings by Unification in the Deterministic Lambda Calculus LR with letrec , case , constructors , seq and variable chains

  2011cites this paper
• Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec

  2011cites this paper
• On conservativity of concurrent Haskell

  2011cites this paper
• Making “stricterness” more relevant

  2010cites this paper
• On generic context lemmas for higher-order calculi with sharing

  2010cites this paper
• Towards Correctness of Program Transformations Through Unification and Critical Pair Computation

  2010influential citation
• Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi

  2010cites this paper
• Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi

  2009cites this paper
• Counterexamples to Simulation in Non-Deterministic Call-by-Need Lambda-Calculi with letrec

  2009cites this paper
• Semantics of a call-by-need lambda calculus with McCarthy's amb for programm equivalence

  2008influential citation
• A Finite Simulation Method in a Non-Deterministic Call-by-Need Calculus with letrec , constructors and case

  2008cites this paper
• A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case

  2008cites this paper
• A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations

  2008influential citation
• Correctness of copy in calculi with letrec, case, constructors and por

  2007cites this paper
• Program Transformation for Functional Circuit Descriptions

  2007cites this paper
• Deciding inclusion of set constants over infinite non-strict data structures

  2007influential citation
• On equivalences and standardization in a non-deterministic call-by-need lambda calculus

  2007cites this paper
• Correctness of Copy in Calculi with Letrec , Case and Constructors

  2007cites this paper
• On generic context lemmas for lambda calculi with sharing

  2007cites this paper
• A Call-by-Need Lambda-Calculus with Locally Bottom-Avoiding Choice : Context Lemma and Correctness of Transformations

  2006cites this paper
• How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi

  2006cites this paper
• Equivalence of call-by-name and call-by-need for lambda-calculi with letrec

  2006cites this paper
• Deciding subset relationship of co-inductively defined set constants

  2005cites this paper
• Semantics of Program Analyses and Transformations Lecture Notes for the Summer School on Program Analysis and Transformation Copenhagen, Denmark 6-10 June 2005

  2005cites this paper