Description:
Different computer languages not specifically listed.
|
|
|
Language X, not Forth ?
|
| |
...I see no reason why this couldn't be done. I've personally - in a very limited and in a temporary situation - converted C into an IL (intermediate language) which was _almost_ FORTH. It required some work: deblocking, unrolling, un-parameterizing. So, I think it could be done with other languages too, but I don't believe it'd be optimal. Any language which is... more »
|
|
|
Embedding assembler in a language
|
| |
It is generally desirable for a high level language to be independent of any target hardware but ISTM that sometimes it is useful to write system-specific modules. For example, these could be specific to a CPU or to a hardware device. Any disagreement on this? If the above is accepted, I'd like to ask about the processor as one... more »
|
|
|
List comprehension
|
| |
It seems every language is adopting list comprehensions, even JavaScript [1]. I understand its roots, but can it can be done much simpler, and without specialized syntax? For example: [n * n | n <- [1..5], even n] While shorter than using map and filter, it's a specialized syntax. If a predicate were introduced into normal lambdas, you could get a more concise... more »
|
|
|
ANN: Seed7 Release 2009-11-15
|
| |
Hello, I have released a new version of Seed7: seed7_05_20091115.tgz In the Seed7 programming language new statements and operators can be declared easily. Types are first class objects and therefore templates/generics need no special syntax. Object orientation is used when it brings advantages and not in places when other... more »
|
|
|
Go Programming Language
|
| |
Hey everyone, I just stumbled across the Go programming language that Google is developing: [link] It seems really interesting. Some features to whet your appetite: - Fast compilation - Fast generated code - Type and memory safety - Lightweight concurrency - Interface inference (i.e. you don't have to declare that your type... more »
|
|
|
Message trees can be fast
|
| |
It's been said that interpreting a message tree will likely be much slower than interpreting bytecode. While developing Impulse, I wanted to see how far I could push message trees, and recent optimization have proven fruitful. In this microbenchmark (I know, I know), it takes under 5 seconds to iterate... more »
|
|
|
Final CfP, Ada-Europe 2010 EXTENDED submission deadline Nov 23
|
| |
Considering the requests of several potential contributors, and to give all authors the same opportunity of further refining their submission, the Conference and Program Chairs decided that the submission deadline for regular papers, tutorials and workshops will be extended by 1 week until Monday, November 23, 2009.... more »
|
|
|
|
