| http://www.w3.org/ns/prov#value | - Languages such as ATS or Agda have Turing-complete (modulo general recursion) type-systems, and can express almost any provable constraint as a type.DeleteReplySam Tobin-HochstadtJune 20, 2012 at 7:22 AMMy dissertation on Typed Racket [1] contains somewhat more data, with similar conclusions.
|
