Tom 2.4 Released

Tom 2.4 was released today, and contains many improvements. In particular, it is possible to generate with the Gom tool unmutable typed tree data structures with invariants, such as ordered lists, duplicate removal or even distributivity of balanced trees.
Also the new reflexive strategies allow self modifying and dynamic strategies in Java, and the easy use of strategic programming in a Java environment. This allows for instance the easy development of a Just in Time compiler for those strategies, using bytecode rewriting.

Quoting the announce:

Tom 2.4 announcement

It is our great privilege and pleasure to announce the availability of
Tom version 2.4.

This release continues our work on the integration of pattern matching
and rule based programming facilities into C and Java.

Tom is a pattern matching compiler developed at INRIA. It is
particularly well-suited for programming various transformations on
trees/terms and XML based documents. Its design follows our research on
the efficient compilation of rule based languages (e.g. ELAN, developed
at INRIA-Loria).

Many applications have been developed in Tom. Among them, let us mention:
- the Tom compiler itself
- languages semantics, interpreters and program transformation tools
- a Just In Time strategy compiler using dynamic Java bytecode
- a generator of canonical abstract syntax trees (Gom)
- a proof assistant for supernatural deduction
- a compiler algorithm for anti-pattern matching and disunification

Tom is a complex compiler which adds powerful constructs to C and Java:
non linear syntactic matching, associative matching with neutral element
(a.k.a. list-matching), XML based pattern matching, string matching, and
equational rewriting.
This offers the possibility to analyze and transform any kind of
data-structure. Tom can be used for large scale developments and
applications. It comes with documentation, programming, and debugging

This new release contains many improvements and new features:
- Anti-Patterns:
Tom now supports not only pattern matching, but also anti-pattern
matching. For example, the pattern (_*,!a(),_*) denotes a list
which contains at least one element different from a(). In a similar
way, !(_*,a(),_*) denotes a list which does not contain any a().

- Reflexive Strategies:
A strategy is now a term that can be matched like any other term.
This allows to dynamically build or transform a strategy at runtime.

- Congruence Strategies:
Gom generates new elementary congruence and constructions
strategies. This allows for instance to define the Map operation in
a easy way: map(s) = _conc(s)

- Java Bytecode:
A support for Java bytecode analysis and transformation is available
in the runtime library. This allows class loading, bytecode analysis
and transformation in an algebraic framework.
Using the strategy language, the control flow graph can be explored
and visualized using dot.

- Eclipse Plugin:
It is back for Eclipse version 3.2.
It also supports Gom and all new functionalities.

Tom is available, in open source (GPL/BSD License), from the web page:

Best regards,
Tom development team

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

programming by strategies

It seems to me that strategic programming is very close to proof languages tactics. Both are about tree walking and strategies are strategies combinators, while tatctics are tactics combinators.

strategies and tactics

Yes, strategies and tactics are similar objets, as they describe how to apply rules in a tree. Classical tactics languages for proof assistants are however more coarse grained than the basic combinators of strategies. For instance, it is usual in tactics languages that rules are implicitly applied under a TopDown strategy to a given sub-tree. Also, tactics languages do provide some interactive control (next, undo) that are not part of the strategy framework. however, such interactive features are quite easy to add in the Tom framework, as actions associated with a "catch all" rule, since actions can be arbitrary code.