| Copyright | (c) Klaus Luettich Uni Bremen 2002-2004 |
|---|---|
| License | GPLv2 or higher, see LICENSE.txt |
| Maintainer | Christian.Maeder@dfki.de |
| Stability | provisional |
| Portability | portable |
| Safe Haskell | None |
Comorphisms.CASL2TopSort
Description
Coding out subsorting into unary predicates. New concept for proving Ontologies.
generatedness via non-injective datatype constructors (i.e. proper data constructors) is simply ignored
total functions my become partial because i.e. division is total for a second non-zero argument but partial otherwise.
partial functions remain partial unless they fall to together with an overloaded total function
Synopsis
- data CASL2TopSort = CASL2TopSort
Documentation
data CASL2TopSort Source #
The identity of the comorphism
Constructors
| CASL2TopSort |