Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

POPL
2009
ACM

favoriteEmaildiscussreport

153views Programming Languages» more POPL 2009»

Focusing on pattern matching

14 years 5 months ago

Focusing on pattern matching

Download www.cs.cmu.edu

In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows us to give a novel coverage checking algorithm, and makes it possible to give a rigorous correctness proof for the classical pattern compilation strategy of building decision trees via matrices of patterns. Categories and Subject Descriptors F.4.1 [Mathematical Logic]: Lambda Calculus and Related Systems Keywords Focusing, Pattern Matching, Type Theory, CurryHoward

Neelakantan R. Krishnaswami

Real-time Traffic

Pattern Compilation Strategy | Pattern Matching | POPL 2009 | Programming Languages | Rigorous Correctness Proof |

claim paper

Related Content

» Automatic Issue Extraction from a Focused Dialogue

» Pattern Matching in Text Compressed by Using Antidictionaries

» Towards a Standard Family of Languages for Matching Patterns in Source Code

» Efficient Exact PatternMatching in Proteomic Sequences

» Adaptive MultiPattern Fast BlockMatching Algorithm Based on Motion Classification Techniqu...

» Formal validation of pattern matching code

» SiteQ Engineering High Performance QA System Using LexicoSemantic Pattern Matching and Sha...

» Fast besteffort pattern matching in large attributed graphs

» Creating Converged Trace Schedules Using String Matching

Post Info
More Details (n/a)

Added	22 Nov 2009
Updated	22 Nov 2009
Type	Conference
Year	2009
Where	POPL
Authors	Neelakantan R. Krishnaswami

Comments (0)