Benchmarking Implementations of Term Rewriting and Pattern Matching in Algebraic, Functional, and Object-Oriented Languages - The 4th Rewrite Engines Competition

Hubert Garavel 1 Mohammad-Ali Tabikh 1 Imad-Seddik Arrada 1
1 CONVECS - Construction of verified concurrent systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Many specification and programming languages have adopted term rewriting and pattern matching as a key feature. However, implementation techniques and observed performance greatly vary across languages and tools. To provide for an objective comparison, we developed an open, experimental platform based upon the ideas of the three Rewrite Engines Competitions (2006, 2008, and 2010), which we significantly enhanced, extended, and automated. We used this platform to benchmark interpreters and compilers for a number of algebraic, functional, and object-oriented languages, and we report about the results obtained for CafeOBJ, Clean, Haskell, LNT, LOTOS, Maude, mCRL2, OCaml, Opal, Rascal, Scala, SML (MLton and SML-NJ), Stratego/XT, and Tom.
Document type :
Conference papers
Proceedings of the 12th International Workshop on Rewriting Logic and its Applications (WRLA'18), 2018, Thessaloniki, Greece
Liste complète des métadonnées

https://hal.inria.fr/hal-01883212
Contributor : Hubert Garavel <>
Submitted on : Thursday, September 27, 2018 - 7:04:19 PM
Last modification on : Thursday, October 11, 2018 - 8:48:04 AM

File

Garavel-Tabikh-Arrada-18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01883212, version 1

Collections

Citation

Hubert Garavel, Mohammad-Ali Tabikh, Imad-Seddik Arrada. Benchmarking Implementations of Term Rewriting and Pattern Matching in Algebraic, Functional, and Object-Oriented Languages - The 4th Rewrite Engines Competition. Proceedings of the 12th International Workshop on Rewriting Logic and its Applications (WRLA'18), 2018, Thessaloniki, Greece. 〈hal-01883212〉

Share

Metrics

Record views

63

Files downloads

11