Summary: Implementing a Deduction System for a Guarded
Commands Procedural Language Using a Generic
Pedro Quaresma de Almeida
Departamento de Matem'atica da Universidade de Coimbra,
3000 COIMBRA --- PORTUGAL
email: firstname.lastname@example.org phone: +3513928097
August 2, 1994
Two main issues have to be dealt with when buiding formal proofs with any form
of computational system: the possibility of doing formal proofs in different deduction
systems and the possibility of different user/program interaction strategies.
If we want to emphasize efficiency we will adopt a system based in a predetermined
deduction system and an automatic theorem proving  style of doing proofs.
If we want a flexible ``workbench'' we will adopt a generic theorem prover i.e. a
system were one can implement different deduction systems and were one can adopt
different strategies of doing proofs.
We discuss here the second approach, analysing two different systems, Isabelle [14,
15, 16] and 2OBJ .
Finally we present an example of a deduction system for an axiomatic definition of