H. R. Walters

Learn More
We present three term rewrite systems for integer arithmetic with addition, multiplication , and, in two cases, subtraction. All systems are ground connuent and terminating; termination is proved by semantic labelling and recursive path order. The rst system represents numbers by successor and predecessor. In the second, which deenes non-negative integers(More)
Existing models for I/O in side-eeect free languages focus on functional languages, which are usually based on a largely deterministic reduction strategy, allowing for a strict sequentialization of I/O operations. In concurrent logic programming languages a model is used which allows for don't care non-determinism; the sequentialization of I/O is(More)
  • 1