Fun

Does your wife or girlfriend...

hamilton verissimo — Thu, 04 May 2006 13:11:00 GMT

...snore like a bear with sinusitis? Please tell me I'm not alone on this!

Silent Hill - the movie

hamilton verissimo — Wed, 26 Apr 2006 02:49:00 GMT

If you've played all Silent Hill games (I still need to complete SH4) I strongly advise you to go and see this movie. It's very cool ! It could be way better, though. :-)

MonoRail job?

hamilton verissimo — Tue, 25 Apr 2006 14:51:00 GMT

Funny job ad:

Senior Software Engineer (C#)

We’re looking for the you! Must be able to be bend software with your mind, create hugely scalable web sites, program like the wind, and not get dizzy while confronted with two huge 20” monitors. We use a lot of C#, .NET, MonoRail, Indigo. We like to drink beer and eat CheezIts.

Btw, if you want to apply for this job, see pluck web site

And another thing: these guys developed the awesome Shadows

Vacations

hamilton verissimo — Fri, 17 Mar 2006 21:22:00 GMT

I can't remember the last time I had vacations. When I've been to London, as any ordinary geek, I used my time to really focus on studying english, thus it wasn't really vacations... I'm also taking a few books (7) and hopefully will find my peace to think about the MonoRail Caching and the new and improved DynamicProxy.

Anyway, I'm leaving in a few hours, gonna drive for about 12 hours nonstop. I wish the weather were a little better :-(

Stay tunned on my flickr, too!

Weekend experiences

hamilton verissimo — Sat, 28 Jan 2006 23:31:00 GMT

I was able to compile and run the following code

x = 10
x = x + 1

Yeah, stupid, innit? You may look closer and realise that

'x' is an undeclared variable
'x' type is thus not defined
'x''s type is inferred based on operations of attribution that follows the first appearance

So x goes to a SymbolTable. Every assign expression that uses it is registered as a candidate on the SymbolTable entry. During the type resolval step it's easy to resolve the type of the first assign:

x = 10 # this is a int32 constant, nothing to compute here

Now the second is trickier:

x = x + 1

We're now trying to infer the type of a variable based on an expression that uses it.

Anyway, this is something I need to research more. My naive implementation is shameful.

The IL code generated is:

.method public hidebysig static void xpto() cil managed
{
      .entrypoint
      // Code Size: 15 byte(s)
      .maxstack 2
      .locals init (
            int32 num1)
      L_0000: ldc.i4 10
      L_0005: stloc.0 
      L_0006: ldloc.0 
      L_0007: ldc.i4 1
      L_000c: add 
      L_000d: stloc.0 
      L_000e: ret 
}

Which as you can see doesn't have even the minimum of optimization, which should produce

.method public hidebysig static void xpto() cil managed
{
      .entrypoint
      // Code Size: 15 byte(s)
      .maxstack 2
      .locals init (
            int32 num1)
      L_0000: ldc.i4_s 10  # within a byte range, use the short form
      L_0005: stloc.0 
      L_0006: ldloc.0 
      L_0007: ldc.i4_1     # same thing
      L_000c: add 
      L_000d: stloc.0 
      L_000e: ret 
}

But still better than the version produced by IronPython :-P

I'm still not convinced about construction a 100% dynamic language. A hybrid would be best, but I'd like to hear opinions.