Static Semantic Analysis and Theorem Proving for CASL (1998)
Cached
Download Links
- [www.informatik.uni-bremen.de]
- [informatik.uni-bremen.de]
- DBLP
Other Repositories/Bibliography
| Venue: | In F. Parisi-Presicce (Ed.): Recent Trends in Algebraic Development Techniques |
| Citations: | 21 - 11 self |
BibTeX
@INPROCEEDINGS{Mossakowski98staticsemantic,
author = {Till Mossakowski and Kolyang and Bernd Krieg-Brückner},
title = {Static Semantic Analysis and Theorem Proving for CASL},
booktitle = {In F. Parisi-Presicce (Ed.): Recent Trends in Algebraic Development Techniques},
year = {1998},
pages = {333--348},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper presents a static semantic analysis for CASL, the Common Algebraic Specification Language. Abstract syntax trees are generated including subsorts and overloaded functions and predicates. The static semantic analysis, through the implementation of an overload resolution algorithm, checks and qualifies these abstract syntax trees. The result is a fully qualified CASL abstract syntax tree where the overloading has been resolved. This abstract syntax tree corresponds to a theory in the institution underlying CASL, subsorted partial first-order logic with sort generation constraints (SubPCFOL). Two ways of embedding SubPCFOL in higher-order logic (HOL) of the logical framework Isabelle are discussed: the first one from SubPFOL to HOL via PFOL (partial first-order logic) first drops subsorting and then partiality, and the second one is the counterpart via SubFOL (subsorted first-order logic). The C in SubPCFOL stands for sort generation constraints, which are translated separat...
