polyseq-0.1.2.1: polyseq.cabal
name: polyseq
version: 0.1.2.1
license: PublicDomain
author: Daniel Seidel
maintainer: ds@iai.uni-bonn.de
synopsis: Taming Selective Strictness
description:
Given a term, this program calculates a set of \"optimal\" free theorems
that hold in a lambda calculus with selective strictness. It omits
totality (in general, bottom-reflection) and other restrictions when
possible. The underlying theory is described in the paper \"Taming
Selective Strictness\" (ATPS'09) by Daniel Seidel and Janis Voigtländer.
category: Language
tested-with: GHC==6.8.2
build-type: Simple
cabal-version: >= 1.2.3
extra-source-files:
src/Tests.hs
testcgi.py
test.sh
README
library
build-depends:
array >= 0.1.0.0
, bytestring >= 0.9.0.1
, cgi >= 3001.1.5.1
, containers >= 0.1.0.1
, free-theorems >= 0.3.1
, haskell-src >= 1.0.1.1
, mtl >= 1.1.0.0
, network >= 2.1.0.0
, old-locale >= 1.0.0.0
, old-time >= 1.0.0.0
, parsec >= 3.0.0
, pretty >= 1.0.0.0
, utf8-string >= 0.3.1.1
, xhtml >= 3000.0.2.1
if impl(ghc >= 6.10)
build-depends:
base >= 4
, syb >= 0.1.0.0
else
build-depends:
base >= 1 && < 4
exposed-modules:
Language.Haskell.FreeTheorems.Variations.PolySeq.PolySeq
Language.Haskell.FreeTheorems.Variations.PolySeq.PrettyPrint
Language.Haskell.FreeTheorems.Variations.PolySeq.TypeTranslator
Language.Haskell.FreeTheorems.Variations.PolySeq.TheoremGen
Language.Haskell.FreeTheorems.Variations.PolySeq.Parser.ParseTerm
other-modules:
Language.Haskell.FreeTheorems.Variations.PolySeq.M
Language.Haskell.FreeTheorems.Variations.PolySeq.TimeOut
Language.Haskell.FreeTheorems.Variations.PolySeq.ConstraintSolver
Language.Haskell.FreeTheorems.Variations.PolySeq.Debug
Language.Haskell.FreeTheorems.Variations.PolySeq.Highlight
Language.Haskell.FreeTheorems.Variations.PolySeq.PolySeqAlg
hs-source-dirs: src
executable polyseq.cgi
main-is:
polyseq-cgi.hs
hs-source-dirs: src
build-depends:
xhtml, cgi, utf8-string, free-theorems >= 0.3.1