Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Generic composition.

Chen, Y. (2002) 'Generic composition.', Formal aspects of computing., 14 (2). pp. 108-122.

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.

Item Type:Article
Keywords:Predicative semantics, Healthiness condition, Modal logic, Parallelism.
Full text:Full text not available from this repository.
Publisher Web site:http://dx.doi.org/10.1007/s001650200031
Record Created:23 Apr 2008
Last Modified:08 Apr 2009 16:22

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library