MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Views: A way for pattern matching to cohabit with data abstraction (1986) [104 citations — 0 self]

by Philip Wadler
Add To MetaCart

Abstract:

Pattern matching and dta abstraction are important concepts in designing programs, but they do not it well together. Pattern matching depend on making public a free data type mpresentaiion, while data abstraction depends on hiding the repreentaiion. This paper proposes the vdws mechanism at a means of reconc'dlng this conflict. A view allows any type to be viewed at a free data type, thus combining the clarity of pattern matching with the eiclency of data abstraction.

Citations

503 A transformation system for developing recursive programs – Burstall, Darlington - 1977
195 An introduction to the theory of lists – Bird - 1987
156 A non-strict functional language with polymorphic types – Miranda
144 Lambda Lifting: Transforming Programs to Recursive Equations – Johnsson - 1985
90 Principles of OBJ2 – Futatsugi, Goguen, et al. - 1985
89 Algorithmics -- towards programming as a mathematical activity – Meertens - 1987
80 A compiler for lazy ML – AUGUSTSSON - 1984
76 Proving properties of programs by structural induction – Burstall - 1969
66 Compiling pattern matching – Augustsson - 1985
50 an experimental applicative language – Hope - 1980
38 An experimental applicative language – BURSTALL, MACQUEEN, et al. - 1980
32 Recursion Equations as a Programming Language – Turner - 1982
16 A Logic for Miranda – Thompson - 1989
9 Code Generation Techniques for Functional Languages – Fairbairn, Wray - 1986
6 A short note concerning lazy reduction rules of append – Sleep, Holmström - 1982
4 A combinator-based compiler for a functional language – Hudak, Kranz - 1984
3 Implementing Functional Languages using Graph Reduction – Peyton-Jones - 1987
1 Compiling pattern matching; List comprehensions – Wadler
1 A compiler for lasy ML. fu Proceedinga of the 1984 A CM Symposium on Lidp and Functional Progrumming, pager 218-227, Aurtiu – Augustaeon - 1984
1 A transformation system for developing recursive programs – Bumtall, Darliugton - 1977
1 Proving prope&em of pr~gr- by strutturai induction – Bumtall - 1989
1 Algorithmice: Towards programming as a mathematical activity – Meertena - 1984
1 A short note concerning lasy reduction rulea of append. Software Practict and Ezptricncc – Sleep - 1982
1 Compiling pattern matching; List comPrehensions – P