Modular coinduction up-to for higher-order languages via first-order transition systems
The bisimulation proof method can be enhanced by employing `bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and bisimilarity, based on abstract fixed-point theory and compatible functi...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Logical Methods in Computer Science e.V.
2021-09-01
|
| シリーズ: | Logical Methods in Computer Science |
| 主題: | |
| オンライン･アクセス: | https://lmcs.episciences.org/6046/pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|