Pattern matching in order-sorted languages

DOI10.1007/3-540-54345-7_70MaRDI QIDQ4035249zbMATH OpenFDO

Authors Delia Kesner

Publication date 18 May 1993

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

Full work available at URL https://doi.org/10.1007/3-540-54345-7_70

zbMATH Keywords

hierarchical type systemlazy evaluationordered-sorted patternspattern matching trees

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• Order-preserving pattern matching indeterminate strings
• Order-preserving pattern matching indeterminate strings
• The order-preserving pattern matching problem in practice
• Fast order-preserving pattern matching
• Order-preserving pattern matching with scaling
• Efficient algorithms for the order preserving pattern matching problem
• Order-preserving pattern matching with \(k\) mismatches
• Order-preserving pattern matching with \(k\) mismatches
• Regular expression order-sorted unification and matching

Cited in

(5)

• Compilation of pattern matching with associative-commutative functions
• scientific article; zbMATH DE number 4037164 (Why is no real title available?)
• Optimal solutions to pattern matching problems
• Order-Sorted Unification with Regular Expression Sorts.
• Code selection by inversion of order-sorted derivors

This page was built for publication: Pattern matching in order-sorted languages

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