Copyright | (c) Till Mossakowski and Uni Bremen 2003 |
---|---|

License | GPLv2 or higher, see LICENSE.txt |

Maintainer | till@informatik.uni-bremen.de |

Stability | provisional |

Portability | non-portable (existential types) |

Safe Haskell | None |

Assembles all the logics into a list, as a prerequisite for the logic 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:

J. A. Goguen, R. M. Burstall: Institutions: Abstract Model Theory for Specification and Programming, Journal of the Association for Computing Machinery 39, p. 95-146.

J. Meseguer: General logics. Logic Colloquium 87, p. 275-329, North Holland.

Todo: Add many many logics.

# Documentation

addLogicName :: AnyLogic -> (String, AnyLogic)