128 search results - page 5 / 26 » Verifying Process Algebra Proofs in Type Theory |
ENTCS
2002
13 years 7 months ago
2002
Category theory has proved a useful tool in the study of type systems for sequential programming languages. Various approaches have been proposed to use categorical models to exam...
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
APAL
2005
13 years 7 months ago
2005
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
PLPV
2011
ACM
12 years 10 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
FMCO
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. Machine functions have been introduced by Earley and Sturgis in [6] in order to provide a mathematical foundation of the use of the T-diagrams proposed by Bratman in [5]....