|
Home
News
Citegeist
|
Browse Groups
Search Groups
Journals
|
FAQs
Howto
Discussion
|
![]() |
CiteULike |
![]() |
CiteULike |
![]() |
![]() |
| Result page: 1 2 3 Next | RIS BibTeX RTF/PDF |
abstract-types algebra algebraic-reasoning algorithms allocation applicative-functors arithmetic arrows associated-types attribute-grammars backtracking build-systems call-by-value category-theory coalgebra codata coinduction collections combinators comonads compilation composable-references concurrency constraint-satisfaction continuation continuations contracts corecursion dataflow-programming dependent-types description-logic domain-theory dsl dynamic-linking dynamic-typing edsl effects embedding epigram equational-reasoning events exceptions expressiveness folds fp frp fundeps gadt generic-programming grammar graph gui haskell higher-ranked-types implicit-variables impredicative-types incremental-computing intermediate-language interpreters knowledge-representation lambda-calculus lattices lawvere-theories lazy-evaluation lexing linear-types logic logic-programming lua macros make metaocaml metaprogramming mixins ml modal-logic modules monads monad-transformers multiparadigm natural-language nested-datatypes non-strict ocaml oop optimization ordinals owl oz pan parsing partial-evaluation plt polymorphism programming program-transformation purely-functional-data-structures python query rdf recursion references reflection regular-expressions resumptions scala scheme semantics software-maintenance staged-programming structural-types symbolic-math system-f template-haskell termination testing text-formatting trampoline-style transluscent-functors type-as-proposition typecase type-classes type-coercion type-equality type-indexed-types type-inference type-isomorphisms type-system type-theory unboxed-types units virtual-types xml yampa zippers




