ideas provides feedback services to intelligent tutoring systems such as the digital mathematical environment of the Freudenthal Institute, MathDox, and Activemath.
Interactive domain reasoner for logic and mathematics, based on the feedback services of the Ideas framework. Domains supported include propositional logic (disjunctive normal form and equivalence proofs), mathematics (fractions, polynomial equations, powers, derivatives), linear algebra (Gaussian elimination and linear systems), and relation algebra. The domain reasoner is used by learning environments such as the digital mathematical environment of the Freudenthal Institute, MathDox, ActiveMath, and the GenExas logic tool.
This lexeme parser parses a legal identifier. Returns the identifier string. This parser will fail on identifiers that are reserved words. Legal identifier (start) characters and reserved words are defined in the LanguageDef that is passed to makeTokenParser. An identifier is treated as a single token using try.
This parser should accept any legal tail characters of identifiers. For example alphaNum <|> char "_".
This parser should accept any start characters of identifiers. For example letter <|> char "_".
ID3v2 (tagging standard for MP3 files) library
Controls the global idle callback so a GLUT program can perform background processing tasks or continuous animation when window system events are not being received. If enabled, the idle callback is continuously called when events are not being received. The current window and current menu will not be changed before the idle callback. Programs with multiple windows and/or menus should explicitly set the current window and/or /current menu/ and not rely on its current setting.
The amount of computation and rendering done in an idle callback should be minimized to avoid affecting the program's interactive response. In general, not more than a single frame of rendering should be done in an idle callback.
Implements IDNA - Internationalized Domain Names in Applications (RFC 3490).
Library to convert internationalized domain names between the ASCII (ACE) and Unicode encodings in accordance with IDNA2008 (RFC 5991: Internationalized Domain Names in Applications (IDNA): Protocol). Unlike IDNA2003, IDNA2008 is not based on RFC 3454: Preparation of Internationalized Strings ("stringprep").
Idris is a general purpose language with full dependent types. It is compiled, with eager evaluation. Dependent types allow types to be predicated on values, meaning that some aspects of a program's behaviour can be specified precisely in the type. The language is closely related to Epigram and Agda. There is a tutorial at http://www.idris-lang.org/documentation. Features include:
* Full dependent types with dependent pattern matching
* where clauses, with rule, simple case expressions, pattern matching let and lambda bindings
* Type classes, monad comprehensions
* do notation, idiom brackets, syntactic conveniences for lists, tuples, dependent pairs
* Totality checking
* Coinductive types
* Indentation significant syntax, extensible syntax
* Tactic based theorem proving (influenced by Coq)
* Cumulative universes
* Simple foreign function interface (to C)
* Hugs style interactive environment
Haskell identifier, e.g. foo, Baz
* Computation type: Simple function application.
* Binding strategy: The bound function is applied to the input value. Identity x >>= f == Identity (f x)
* Useful for: Monads can be derived from monad transformers applied to the Identity monad.
* Zero and plus: None.
* Example type: Identity a
The Identity monad is a monad that does not embody any computational strategy. It simply applies the bound function to its input without any modification. Computationally, there is no reason to use the Identity monad instead of the much simpler act of simply applying functions to their arguments. The purpose of the Identity monad is its fundamental role in the theory of monad transformers. Any monad transformer applied to the Identity monad yields a non-transformer version of that monad.
return immediate dominators for each node of a graph, given a root
A variant of Data.Dynamic that can be indexed, stored, transmitted trough communications etc.
Show more results