14 projects tagged "programming language"
Updated 20 May 2013
HGL Suite
| Pop | 155.30 |
|---|---|
| Vit | 13.55 |
HGL is a compiler/interpreter suite for developing images. It features its own simple but powerful language, an output format configurable by plugins, runtime input handled by plugins, and easy integration into various environments like Web servers or graphical applications. The input is taken from a source file, which has to be compiled for quick and frequent access by the interpreter. An interpreter then runs the compiled files, takes input from custom plugins (if neccessary), and outputs its result via custom plugins.
Updated 16 Feb 2013
libklel
| Pop | 36.41 |
|---|---|
| Vit | 1.92 |
The KoreLogic Expression Language Library (libklel) is a C library that provides a simple expression language that can be embedded in other programs. It does not implement a full programming language, but rather a simpler expression language called KL-EL that is designed to provide arithmetic and logic operations in situations where embedding a full programming language would be overkill. KL-EL can access functions and variables exported from the embedding program, and is statically and strongly typed, which helps ensure that expressions are valid before they are executed. The embedding API is easy to use, and the library itself is very small.
Updated 13 Dec 2012
Mocosel
| Pop | 22.98 |
|---|---|
| Vit | 21.81 |
Mocosel is a high-level programming language, based on a simple syntax but offering a very powerful and self-extensive programming experience.
Updated 05 Nov 2011
proty
| Pop | 19.34 |
|---|---|
| Vit | 23.76 |
Proty is a prototype-based dynamic programming language.
Updated 13 Sep 2011
Continuation Passing C
| Pop | 54.94 |
|---|---|
| Vit | 1.75 |
CPC (Continuation Passing C) is a programming language designed for writing concurrent systems. The CPC programmer manipulates very lightweight threads, choosing whether they should be cooperatively or preemptively scheduled at any given point; the CPC program is then processed by the CPC translator, which produces highly efficient event-loop code. This approach gives the best both worlds: the relative convenience of programming with threads, and the low memory usage of event-loop code. The semantics of CPC is defined as a source-to-source translation from CPC into plain C using a technique known as conversion into Continuation Passing Style. The current implementation of CPC has been used to write Hekate, a BitTorrent seeder designed to handle millions of simultaneous torrents and tens of thousands of simultaneously connected peers.
Updated 01 Dec 2010
Qt4Urbi
| Pop | 16.25 |
|---|---|
| Vit | 30.05 |
Qt for Urbi is a binding of the Qt library in Urbi, enabling you to create native graphical interfaces dynamically directly from Urbi. It exposes urbiscript events to ease the use of Qt signals and slots. Major and minor version numbers of the Qt for Urbi packages reflects the Urbi SDK version number for which they were built. Loading it in another version of the Urbi kernel probably won't work. For instance, Qt for Urbi 2.4.x will only work with Urbi SDK 2.4.y. It is still a bit experimental. Only the 32-bit Linux version is available, and not all classes and members are bound yet.
Updated 05 Oct 2010
Charm++
| Pop | 24.52 |
|---|---|
| Vit | 1.00 |
Charm++ is a portable adaptive runtime system for parallel applications. Application developers create an object-based decomposition of the problem of interest, and the runtime system manages issues of communication, mapping, load balancing, fault tolerance, and more. Sequential code implementing the methods of these parallel objects is written in C++. Calls to libraries in C++, C, and Fortran are common and straightforward. Charm++ is portable across individual workstations, clusters, accelerators (Cell SPEs and GPUs), and supercomputers such as those sold by IBM (Blue Gene, POWER) and Cray (XT3/4/5/6). Applications based on Charm++ are used on at least 5 of the 20 most powerful computers in the world.
Updated 08 Sep 2010
larceny
| Pop | 34.29 |
|---|---|
| Vit | 1.00 |
Larceny is a simple and efficient implementation of the Scheme programming language. Created originally as a test vehicle for research on garbage collection and compiler optimizations, Larceny has grown into a major multi-platform system, and is one of the very few implementations that support all four de facto standards for Scheme: IEEE/ANSI, R5RS, ERR5RS, and the R6RS. Development of Larceny has been supported by NSF, Sun Microsystems, and Microsoft.
Updated 01 May 2010
Shannon
| Pop | 32.95 |
|---|---|
| Vit | 35.34 |
Shannon is a general purpose stream-oriented programming language; it is concise and yet feature rich. Streams, FIFOs, and Unix shell-style pipes are first-class concepts in the language. You can connect functions and FIFOs within your program similar to the way you connect processes with pipes in the Unix shell. These constructs in Shannon, however, are highly efficient as no true multitasking is involved, and at the same time they allow you to write more concise and readable code for chained data processing. State is a special type of function that returns a reference to its own local data and any nested functions it may have. In effect, states implement classes in terms of OOP, and yet classes per se aren't part of the language. A special type of modules marked as "persistent" is an effective replacement for databases and SQL. This allows you to access persistent shared data using native Shannon constructs, eliminating the need for an extra query language. Intuitive and minimalist syntax and semantics are used. Particularly, "minimalist semantics" means less things to remember and more possibilities. Shannon is statically-typed, although it provides dynamic typing facilities as well.
Updated 18 Nov 2009
Crules
| Pop | 41.50 |
|---|---|
| Vit | 35.78 |
Crules is a dynamic programming language that takes influences from Python, Perl, and Haskell. The main motivation for this language was the concept or design of a new paradigm or feature called "rules". A rule is a potential entry point which has dependencies rather than parameters. Any rule can be overridden to have different or no dependencies. Since the language itself can decide on the best course of actions for an operation, dependencies become preconditions for execution. It also features lazy evaluation, object orientation, variadic and anonymous-parameter functions, and reflection. These features help make the language truly dynamic.
