Skip to main content
Log in

Presheaves as Configured Specifications

  • Published:
Formal Aspects of Computing

Abstract.

The paper addresses a notion of configuring systems, constructing them from specified component parts with specified sharing. This notion is independent of any underlying specification language and has been abstractly identified with the taking of colimits in category theory. Mathematically it is known that these can be expressed by presheaves and the present paper applies this idea to configuration.

We interpret the category theory informally as follows. Suppose ? is a category whose objects are interpreted as specifications, and for which each morphism u : XY is interpreted as contravariant ‘instance reduction’, reducing instances of specification Y to instances of X. Then a presheaf P: Set ?op represents a collection of instances that is closed under reduction. We develop an algebraic account of presheaves in which we present configurations by generators (for components) and relations (for shared reducts), and we outline a proposed configuration language based on the techniques. Oriat uses diagrams to express colimits of specifications, and we show that Oriat's category Diag(?) of finite diagrams is equivalent to the category of finitely presented presheaves over ?.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received May 1998 / Accepted in revised form August 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vickers, S., Hill, G. Presheaves as Configured Specifications. Form Aspects Comput 13, 32–49 (2001). https://doi.org/10.1007/PL00003938

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00003938

Navigation