Using transformations in the implementation of higher-order functions

DOI10.1017/S0956796800000204MaRDI QIDQ4939691zbMATH OpenOpenAlexFDO

Authors Hanne Riis Nielson, Flemming 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

categorical combinatorsfunctional languageprogram transformationsspecifications of abstract interpretations

Mathematics Subject Classification ID

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

Cites work

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

This page was built for publication: Using transformations in the implementation of higher-order functions

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