- Use Church simply type lambda calculus without type variables. No type constructors by now.
- Same type for both sides of the rule.
- Rewriting with matching modulo alpha and union beta.
- Rewriting with higher-order pattern matching on beta-normal eta-long forms (HRS). In this case, left and right hand sides are assumed to be normalized.
- Other categories may be considered in the near future. For instance, we can add STTRS and use the problem families without binders, but with a different semantics.
- We postpone certification for the future.
A precise syntax following the standards of the TPDB will be defined very soon.
This page was last modified on 14 May 2010, at 14:23.