I've been thinking about the best approach to implement pure function verification in the Scala compiler. An approach similar to the one in D would fit a lot better than the one used in Haskell (which would break all existing code and cause some problems due to strict evaluation). A solution using annotations would be quite simple to implement:
DocumentCloud runs every document you upload through Thomson Reuters OpenCalais, giving you access to extensive information about the people, places and organizations mentioned in each.
Concept search, full-text search and annotation structure search in one scaleable index: "Mímir is a multi-paradigm information management index and repository which can be used to index and search over text, annotations, semantic schemas (ontologies), and semantic meta-data (instance data). It allows queries that arbitrarily mix full-text, structural, linguistic and semantic queries and that can scale to gigabytes of text. A typical semantic annotation project deals with large quantities of data of different kinds. Mímir provides a framework for implementing indexing and search functionality across all these data type."
F. Amardeilh, P. Laublet, and J. Minel. K-CAP '05: Proceedings of the 3rd international conference on Knowledge
capture, page 161--168. New York, NY, USA, ACM, (2005)
O. Aubert, and Y. Pri&\#233;. HYPERTEXT '05: Proceedings of the sixteenth ACM conference on Hypertext and hypermedia, page 235--244. New York, NY, USA, ACM Press, (2005)