Projects

Boo Programming Language

A wrist-friendly language targeting the Common Language Runtime (.NET / Mono) with an extensible compiler pipeline, a syntax reminiscent of Python, and many other features (like type inference, syntactic macros, etc.)

Racket

Programming language suitable for implementation tasks ranging from scripting to application development, and supporting the creation of new programming languages. It includes the DrRacket programming environment, a virtual machine with a just-in-time compiler, and various other tools.

Rascal MPL

Rascal is a domain specific language for source code analysis and manipulation a.k.a. meta-programming. It is currently being developed and tested at CWI. No formal release has been made yet, but there are alpha quality previews available.

PPI Benchmark

A comprehensive benchmark of kernel methods to extract protein-protein interactions from literature.

Nicol

Scala 2D Game Framework

The Fancy Programming Language

Fancy is a dynamic, object-oriented programming language heavily inspired by Smalltalk, Ruby and Erlang. It supports dynamic code evaluation (as in Ruby & Smalltalk), class-based mixins, (simple) pattern matching, runtime introspection & reflection, "monkey patching" and much more. ... [More] It runs on Rubinius, the Ruby VM, and thus has first-class integration with Ruby's core library and any additional Ruby libraries that run on Rubinius, including most C-extensions. [Less]

metasharp

Meta# is a pattern matching library for .net, which includes a flexible grammar language, a visual studio extension and many other tools to help create custom DSLs.

dawg-keyset

The dawg-keyset is a C++ library for multiple pattern matching: locating all occurrences of specified patterns in text. The dawg-keyset builds a matching machine from a specified set of patterns and provides memory-efficient pattern matching. In practice, the size of a matching machine for 100,000 English words is less than 1MB.

aabp

O problema de "pattern matching", ou seja, encontrar uma string p (chamada de padrão) dentro de uma string t (chamada de texto), dizendo as posições onde p ocorre dentro de t, é um problema bem explorado na computação. Existe uma grande quantidade de algoritmos diferentes resolvendo ... [More] o problema e uma ótima literatura falando sobre o assunto. O objetivo desse projeto é examinar, analisar e implementar alguns desses algoritmos, criando umtexto conciso para aqueles que já entendam bem o problema, mas querem entender melhor as soluções. Provendo uma boa análise e uma implementação dos algoritmos, esse pequeno projeto visa a difundição do conhecimento científico sobre esse assunto. [Less]

edocrab

Use mobile phones as bar code scanner.