Combining pattern E-unification algorithms

DOI10.1007/3-540-45127-7_7MaRDI QIDQ2778871zbMATH OpenFDO

Authors Alexandre Boudet, Evelyne Contejean

Publication date 21 March 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2051/20510063

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 4112560
• Combining unification algorithms
• scientific article; zbMATH DE number 3960989
• Unification with extended patterns
• Prototyping combination of unification algorithms with the \(\mathsf{ELAN}\) rule-based programming language
• scientific article; zbMATH DE number 4049130
• On learning unions of pattern languages and tree patterns
• Optimizing higher-order pattern unification.
• Program composition via unification

Cited in

(8)

• Unification with extended patterns
• ESS patterns: Adding pairs to an ESS
• Theory and practice of unparsed patterns for metacompilation
• Unification and combination of a class of traversal strategies made with pattern matching and fixed-points
• scientific article; zbMATH DE number 1447313 (Why is no real title available?)
• Modular higher-order E-unification
• Modular AC unification of higher-order patterns
• Logic Programming

This page was built for publication: Combining pattern \(E\)-unification algorithms

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