homepage: https://github.com/fsestini/zsyntax#readme
changelog-type: markdown
hash: e19b31133fba587b129b76200efef013f3089167dec63a327947d4b3e797edfb
test-bench-deps:
  base: ! '>=4.7 && <5'
  containers: ! '>=0.6.0 && <0.7'
  mtl: ! '>=2.2.2 && <2.3'
  multiset: ! '>=0.3.4 && <0.4'
  zsyntax: -any
maintainer: sestini.filippo@gmail.com
synopsis: Automated theorem prover for the Zsyntax biochemical calculus
changelog: ! '0.2.0.0

  -------

  * Separation of the core library (this package) from client code.

  * Substantial simplification of the API and internals.

'
basic-deps:
  base: ! '>=4.7 && <5'
  constraints: ! '>=0.10.1 && <0.11'
  containers: ! '>=0.6.0 && <0.7'
  mtl: ! '>=2.2.2 && <2.3'
  multiset: ! '>=0.3.4 && <0.4'
all-versions:
- '0.2.0.0'
author: Filippo Sestini
latest: '0.2.0.0'
description-type: text
description: ! '# zsyntax core library


  This library is a Haskell implementation of an automated theorem

  prover for Zsyntax, a logical calculus for molecular biology inspired

  by linear logic, that can be used to automatically verify biological

  pathways expressed as logical sequents.


  The prover implements fully-automatic forward proof search for the

  Zsyntax sequent calculus (ZBS), a logical calculus for a

  context-sensitive fragment of multiplicative linear logic where

  sequents are decorated so to account for the biochemical constraints.


  The theory behind the Zsyntax sequent calculus and its proof search

  procedure is developed in F. Sestini, S. Crafa, Proof-search in a

  context-sensitive logic for molecular biology, Journal of Logic and

  Computation, 2018 (https://doi.org/10.1093/logcom/exy028).

'
license-name: BSD3

Update from Hackage at 2018-12-15T13:14:37Z
Update from Hackage at 2018-12-15T13:14:37Z
