Arquitectura?

...investigadores de la Universidad Carlos III de Madrid (UC3M) han desarrollado el algoritmo SoSACO, que acelera la búsqueda de caminos entre dos nodos pertenecientes al grafo que representa a una red social... Habría que analizar si es aplicable a los datos de navrel este algoritmo.

Scaladoc Index Much like Hoogle for Haskell, Scalex lets you find Scala functions quickly. Names and Types Searches can be either textual (a list of words), or by type (a type signature) or both. A search is considered a text search unless it contains a combination of text and symbols, or if it starts with :. To search for both a type and a name, place a : between them, for example size: List[A] => Int Example queries map Search for the text map list map Search for the text list and the text map list[a] => (a => boolean) => list[a] Search for the type List[A] => (A => Boolean) => List[A] : list[a] => a Search for the type List[A] => A conserve: List[a] => (a => b) => List[b] Search for the text conserve and the type List[A] => (A => B) => List[B]

OSQA is the free, open source Q&A system you've been waiting for. Your OSQA site is more than just an FAQ page, it is a full-featured Q&A community. Users earn points and badges for useful participation, and everyone in the community wins

Qué útil esta página!

"Principles of Writing Consistent, Idiomatic JavaScript"

Interesante para probar de ponerlo en práctica y ver qué resulta, ¿no?

En github funciona muy muy bien el mecanismo, lo vengo usando bastante. El análisis, comprensión y diálogo que se genera a partir de los pull requests (y los reviews implícitos que esto produce, sumado a que la herramienta es muy muy buena, permitiendo cosas como poder poner comentarios y responderlos directamente en las lineas de código) son sumamente beneficiosos, ágiles y los resultados son muy buenos. Nosotros, localmente, venimos trabajando de manera similar a lo que se propone (y se acostumbra en github), tenemos branches por temas y se hace review y refactoring de las mismas antes de mergear al tronco de avance. Obviamente en este caso se extrañan MUCHO las herramientas de comunicación que provee github y que NO tenemos localmente.

A framework for easily creating beautiful presentations using HTML.

lift-json readme

"Kiama is a Scala library for language processing. It enables convenient analysis and transformation of structured data. The programming styles supported by the library are based on well-known formal language processing paradigms, including attribute grammars, tree rewriting, abstract state machines, and pretty printing."

Backbone.js gives structure to web applications by providing models with key-value binding and custom events, collections with a rich API of enumerable functions, views with declarative event handling, and connects it all to your existing API over a RESTful JSON interface.

Data.js is a data representation framework for Javascript. It is being developed in the context of Substance, a web-based document authoring and publishing engine. It took some inspiration from various existing libraries such as the Google Visualization API or Underscore.js.  You can report bugs and discuss features on the GitHub issues page, on Freenode IRC in the #_substance chann el, post questions to the Google Group, or send tweets to @_substance. With Data.js you can: Model your domain data using a simple graph-based object model that can be serialized to JSON. Traverse your graph, including relationships using a simple API. Manipulate and query data on the client (browser) or on the server (Node.js) by using exactly the same API. 

Functional is a library for functional programming in JavaScript. It defines the standard higher-order functions such as map, reduce (aka foldl), and select (aka filter). It also defines functions such as curry, rcurry, and partial for partial function application; and compose, guard, and until for function-level programming. And all these functions accept strings, such as 'x -> x+1', 'x+1', or '+1' as synonyms for the more verbose function(x) {return x+1}.