cafeobj 1.5.2-2 source package in Ubuntu
Changelog
cafeobj (1.5.2-2) unstable; urgency=medium * remove build-opts on armhf, something is broken there (FTBFS) -- Norbert Preining <email address hidden> Thu, 09 Oct 2014 09:07:46 +0900
Upload details
- Uploaded by:
- Norbert Preining
- Uploaded to:
- Sid
- Original maintainer:
- Norbert Preining
- Architectures:
- any
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| cafeobj_1.5.2-2.dsc | 1.8 KiB | 130ade64f5ee887871be04db2d109d88dbb989401d23c9a8e18f1afcb96f414e |
| cafeobj_1.5.2.orig.tar.gz | 6.0 MiB | 41d5b0e89c8ba76112e5e32fdd81abf57c758810ac3125decae080d83632e6d6 |
| cafeobj_1.5.2-2.debian.tar.xz | 4.7 KiB | 52fd642af864ccba24a74f1256667fe981028800de945fb47126da9bc4591b04 |
No changes file available.
Binary packages built by this source
- cafeobj: new generation algebraic specification and programming language
CafeOBJ is a most advanced formal specification language which
inherits many advanced features (e.g. flexible mix-fix syntax,
powerful and clear typing system with ordered sorts, parameteric
modules and views for instantiating the parameters, and module
expressions, etc.) from OBJ (or more exactly OBJ3) algebraic
specification language.
.
CafeOBJ is a language for writing formal (i.e. mathematical)
specifications of models for wide varieties of software and systems,
and verifying properties of them. CafeOBJ implements equational logic
by rewriting and can be used as a powerful interactive theorem proving
system. Specifiers can write proof scores also in CafeOBJ and doing
proofs by executing the proof scores.
.
CafeOBJ has state-of-art rigorous logical semantics based on
institutions. The CafeOBJ cube shows the structure of the various
logics underlying the combination of the various paradigms implemented
by the language. Proof scores in CafeOBJ are also based on institution
based rigorous semantics, and can be constructed using a complete set
of proof rules.
