On Jan 27, 6:38 am, Nathan Rice nathan.alexander.r...@gmail.com
wrote:
May I suggest a look at languages such as ATS and Epigram? They use
types that constrain values specifically to prove things about your
program. Haskell is a step, but as far as proving goes, it's less
powerful than it
PyPi name: constraintslib (you'll be dissapointed if you get
constraints by accident)
Docs: http://packages.python.org/constraintslib/
Github: https://github.com/nathan-rice/Constraints
From the docs:
Constraints - Sleek contract-style validation tools
PyPi name: constraintslib (you'll be dissapointed if you get
constraints by accident)
Docs: http://packages.python.org/constraintslib/
Github: https://github.com/nathan-rice/Constraints
From the docs:
Constraints - Sleek contract-style validation tools
Ooh, runtime turing-complete dependent-types. :)
I'm not sure if you're aware of the literature on this sort of thing.
It's nice reading. A library such as this that's designed for it could
be used for static checks as well.
Probably deserves a better name than constraintslib, that makes one
On Thu, Jan 26, 2012 at 2:51 PM, Devin Jeanpierre
jeanpierr...@gmail.com wrote:
Ooh, runtime turing-complete dependent-types. :)
I'm not sure if you're aware of the literature on this sort of thing.
It's nice reading. A library such as this that's designed for it could
be used for static
On Thu, Jan 26, 2012 at 3:24 PM, Nathan Rice
nathan.alexander.r...@gmail.com wrote:
One of the nice things about Haskell is that the language is designed
in a way that is conducive to
proving things about your code. A side benefit of being able to prove
things about your code is that
in some
May I suggest a look at languages such as ATS and Epigram? They use
types that constrain values specifically to prove things about your
program. Haskell is a step, but as far as proving goes, it's less
powerful than it could be. ATS allows you to, at compile-time, declare
that isinstance(x, 0
