Generic Composition

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 2002 United Kingdom English Publisher:Association for Computing Machinery (ACM)Journal:Formal Aspects of Computing, volume 14, pages 108-122 (issn: 0934-5043, eissn: 1433-299X,

Copyright policy )

Authors: Chen, Y.;

doi: 10.1007/s001650200031

Generic Composition

- Summary
- Subjects
- Metrics

Abstract

Abstract. This paper presents a technique called 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.

Country

United Kingdom

Related Organizations

Durham University
United Kingdom
University of Leicester
United Kingdom

Keywords

Healthiness condition, Predicative semantics, Modal logic, Semantics in the theory of computing, Parallelism

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	10
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average