• DiffSharp

  • Referenced in 60 articles [sw16033]
  • using higher-order functions, that is, functions which take other functions as arguments. Your functions ... meaning that you can compute exact higher-order derivatives or differentiate functions that are internally...
  • LEGO

  • Referenced in 107 articles [sw09685]
  • example, features of the system like argument synthesis and universe polymorphism make proof checking more ... that of informal mathematics. The higher-order power of its underlying type theories...
  • Polyp

  • Referenced in 33 articles [sw09131]
  • Jones’ theories of qualified types and higher-order polymorphism. The semantics of the programs ... extended language is obtained by adding type arguments to functions in a dictionary passing style...
  • LISP

  • Referenced in 126 articles [sw07201]
  • automatic storage management, dynamic typing, conditionals, higher-order functions, recursion, and the self-hosting compiler ... operator’s name first, and the arguments following; for instance, a function f that takes...
  • FC++

  • Referenced in 5 articles [sw00266]
  • parameters. The former functions are called ”higher-order” functions. A common feature of functions ... same function can be used with arguments of many types. FC++ is distinguished from other ... polymorphic higher-order functions can take other polymorphic functions as arguments and return polymorphic functions ... define your own higher-order polymorphic functions, but the library also contains a large amount...
  • hoa

  • Referenced in 4 articles [sw11057]
  • Provides higher-order approximations for inference based on extensions of saddlepoint type arguments as discussed...
  • HECTOR

  • Referenced in 2 articles [sw13320]
  • observational equivalence checker for a higher-order fragment of ML. The input language ... which comprises programs of short-type (order at most 2 and arity at most ... arguments are also of short-type. This is an expressive fragment that contains complex higher ... order types, and includes many examples from the literature which have proven challenging to verify...
  • AmiCo

  • Referenced in 5 articles [sw21182]
  • functions that preserve the productivity of their arguments and that are allowed in corecursive call ... specification to the synthesis of a higher-order definition to the registration of a friend...
  • Coq

  • Referenced in 1880 articles [sw00161]
  • Coq is a formal proof management system. It...
  • CUTE

  • Referenced in 65 articles [sw00177]
  • CUTE: a concolic unit testing engine for C...
  • Isabelle

  • Referenced in 698 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...
  • LEO-II

  • Referenced in 51 articles [sw00512]
  • LEO-II is a standalone, resolution-based higher...
  • Maple

  • Referenced in 5363 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 6337 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 13460 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • MiniSat

  • Referenced in 565 articles [sw00577]
  • An extensible SAT-solver. MiniSat is a minimalistic...
  • Nitpick

  • Referenced in 63 articles [sw00622]
  • Nitpick is a counterexample generator for Isabelle/HOL that...
  • NLTK

  • Referenced in 40 articles [sw00626]
  • This book offers an introduction to Natural Language...
  • R

  • Referenced in 9810 articles [sw00771]
  • R is a language and environment for statistical...
  • SageMath

  • Referenced in 1970 articles [sw00825]
  • Sage (SageMath) is free, open-source math software...