{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/polyseq@0.1.2","name":"polyseq","description":"Given a term, this program calculates a set of \"optimal\" free theorems\nthat hold in a lambda calculus with selective strictness. It omits\ntotality (in general, bottom-reflection) and other restrictions when\npossible. The underlying theory is described in the paper \"Taming\nSelective Strictness\" (ATPS'09) by Daniel Seidel and Janis Voigtländer.","version":"0.1.2","softwareVersion":"0.1.2","license":"https://spdx.org/licenses/Other","keywords":["deprecated","language","library","program","public-domain","Propose Tags"],"maintainer":[{"@type":"Person","name":"JanisVoigtlaender"},{"@type":"Person","name":"DanielSeidel"}],"author":[{"@type":"Person","name":"JanisVoigtlaender"},{"@type":"Person","name":"DanielSeidel"}],"copyrightHolder":[{"@type":"Person","name":"JanisVoigtlaender"},{"@type":"Person","name":"DanielSeidel"}],"dateCreated":"2010-03-17","dateModified":"2026-09-15","datePublished":"2010-03-17","copyrightYear":2010,"downloadUrl":"https://hackage.haskell.org/package/polyseq-0.1.2/polyseq-0.1.2.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","sameAs":["https://hackage.haskell.org/package/polyseq-0.1.2"]}