| |||||||||||||||||||
| |||||||||||||||||||
Description | |||||||||||||||||||
Assembles all the logics and comorphisms into a graph. The modules for the Grothendieck logic are logic graph indepdenent, and here is the logic graph that is used to instantiate these. Since the logic graph depends on a large number of modules for the individual logics, this separation of concerns (and possibility for separate compilation) is quite useful. References: T. Mossakowski: Relating CASL with Other Specification Languages: the Institution Level Theoretical Computer Science 286, p. 367-475, 2002. Todo: Add many many logics and comorphisms. | |||||||||||||||||||
Synopsis | |||||||||||||||||||
| |||||||||||||||||||
Produced by Haddock version 0.6 |