Yifeng Chen
Generic composition
Chen, Yifeng
Authors
Abstract
This paper presents a technique called {\em generic composition} to provide a uniform basis for modal operators, sequential composition, different kinds of parallel compositions and various healthiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is defined. A completeness theorem shows that any predicate can be written in terms of generic composition and its weak inverse. A number of algebraic laws that support reasoning are derived.
Citation
Chen, Y. (2002). Generic composition. Formal aspects of computing (Internet), 14(2), 108-122. https://doi.org/10.1007/s001650200031
| Journal Article Type | Article |
|---|---|
| Publication Date | 2002-12 |
| Deposit Date | Apr 23, 2008 |
| Journal | Formal Aspects of Computing |
| Print ISSN | 0934-5043 |
| Electronic ISSN | 1433-299X |
| Publisher | Springer Verlag |
| Peer Reviewed | Peer Reviewed |
| Volume | 14 |
| Issue | 2 |
| Pages | 108-122 |
| DOI | https://doi.org/10.1007/s001650200031 |
| Keywords | Predicative semantics, Healthiness condition, Modal logic, Parallelism. |
You might also like
The weakest specifunction
(2005)
Journal Article
A fixpoint theory for non-monotonic parallelism
(2003)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search