 |
Search |
 |
|||||||||||||||||||||||||||||||||||||||||||||||||||
|
Blogs by topic Programming and user forax
Programming
Closure introduction in Java will require a mechanism like the one introduced in C# 3.0
named extension methods. This post explain why extension methods are evil and
why we should try to find a better alternative.
My last post was about introduction of continuation is the Java VM,
This one is about how to use continuation to easily implement service on top of
a non blocking IO server.
This blog entry shows using a newly language named pseudo that enable gradual typing,
the effect of a typing and the overhead of dynamic calls on a Fibonacci's function performance
using the infrastructure provided by JSR 292.
J2EE
My last post was about introduction of continuation is the Java VM,
This one is about how to use continuation to easily implement service on top of
a non blocking IO server.
J2SE
My last post was about introduction of continuation is the Java VM,
This one is about how to use continuation to easily implement service on top of
a non blocking IO server.
This blog entry shows using a newly language named pseudo that enable gradual typing,
the effect of a typing and the overhead of dynamic calls on a Fibonacci's function performance
using the infrastructure provided by JSR 292.
Web Applications
My last post was about introduction of continuation is the Java VM,
This one is about how to use continuation to easily implement service on top of
a non blocking IO server.
Virtual Machine
My last post was about introduction of continuation is the Java VM,
This one is about how to use continuation to easily implement service on top of
a non blocking IO server.
This blog entry shows using a newly language named pseudo that enable gradual typing,
the effect of a typing and the overhead of dynamic calls on a Fibonacci's function performance
using the infrastructure provided by JSR 292.
Performance
This blog entry shows using a newly language named pseudo that enable gradual typing,
the effect of a typing and the overhead of dynamic calls on a Fibonacci's function performance
using the infrastructure provided by JSR 292.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||||||||||||||
|
