Hierarchical organisation of predicate-semantic models

  • Authors:

  • Yifeng Chen

  • Affiliations:

  • Department of Computer Science, University of Durham, Durham, UK

  • Venue:
  • UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces techniques to organise predicate- semantic models in a hierarchical structure so that a new model can inherit the laws of the existing ones. Generic composition is used to simplify the manipulation of predicates. Necessary restrictions are imposed on the definition of each model so that the inheritance relation can be established by checking a few conditions on the healthiness conditions and the commands. Much of the checking can be supported by laws of generic composition. The techniques also help simplify the proof of well-definedness of program combinators (i.e. their closure in the semantic space) so that we no longer need to prove it (in predicate calculus) for every new model.