On 21/05/2012, at 12:22 AM, Raoul Duke wrote:
> On Sat, May 19, 2012 at 11:44 PM, john skaller
> wrote:
>> I guess it depends on the base language: Racket and Clojure are
>> both Lisp/Scheme dialects, right?
>
>
> for me i want things typechecked from the get-go. :-) having an
> inference engi
> better but I'm archaic, Pascal was my first language :)
syntax is the vietnam of programming languages? ('course in viet nam
it was called appropriately enough 'Resistance War Against America')
--
Live Security Virtual
On Sat, May 19, 2012 at 11:44 PM, john skaller
wrote:
> I guess it depends on the base language: Racket and Clojure are
> both Lisp/Scheme dialects, right?
well, they do use sexprs at least. code that is written to take
advantage of loosey goosey forms of dynamic typing with runtime
autocasting w
And here was have it:
// define an interface with one method
interface A {
geta: unit -> int;
}
// extend it with a second method
interface B extends A {
getb: unit -> int;
}
// implement a class for the first interface A
object anA (a:int) implements A = {
omethod fun geta()=> a
On 20/05/2012, at 7:05 PM, john skaller wrote:
> So here's object lambdas:
>
> //
> val x = (a=1, b=2, c="m");
> val y = (c=9.9, s="Hello");
>
> typedef X = (a:int, b:int, c:string);
> typedef Y = (c:double, s:string);
> typedef XYZ = extend X, Y with (k:string) end;
>
> var xyz:XYZ =
So here's object lambdas:
//
val x = (a=1, b=2, c="m");
val y = (c=9.9, s="Hello");
typedef X = (a:int, b:int, c:string);
typedef Y = (c:double, s:string);
typedef XYZ = extend X, Y with (k:string) end;
var xyz:XYZ = extend x,y with (k="world") end;
println$ xyz.a, xyz.b, xyz.c, xyz.s,