128 search results - page 12 / 26 » Verifying Process Algebra Proofs in Type Theory |
FPCA
1995
13 years 11 months ago
1995
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
CALCO
2007
Springer
14 years 1 months ago
2007
Springer
We discuss the treatment of initial datatypes and final process types in the wide-spectrum language HasCASL. In particular, we present specifications that illustrate how datatype...
JLP
2006
13 years 7 months ago
2006
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...