MoTion: A new declarative object matching approach in Pharo

Hosry, Aless; Aranega, Vincent; Anquetil, Nicolas

Type de document :

Article dans une revue scientifique: Article original

DOI :

10.1016/j.cola.2024.101290

URL permanente :

http://hdl.handle.net/20.500.12210/117647

Titre :

MoTion: A new declarative object matching approach in Pharo

Auteur(s) :

Hosry, Aless [Auteur]
Reflective Evolution of Ever-running Software Systems [EVREF]
Aranega, Vincent [Auteur]

Anquetil, Nicolas [Auteur]

Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]

Titre de la revue :

Journal of Computer Languages

Pagination :

101290

Éditeur :

Elsevier

Date de publication :

2024-09-04

ISSN :

2590-1184

Mot(s)-clé(s) en anglais :

Pattern matching
Object Oriented
Smalltalk

Discipline(s) HAL :

Informatique [cs]/Langage de programmation [cs.PL]

Résumé en anglais : [en]

<div><p>Pattern matching is an expressive way of matching data and extracting pieces of information from it. The recent inclusion of pattern matching in the Java and Python languages highlights that such a facility is more ...
Lire la suite ><div><p>Pattern matching is an expressive way of matching data and extracting pieces of information from it. The recent inclusion of pattern matching in the Java and Python languages highlights that such a facility is more and more adopted by developers for everyday development. Other main stream programming languages also offer pattern matching capabilities as part of the language (Rust, Scala, Haskell, and OCaml), with different degrees of expressivity in what can be matched. In the meantime, in graphs, pattern matching takes a slightly different turn; it enhances the expressivity of the patterns that can be defined. Smalltalk currently offers little pattern matching capability to find specific objects inside a large graph of objects using a declarative pattern. In Pharo, the closest library to classical pattern matching that exists is the RBParseTreeSearcher, which allows to express specialized patterns over a Pharo Abstract Syntax Tree to find some inner node. The question arises of what features a flexible pattern matching language should have. In this paper, we review the features found in different existing pattern matching languages, both in General Purpose Languages (like Java) and in declarative graph pattern matching languages. We then describe MoTion, a new pattern matching engine for Pharo smalltalk, combining all these features. We discuss some aspects of MoTion's implementation and illustrate its use with real case examples.</p></div>Lire moins >

Langue :

Anglais

Comité de lecture :

Oui

Audience :

Internationale

Vulgarisation :

Non

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Date de dépôt :

2024-10-08T02:32:53Z

Fichiers

document
Accès libre
Accéder au document

main.pdf
Accès libre
Accéder au document

MoTion: A new declarative object matching ... BibTeX CSV Excel RIS

Fichiers

MoTion: A new declarative object matching ...

BibTeX

CSV

Excel

RIS