Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.python > #19519 > unrolled thread

Re: Constraints -//- first release -//- Flexible abstract class based validation for attributes, functions and code blocks

Back to article view | Back to comp.lang.python

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.

Contents

  Re: Constraints -//- first release -//- Flexible abstract class based validation for attributes, functions and code blocks Nathan Rice <nathan.alexander.rice@gmail.com> - 2012-01-27 01:38 -0500
    Re: Constraints -//- first release -//- Flexible abstract class based validation for attributes, functions and code blocks Jon Clements <joncle@googlemail.com> - 2012-01-27 13:59 -0800

#19519 — Re: Constraints -//- first release -//- Flexible abstract class based validation for attributes, functions and code blocks

> 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 <= Symbol() < len(L)) for some list L. So it
> might align well with your ideas.

Thanks for the tip.

>>> Probably deserves a better name than "constraintslib", that makes one
>>> think of constraint satisfaction.
>>
>> As you can probably tell from my other projects, I'm bad at coming up
>> with snappy names.
>
> I'm bad at doing research on previous projects ;)

I guess I'm not plugging my other projects enough...  You should check
out elementwise.

Thanks,

Nathan

[toc] | [next] | [standalone]

#19526

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 could be. ATS allows you to, at compile-time, declare
> > that isinstance(x, 0 <= Symbol() < len(L)) for some list L. So it
> > might align well with your ideas.
>
> Thanks for the tip.
>
> >>> Probably deserves a better name than "constraintslib", that makes one
> >>> think of constraint satisfaction.
>
> >> As you can probably tell from my other projects, I'm bad at coming up
> >> with snappy names.
>
> > I'm bad at doing research on previous projects ;)
>
> I guess I'm not plugging my other projects enough...  You should check
> out elementwise.
>
> Thanks,
>
> Nathan

I love elementwise and this one - thanks.

If I can be so bold, I would call it 'contracts'. Or, if you want to
be more imaginative and esoteric - 'judge'/'barrister'/'solicitor'.

Thanks again,

Jon.

[toc] | [prev] | [standalone]

Back to top | Article view | comp.lang.python

csiph-web