Gradual Refinement: Blending Pattern Matching with Data Abstraction
Pattern matching is advantageous for understanding and reasoning about function definitions, but it tends to tightly couple the interface and implementation of a datatype. Significant effort has been invested in tackling this loss of modularity; however, decoupling patterns from concrete representat...
Main Authors: | Wang, M, Gibbons, J, Matsuda, K, Hu, Z |
---|---|
Other Authors: | Desharnais, J |
Format: | Conference item |
Published: |
2010
|
Similar Items
-
Gradual Refinement Blending Pattern Matching with Data Abstraction
by: Wang, M, et al.
Published: (2010) -
Refactoring pattern matching
by: Wang, M, et al.
Published: (2013) -
Refactoring Pattern Matching
by: Wang, M, et al.
Published: (2012) -
Refined Probabilistic Abstraction
by: Wachter, B
Published: (2010) -
Abstraction and refinement in protocol derivation
by: Datta, A, et al.
Published: (2004)