| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 権利関係 |
|
| 関連DOI |
|
|
|
|
|
| 関連URI |
|
|
|
|
|
| 関連情報 |
|
|
|
|
|
| 概要 |
A categorical interpretation of assertion(axiomatic) semantics of programming languages is proposed. All of the preconditions, postconditions and programs are interpreted as (binary) relations in topo...ses by making use of relational calculus, and several fundamental properties of Dijkstra's weakest preconditions are proved. Assertions in the semantics depend on the intuitionistic logic, so this is an extension of the assertion semantics due to E.G. Manes and M.A. Arbib.続きを見る
|
Mendeley出力
