Polymorphic regular tree types and patterns

DOI10.1145/1111037.1111047zbMATH Open1370.68057OpenAlexW2167269881MaRDI QIDQ5348917FDOQ5348917

Authors: Jérôme Vouillon 

Publication date: 21 August 2017

Published in: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1111037.1111047

Recommendations

• Regular expression pattern matching for XML
• Typed path polymorphism
• Regular expression pattern matching for XML
• Subtyping algorithm of regular tree grammars with disjoint production rules
• Type soundness for path polymorphism

zbMATH Keywords

tree automatapolymorphismsubtyping

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Abstract data types; algebraic specification (68Q65)

Cited In (4)

• Canonical regular types
• Types for Proofs and Programs
• A solution to the PoplMark challenge based on de Bruijn indices
• A type-theoretic reconstruction of the visitor pattern

This page was built for publication: Polymorphic regular tree types and patterns

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