See this document in CiteSeerX!

Statically Checkable Pattern Abstractions (1997)  (Make Corrections)  (2 citations)
Manuel Fähndrich, John Boyland
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming



  Home/Search   Context   Related

 
View or download:
berkeley.edu/~manuel/pap...icfp97.ps.gz
microsoft.com/~maf/icfp97.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/~manu...publications (more)
From:  microsoft.com/~maf...publications
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Pattern abstractions increase the expressiveness of pattern matching, enabling the programmer to describe a broader class of regular forests with patterns. Furthermore, pattern abstractions support code reuse and code factoring, features that facilitate maintenance and evolution of code. Past research on pattern abstractions has generally ignored the aspect of compile-time checks for exhaustiveness and redundancy. In this paper we propose a class of expressive patterns that admits these... (Update)

Context of citations to this paper:   More

...of patterns even when dealing with abstract data types. Other work has been aimed at the expressiveness of patterns: Fahndrich and Boyland [FB97] propose a means to add pattern abstractions. My approach is far simpler, although I do not attempt as they do to make patterns...

...patterns can be represented by contexts, but the current SL system does not optimize matching for eciency. Fahndrich and Boyland [FB97] investigate abstract patterns which are even more general than contexts in the SL system. They build automata for patterns and check...

Cited by:   More
From Syntactic Theories to Interpreters: A Specification.. - Xiao, Ariola, Mauny (2000)   (Correct)
First Class Patterns - Tullsen (2000)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Language and Document Support in Software Development Environments - Graham (1992)   (Correct)
0.3:   Views for Standard ML - Okasaki (1998)   (Correct)
0.3:   Pattern Guards and Transformational Patterns - Erwig, Jones (2000)   (Correct)

Similar documents based on text:   More   All
0.1:   Effect Systems - Fähndrich   (Correct)
0.1:   Conditional Evaluation in Simple Multi-Visit Attribute-Grammar.. - Yang (1997)   (Correct)
0.1:   (2000) 341-344 [59] A Compton scattering study of.. - Gammaffi And..   (Correct)

BibTeX entry:   (Update)

Manuel Fhndrich and John Boyland. Statically checkable pattern abstractions. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 7584, Amsterdam, The Netherlands, 9 11 June 1997. http://citeseer.ist.psu.edu/fhndrich97statically.html   More

@inproceedengs{ fahndrich97statically,
  author = "M. Fhndrich and J. Boyland",
  title = "Statically checkable pattern abstractions",
  booktitle = "Proceedings of the 1997 ACM SIGPLAN International Conference on Functional
    Programming", 
  pages = "75--84", 
  address = "Amsterdam, The Netherlands",
  month = "June",
  year = "1997",
  url = "citeseer.ist.psu.edu/fhndrich97statically.html" }
Citations (may not include all citations):
1074   The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
113   Akad'emiai Kiad'o (context) - G'ecseg, Steinby - 1984
56   Pattern matching in trees (context) - Hoffmann, O'Donnell - 1982
16   Abstract value constructors (context) - Aitken, Reppy - 1992
16   Pattern matching with abstract data types (context) - Burton, Cameron - 1993
11   A functional language for the specification of complex tree .. (context) - Heckmann - 1988
8   A new look at pattern matching in abstract data types (context) - Gostanza, na et al. - 1996
8   Active patterns - Erwig - 1996
5   ML pattern match compilation and partial evaluation - Sestoft - 1996
3   Partial evaluation applied to symbolic pattern matching with.. - Queinnec, Geffroy - 1992
3   Pattern-based languages for prototyping compiler optimizers - Farnum - 1990
3   Descriptional Composition of Compiler Components (context) - Boyland - 1996
2   Attributed transformational code generation for dynamic comp.. (context) - Boyland, Farnum et al. - 1992

Documents on the same site (http://www.cs.berkeley.edu/~manuel/publications.html):   More
Refined Type Inference for ML - Fähndrich, Aiken   (Correct)
Better Static Memory Management: Improving Region-Based.. - Aiken, al. (1995)   (Correct)
Program Analysis Using Mixed Term and Set Constraints - Fähndrich, Aiken (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC