Using transformations in the implementation of higher-order functions

DOI10.1017/S0956796800000204zbMath0941.68543OpenAlexW2098317240MaRDI QIDQ4939691

Flemming Nielson, Hanne Riis Nielson

Publication date: 9 February 2000

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

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

zbMATH Keywords

program transformationsfunctional languagecategorical combinatorsspecifications of abstract interpretations

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Functional completeness of the mixed \(\lambda\)-calculus and combinatory logic
• Two-level semantics and abstract interpretation
• Strictness analysis for higher-order functions
• Two-level semantics and code generation
• The categorical abstract machine
• Linearisation: An optimisation for nonlinear functional programs
• Automatic binding time analysis for a typed \(\lambda\)-calculus
• Mixed computation: potential applications and problems for study
• Rewriting systems on FP expressions to reduce the number of sequences yielded
• Program transformations in a denotational setting
• A System for Assisting Program Transformation
• A Transformation System for Developing Recursive Programs
• Can programming be liberated from the von Neumann style?
• A new implementation technique for applicative languages