[Haskell-cafe] If you'd design a Haskell-like language, what would you do different?

[Brandon Allbery]

On Tue, Dec 20, 2011 at 17:52, Jesse Schalken <jesseschalken at gmail.com>wrote:

> On Wed, Dec 21, 2011 at 1:09 AM, Gregory Crosswhite <gcrosswhite at gmail.com
> > wrote:
>
>> That would certainly be a lovely idea *if* we were programming in Agda,
>> but I was under the assumption that this conversation was about Haskell.
>>  :-)
>>
>
> I don't have experience with proof assistants, but maybe my answer to this
> thread can be summed up as giving Haskell that kind of capability. ;)
>

You want to look at Agda:  a proof assistant language whose syntax is
similar to Haskell, and which supports dependent types and the like.

-- 
brandon s allbery                                      allbery.b at gmail.com
wandering unix systems administrator (available)     (412) 475-9364 vm/sms
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20111220/9614f85d/attachment.htm>