|
|
|
|
|
|
| |
| |
|
|
|
|
| |
| |
|
|
http://www.pexforfun.com/
http://www.pexforfun.com/Documentation.aspx#HowDoesPexWork
That's the sort of stuff I don't see anyone doing with Java. Since I don't
actively look for this sort of stuff for .NET, I'm perhaps incorrectly
assuming people aren't doing the same sorts of things with the JVM. Are
there people writing code that does interesting things with java class files
other than using them as a target for compilation?
--
Darren New, San Diego CA, USA (PST)
C# - a language whose greatest drawback
is that it's best implementation comes
from a company that doesn't hate Microsoft.
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Darren New wrote:
> http://www.pexforfun.com/
>
> http://www.pexforfun.com/Documentation.aspx#HowDoesPexWork
For what it's worth, people do crazy stuff similar to this with Haskell.
But then, nobody really cares about that, because nobody ever uses
Haskell. Or maybe because writing your code in Haskell eliminates huge
classes of bugs in the first place. Or because Haskell is such a simple
language that it's "obvious" that you can do sophisticated processing of
source code. One of those...
--
http://blog.orphi.me.uk/
http://www.zazzle.com/MathematicalOrchid*
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Darren New <dne### [at] sanrrcom> wrote:
> http://www.pexforfun.com/
> http://www.pexforfun.com/Documentation.aspx#HowDoesPexWork
I don't get it.
--
- Warp
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Warp wrote:
> Darren New <dne### [at] sanrrcom> wrote:
>> http://www.pexforfun.com/
>
>> http://www.pexforfun.com/Documentation.aspx#HowDoesPexWork
>
> I don't get it.
Automated deduction of test cases that lead to complete coverage, by
examination of the execution of the code when probed with sample inputs,
then using those probes to deduce what the inputs have to be to provide
complete coverage.
--
Darren New, San Diego CA, USA (PST)
C# - a language whose greatest drawback
is that it's best implementation comes
from a company that doesn't hate Microsoft.
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Orchid XP v8 wrote:
> For what it's worth, people do crazy stuff similar to this with Haskell.
Yeah, that's kind of why functional languages were invented - to do crazy
analysis stuff with. :-)
--
Darren New, San Diego CA, USA (PST)
C# - a language whose greatest drawback
is that it's best implementation comes
from a company that doesn't hate Microsoft.
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
>> For what it's worth, people do crazy stuff similar to this with Haskell.
>
> Yeah, that's kind of why functional languages were invented - to do
> crazy analysis stuff with. :-)
I understand that the invention of functional programming languages
predates the invention of computers...
Out of the box, GHC can tell you whether you have incomplete or
overlapping pattern matches. You can do stuff with type-level
programming to statically guarantee that array index bounds are never
exceeded. And null pointers can't occur in the first place. And yet,
when a *popular* program does one tenth of this, everybody thinks it's
really cool, but Haskell does this every single day and nobody is even
slightly interested. :-(
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Darren New <dne### [at] sanrrcom> wrote:
> Warp wrote:
> > Darren New <dne### [at] sanrrcom> wrote:
> >> http://www.pexforfun.com/
> >
> >> http://www.pexforfun.com/Documentation.aspx#HowDoesPexWork
> >
> > I don't get it.
> Automated deduction of test cases that lead to complete coverage, by
> examination of the execution of the code when probed with sample inputs,
> then using those probes to deduce what the inputs have to be to provide
> complete coverage.
I press the button, and nothing happens. Doesn't seem very exciting or
cool to me...
--
- Warp
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Warp wrote:
> I press the button, and nothing happens. Doesn't seem very exciting or
> cool to me...
Works fine for me in firefox. Are you running NoScript or something?
Hmmm. Most of them run in under a second, but the "trim the suffix" program
is still running after maybe a minute or more.
--
Darren New, San Diego CA, USA (PST)
C# - a language whose greatest drawback
is that its best implementation comes
from a company that doesn't hate Microsoft.
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Darren New wrote:
> Warp wrote:
>> I press the button, and nothing happens. Doesn't seem very exciting or
>> cool to me...
>
> Works fine for me in firefox. Are you running NoScript or something?
>
> Hmmm. Most of them run in under a second, but the "trim the suffix"
> program is still running after maybe a minute or more.
Well, after aborting and resubmitting, it came back in a couple seconds, so
I guess it's just the connection that's a bit flakey or something.
--
Darren New, San Diego CA, USA (PST)
C# - a language whose greatest drawback
is that its best implementation comes
from a company that doesn't hate Microsoft.
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |