Algebraic Transformation Techniques for Functional Languages

DOI10.1093/COMJNL/31.3.229MaRDI QIDQ4711452zbMATH OpenOpenAlexFDO

Authors Peter G. Harrison, Hessam Khoshnevisan

Publication date 25 June 1992

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/31.3.229

zbMATH Keywords

HopeKRClambda calculusmemoisationMirandarecursion removaltransformation of functional languages

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Efficient memo-table management strategies
• scientific article; zbMATH DE number 3898204
• Optimizing structural recursion in functional programs
• scientific article; zbMATH DE number 1808202
• scientific article; zbMATH DE number 47723

Cited in

(7)

• A general implementation of relational recursion with speedup techniques for programmers
• Memoizing purely functional top-down backtracking language processors
• scientific article; zbMATH DE number 3898204 (Why is no real title available?)
• Applicative caching
• The Mechanical Transformation of Data Types
• Algebraic high-level net transformation systems
• Efficient memo-table management strategies

This page was built for publication: Algebraic Transformation Techniques for Functional Languages

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