Results 1 
2 of
2
Verifying process algebra proofs in type theory
, 1993
"... In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typedcalculus. Inhabitants (terms) of these types represent proofs. The speci c typedcalculus we use is the Calculus of Inductive Constructions as implemented in the i ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
(Show Context)
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typedcalculus. Inhabitants (terms) of these types represent proofs. The speci c typedcalculus we use is the Calculus of Inductive Constructions as implemented in the interactive proof construction program COQ.
First Year Report
, 2003
"... syntax. The MathLang abstract syntax (that is to say the way we represent MathLang data) is de ned in the following sections. The abstract syntax will only be used in the WTC The BackusNaur form (BNF) is a metasyntax to formally describe languages. ..."
Abstract
 Add to MetaCart
syntax. The MathLang abstract syntax (that is to say the way we represent MathLang data) is de ned in the following sections. The abstract syntax will only be used in the WTC The BackusNaur form (BNF) is a metasyntax to formally describe languages.