On Sat, Mar 14, 2009 at 2:36 AM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
a lot. However, isn't this halfheartedly since we all wait for full
dependent types? :-)
Well, in C++ one can already use the numerical values with templates for
achieving a lot of compile time
Hi Henning
On 14 Mar 2009, at 01:36, Henning Thielemann wrote:
On Tue, 10 Mar 2009, Conor McBride wrote:
Apologies for crossposting. Please forward this message
to individuals or lists who may be interested. In addition
to the recently advertised PhD position at Strathclyde on
Reusability
Am Samstag, 14. März 2009 08:19 schrieb Peter Verswyvelen:
Well, in C++ one can already use the numerical values with templates for
achieving a lot of compile time computations.
So I would be very happy to have this feature in Haskell. It might also be
good research towards full dependent
Hi Wolfgang
On 14 Mar 2009, at 12:00, Wolfgang Jeltsch wrote:
Am Samstag, 14. März 2009 08:19 schrieb Peter Verswyvelen:
Well, in C++ one can already use the numerical values with
templates for
achieving a lot of compile time computations.
So I would be very happy to have this feature in
On Saturday 14 March 2009 8:12:09 am Conor McBride wrote:
Rome wasn't burnt in a day.
Of course I want more than just numerical indexing (and I even
have a plan) but numeric constraints are so useful and have
so much of their own peculiar structure that they're worth
studying in their own
Am Samstag, 14. März 2009 14:51 schrieb Conor McBride:
Conor, is Epigram currently under development?
We've even stopped working on the engine and started working on the chassis.
I'm in an intensive teaching block until the end of April, but from May it
becomes Priority. The Reusability and
Hi Dan
On 14 Mar 2009, at 14:26, Dan Doel wrote:
On Saturday 14 March 2009 8:12:09 am Conor McBride wrote:
Rome wasn't burnt in a day.
Of course I want more than just numerical indexing (and I even
have a plan) but numeric constraints are so useful and have
so much of their own peculiar
On Saturday 14 March 2009 1:07:01 pm Conor McBride wrote:
But this...
2) A family of singleton types int(n) parameterized by the static
type.
For instance, int(5) is the type that contains only the run-time
value 5.
3) An existential around the above family for representing
Hi Dan
On 14 Mar 2009, at 18:48, Dan Doel wrote:
On Saturday 14 March 2009 1:07:01 pm Conor McBride wrote:
I don't think the duplicate-or-plunge dilemma you
pose exhausts the options. At least, I seem no reason to presume
so and I look forward to finding out!
I didn't mean to suggest that
On Tue, 10 Mar 2009, Conor McBride wrote:
Apologies for crossposting. Please forward this message
to individuals or lists who may be interested. In addition
to the recently advertised PhD position at Strathclyde on
Reusability and Dependent Types, I am delighted to
advertise the following PhD
Apologies for crossposting. Please forward this message
to individuals or lists who may be interested. In addition
to the recently advertised PhD position at Strathclyde on
Reusability and Dependent Types, I am delighted to
advertise the following PhD opportunity.
Hello Conor,
Tuesday, March 10, 2009, 6:59:58 PM, you wrote:
{-
-- Haskell Types with Numeric Constraints
-}
are you have in mind integrating results into
Hi Bulat, hi all,
On 10 Mar 2009, at 16:06, Bulat Ziganshin wrote:
Hello Conor,
Tuesday, March 10, 2009, 6:59:58 PM, you wrote:
{-
-- Haskell Types with Numeric Constraints
13 matches
Mail list logo
