Outermost
This page is to record the current status of the proposed Outermost Strategy Category of the Termination Competition.
The first installation of this event is planned for November 4, 2008.
Overview of the Event
It is a challenging topic to automatically prove termination of term rewriting with respect to outermost rewriting strategy. This strategy is especially interesting since it establishes the basis of lazy programming languages as Haskell, Miranda or Clean where programming with infinite structures is common practice and therefore full termination (with respect to an arbitrary strategy) cannot be expected.
Problem selection
We propose the collection of all "standard" TRSs together with all TRSs with flag "(STRATEGY OUTERMOST)" as testbed.
Scoring
Participants
insert your name here if you intend to participate.
- Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner (Cariboo)
- Matthias Raffelsieper, Hans Zantema
- Rene Thiemann (TTT)
- Joerg Endrullis (Jambox)
- Johannes Waldmann (Matchbox), but will need more time (December 2008)
