Hi, everyone. Long time no see. I have a specific proposal for scoped type
variables, which is totally different from plans A and B, and which I'd like
people to pick to pieces for me. (Especially you, Simon.)
Type variable scoping in System F is simple: the type bindings are explicit
and follow
Whatever happened to the idea of Or-Patterns?
http://www.haskell.org/pipermail/glasgow-haskell-users/2000-December/001535.html
I find them more than occasionally useful :) Is there some
theoretical difficulty
or is it just that nobody had the time/will to implement it?
Regards,
Lajos Nagy
___
Cyril Schmidt wrote:
> Working on a Monte-Carlo simulation where I have to
> calculate the values of a certain function on the given set of inputs,
> I noticed that some of the input variables change for every iteration,
> while others do not.
>
> To give a simple example, let's suppose I have a f
We show a presentation of heterogeneous sequences that admits infinite
sequences and permits post-hoc addition of new elements, even to an
already infinite sequence. We can also assert static constraints,
e.g., the sequence must be made of non-decreasing Peano numerals. Our
sequences permit all th