> Detailanzeige

Mitchell, Neil; Runciman, Colin

Not all patterns, but enough : an automatic verifier for partial but sufficient pattern matching

Literatur-
verwaltung

Zur
Merkliste

Lösche von
Merkliste

Per Whatsapp teilen

Schließen

Merkliste



Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
  • Medientyp: E-Artikel
  • Titel: Not all patterns, but enough : an automatic verifier for partial but sufficient pattern matching : an automatic verifier for partial but sufficient pattern matching
  • Beteiligte: Mitchell, Neil; Runciman, Colin
  • Erschienen: Association for Computing Machinery (ACM), 2009
  • Erschienen in: ACM SIGPLAN Notices, 44 (2009) 2, Seite 49-60
  • Sprache: Englisch
  • DOI: 10.1145/1543134.1411293
  • ISSN: 0362-1340; 1558-1160
  • Schlagwörter: Computer Graphics and Computer-Aided Design ; Software
  • Entstehung:
  • Anmerkungen:
  • Beschreibung: We describe an automated analysis of Haskell 98 programs to check statically that, despite the possible use of partial (or non-exhaustive) pattern matching, no pattern-match failure can occur. Our method is an iterative backward analysis using a novel form of pattern-constraint to represent sets of data values. The analysis is defined for a core first-order language to which Haskell 98 programs are reduced. Our analysis tool has been successfully applied to a range of programs, and our techniques seem to scale well. Throughout the paper, methods are represented much as we have implemented them in practice, again in Haskell.