16 citations · 44 across the 9 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.PL2017★ 4 cited
MatchPy: A Pattern Matching Library
Manuel Krebber, Henrik Barthels, Paolo Bientinesi
Pattern matching is a powerful tool for symbolic computations, based on the well-defined theory of term rewriting systems. Application domains include algebraic expressions, abstra…
cs.PL2017
Efficient Pattern Matching in Python
Manuel Krebber, Henrik Barthels, Paolo Bientinesi
Pattern matching is a powerful tool for symbolic computations. Applications include term rewriting systems, as well as the manipulation of symbolic expressions, abstract syntax tre…
math.NA2017
Systematic Generation of Algorithms for Iterative Methods
Henrik Barthels
The FLAME methodology makes it possible to derive provably correct algorithms from a formal description of a linear algebra problem. So far, the methodology has been successfully u…