Gradual refinement. Blending pattern matching with data abstraction
DOI10.1007/978-3-642-13321-3_22zbMATH Open1286.68330OpenAlexW2132297537MaRDI QIDQ3575282FDOQ3575282
Authors: Meng Wang, Jeremy Gibbons, Kazutaka Matsuda, Zhenjiang Hu
Publication date: 26 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13321-3_22
Recommendations
- A new look at pattern matching in abstract data types
- Pattern matching with abstract data types
- Statically checkable pattern abstractions
- Extensible pattern matching via a lightweight language extension
- Automatic refunctionalization to a language with copattern matching: with applications to the expression problem
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65)
Cited In (3)
This page was built for publication: Gradual refinement. Blending pattern matching with data abstraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575282)