Compilation of pattern matching with associative-commutative functions

DOI10.1007/3-540-53982-4_4MaRDI QIDQ2736358zbMATH OpenFDO

Authors Emmanuel Kounalis, D. Lugiez

Publication date 29 August 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53982-4_4

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• scientific article; zbMATH DE number 4037164
• Pattern matching in order-sorted languages
• PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES
• Recursive Functions with Pattern Matching in Interaction Nets
• Single elementary associative-commutative matching

Cited in

(10)

• Refined compilation of pattern-matching for functional languages
• ELAN from a rewriting logic point of view
• Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
• Higher-order associative commutative pattern matching for component retrieval
• Associative-commutative discrimination nets
• More problems in rewriting
• A compiler for nondeterministic term rewriting systems
• Compiling regular patterns
• Pattern matching compilation of functions defined in context-free languages
• Principles of plasma pattern and alternative structure compilation

This page was built for publication: Compilation of pattern matching with associative-commutative functions

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