Statically checkable pattern abstractions

DOI10.1145/258948.258957MaRDI QIDQ5348867zbMATH OpenOpenAlexFDO

Authors Manuel Fähndrich, John Tang Boyland

Publication date 21 August 2017

Published in Proceedings of the second ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• A new look at pattern matching in abstract data types
• Extensible pattern matching via a lightweight language extension
• Pattern matching with abstract data types
• Compiling regular patterns
• scientific article; zbMATH DE number 1954106

Cited in

(1)

• Gradual refinement. Blending pattern matching with data abstraction

This page was built for publication: Statically checkable pattern abstractions

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