Code selection by inversion of order-sorted derivors

DOI10.1016/0304-3975(90)90145-8zbMath0701.68018OpenAlexW2024379355MaRDI QIDQ914361

Robert Giegerich

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90145-8

zbMATH Keywords

pattern matchingtree languagesalgebraic model of code generationderivor inversionorder-sorted term algebras

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items

Tree automata for code selection, Algebraic dynamic programming on trees, Pattern-matching algorithms based on term rewrite systems

Uses Software

• NARROWER

Cites Work

• Pattern Matching in Trees
• Semantics of computation
• Optimal Code Generation for Expression Trees
• Initial Algebra Semantics and Continuous Algebras
• Tree generating regular systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item