Refined compilation of pattern-matching for functional languages

DOI10.1016/0167-6423(88)90002-0MaRDI QIDQ1123586zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1988

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(88)90002-0

zbMATH Keywords

term rewritingfunctional languagespattern-matching compilation

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of software (68N99) Abstract data types; algebraic specification (68Q65) Algorithms in computer science (68W99)

Recommendations

• Recursive Functions with Pattern Matching in Interaction Nets
• scientific article; zbMATH DE number 1638660
• Pattern matching compilation of functions defined in context-free languages
• scientific article; zbMATH DE number 4037164
• A formal development of an efficient supercombination compiler

Cited in

(7)

• Adaptive pattern matching
• scientific article; zbMATH DE number 1533832 (Why is no real title available?)
• Theory and practice of unparsed patterns for metacompilation
• Left-to-right tree pattern matching
• Pattern matching compilation of functions defined in context-free languages
• An account of implementing applicative term rewriting
• Pattern-based calculi with finitary matching

This page was built for publication: Refined compilation of pattern-matching for functional languages

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