Matchete: Paths through the Pattern Matching Jungle

Hirzel, Martin; Nystrom, Nathaniel; Bloom, Bard; Vítek, Jan

doi:10.1007/978-3-540-77442-6_11

Cited by 12 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Matchete [10] extends Java with pattern matching operators similar to extractors, but matches on regular expressions and other specialized expressions. It does not support exhaustiveness analysis.…”

Section: Related Workmentioning

confidence: 99%

Reconciling exhaustive pattern matching with objects

Isradisaikul

Myers

2013

SIGPLAN Not.

View full text Add to dashboard Cite

Pattern matching, an important feature of functional languages, is in conflict with data abstraction and extensibility, which are central to object-oriented languages. Modal abstraction offers an integration of deep pattern matching and convenient iteration abstractions into an object-oriented setting; however, because of data abstraction, it is challenging for a compiler to statically verify properties such as exhaustiveness. In this work, we extend modal abstraction in the JMatch language to support static, modular reasoning about exhaustiveness and redundancy. New matching specifications allow these properties to be checked using an SMT solver. We also introduce expressive pattern-matching constructs. Our evaluation shows that these new features enable more concise code and that the performance of checking exhaustiveness and redundancy is acceptable.

show abstract

Section: Related Workmentioning

confidence: 99%

Reconciling exhaustive pattern matching with objects

Isradisaikul

Myers

2013

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

“…Machete (a forerunner to Thorn) is the most conventional: introducing a match statement, a rich library of patterns, and a separate type of "deconstructor" declaration to objects that extract values when objects are matched [9]. Again presaging Thorn, Machete includes special patterns (and syntax) for matching with regular expressions, arrays, bitpatterns, and XML.…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…The above method is named between()and(), and we could request it on the object 7 by writing 7.between(5) and (9) Single arguments that are literals do not require parentheses, so alternatively we could write…”

Section: An Overview Of Gracementioning

confidence: 99%

“…Even Smalltalk programmers sometimes find it necessary to ask an object if it understands a particular message. The obvious approach is to extend the core language with one or more special-purpose constructs to support pattern-matching, as in F#'s active patterns, or Scala or Machete's "whole cloth" approach [4,9,22]. Although some language support seems unavoidable, we would like to minimize it: we want to create a small, simple, object-oriented language, not a large hybrid multi-paradigm language.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Patterns as objects in grace

Homer

Noble

Bruce

et al. 2012

Proceedings of the 8th Symposium on Dynamic Languages

View full text Add to dashboard Cite

Object orientation and pattern matching are often seen as conflicting approaches to program design. Object oriented programs place type-dependent behaviour inside objects and invoke it via dynamic dispatch, while pattern matching programs place type-dependent behaviour outside data structures and invoke it via multiway conditionals (case statements). Grace is a new, dynamic, object-oriented language designed to support teaching: to this end, Grace needs to support both styles. In this paper we explain how this conflict can be resolved gracefully: by modelling patterns and cases as partial functions, reifying those functions as first-class objects, and then building up complex patterns from simpler ones using pattern combinators. We describe our design for pattern matching in Grace, and its implementation as an object-oriented framework.

show abstract

“…Nevertheless, recent work [14,26] introduced pattern matching in programming languages supporting the main current object oriented features as F# [1] and Scala [23]. In addition, some extensions of Java supporting pattern matching appeared in the last few years [16,24]. Pattern matching checks if an expression respects a given pattern looking at an ordered list of case expressions.…”

Section: Introductionmentioning

confidence: 99%

Static Type Analysis of Pattern Matching by Abstract Interpretation

Ferrara

2010

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract. Pattern matching is one of the most attractive features of functional programming languages. Recently, pattern matching has been applied to programming languages supporting the main current object oriented features. In this paper, we present a static type analysis based on the abstract interpretation framework aimed at proving the exhaustiveness of pattern matchings and the safety of type casts. The analysis is composed by two distinct abstract domains. The first domain collects information about dynamic typing, while the second one tracks the types that an object cannot be instance of. The analysis has been implemented and applied to all the Scala library. The experimental results underline that our approach scales up since it analyzes a method in 90 msec in average. In addition, the analysis is precise in practice as well, since we prove the exhaustiveness of 42% of pattern matchings and 27% of the type casts without any manual annotation on the code.

show abstract

Matchete: Paths through the Pattern Matching Jungle

Cited by 12 publications

References 18 publications

Reconciling exhaustive pattern matching with objects

Reconciling exhaustive pattern matching with objects

Patterns as objects in grace

Static Type Analysis of Pattern Matching by Abstract Interpretation

Contact Info

Product

Resources

About