--
Daniel C. Sobral
I travel to the future all the time.
How much beer do I have to feed you to turn them into promises?
Cheers,
Miles
--
Miles Sabin
tel: +44 7813 944 528
gtalk: mi...@milessabin.com
skype: milessabin
http://www.chuusai.com/
http://twitter.com/milessabin
I've tried, but it seems no amount of beer can turn me into Martin.
On Sun, Jul 17, 2011 at 12:40 PM, Miles Sabin <mi...@milessabin.com> wrote:
On Sun, Jul 17, 2011 at 3:33 PM, Adriaan Moors <adriaa...@epfl.ch> wrote:How much beer do I have to feed you to turn them into promises?
> I hereby have -- please note that these are ideas, not promises
Cheers,
Miles
--
Miles Sabin
tel: +44 7813 944 528
gtalk: mi...@milessabin.com
skype: milessabin
http://www.chuusai.com/
http://twitter.com/milessabin
I've tried, but it seems no amount of beer can turn me into Martin.
On Sun, Jul 17, 2011 at 12:40 PM, Miles Sabin <mi...@milessabin.com> wrote:
On Sun, Jul 17, 2011 at 3:33 PM, Adriaan Moors <adriaa...@epfl.ch> wrote:How much beer do I have to feed you to turn them into promises?
> I hereby have -- please note that these are ideas, not promises
Cheers,
Miles
--
Miles Sabin
tel: +44 7813 944 528
gtalk: mi...@milessabin.com
skype: milessabin
http://www.chuusai.com/
http://twitter.com/milessabin
Adriaan,
Would you be able to write a blog piece about the ideas you presented?
It looks very interesting, but without some concrete examples and
explanation it looks a bit cryptic.
Looking forward reading the paper.
The presentation mentions virtual classes twice. Is that in the
pipeline?
I couldn't find it for myself, so it's worth asking:What does DOT stand for? :)
On Tue, Jul 19, 2011 at 8:05 PM, Alex Cruise <al...@cluonflux.com> wrote:I couldn't find it for myself, so it's worth asking:What does DOT stand for? :)Dependent Object Types.
Cheers
-- Martin
So where *do* I go to find out more about Deviant Old Trolls?
Boolean logic is simple and for deterministic state machines,
ineluctable. I.e., until we're using quantum computers, Boolean logic
is what we're working with.
How do you see it as limiting? Does the excluded middle chafe?
> Thanks,
> -Vlad
Randall Schulz
I.e. boolean algebra is a minimal mental structure, where we can
formalize difference between some
two things.
I mean: exists mapping, where formulas of non-classic logic mapped to
formulas in classic logic'.
Simplest case is derivalbility: G |- v-<n>(x) when value(x) is <n>
For intutionist logic, formulas, appropriative for logical values will be:
x|- A, |- ~~A, X|- ~~~~A from one side and x|- ~A, x|- ~~~A .....
from other ;)
Links -- I will think about this during next week and may be will
write a post in blog for you when have time
(as I understand, this discussion is far from scala-language; )
2011/7/23 Vlad Patryshev <vpatr...@gmail.com>: