Polymorphic regular tree types and patterns

DOI10.1145/1111037.1111047zbMath1370.68057OpenAlexW2167269881MaRDI QIDQ5348917

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

zbMATH Keywords

polymorphismtree automatasubtyping

Mathematics Subject Classification ID

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

Related Items (1)

A solution to the PoplMark challenge based on de Bruijn indices

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