• Beluga

  • Referenced in 26 articles [sw01321]
  • advocate the use of higher-order abstract syntax (HOAS) where we represent binders...
  • Bedwyr

  • Referenced in 21 articles [sw09460]
  • semantics. The second is that higher-order abstract syntax is directly supported using term-level...
  • CRSX

  • Referenced in 4 articles [sw23630]
  • specified reduction strategy). - Rule and term syntax based on lambda-calculus and term rewriting conventions ... ease parsing directly into higher-order abstract syntax (as well as permitting...
  • scunac

  • Referenced in 3 articles [sw21328]
  • operators (in the spirit of higher-order abstract syntax) mediating between functions in the (meta...
  • HMC

  • Referenced in 7 articles [sw09867]
  • Verifying functional programs using abstract interpreters. We present Hindley-Milner-Cousots (HMC), an algorithm that ... typed higher-order functional programs to interprocedural analysis for first-order imperative programs. HMC works ... logical refinement constraints into a simple first-order imperative program and an invariant that holds ... grounded in program syntax and state-based reasoning grounded in abstract interpretation, HMC enables...
  • SXSLT

  • Referenced in 3 articles [sw02365]
  • This paper describes SXSLT, a practical, higher-order, concise, expressive and readable declarative XML transformation ... head-first rewriting system over abstract XML syntax trees, implemented as a library extension ... power of SXSLT with several examples abstracted from practical projects. We and other people have ... SXSLT providing right abstractions for XML transformations, of being higher-order, declarative and extensible...
  • Pycket

  • Referenced in 2 articles [sw20001]
  • abstract machine and operates directly on abstract syntax trees. Pycket supports proper tail calls ... functional language, where recursion and higher-order functions are more prevalent than explicit loops...
  • 1ML

  • Referenced in 4 articles [sw19983]
  • functors. Modules form a separate, higher-order functional language on top of the core. There ... stratification; yet, it creates substantial duplication in syntax and semantics, and it reduces expressiveness ... surface syntax for System $mathrm{F}_{omega}$ that allows combining term and type abstraction...
  • EigenCFA

  • Referenced in 3 articles [sw14136]
  • benchmark EigenCFA, an algorithm for accelerating higher-order control-flow analysis (specifically, 0CFA) with ... limit, we reduced Shivers’s abstract-interpretive 0CFA to an algorithm synthesized from linear-algebra ... this reduction were “abstract” Church encodings, and encodings of the syntax tree and abstract domains...
  • ACL2

  • Referenced in 282 articles [sw00060]
  • ACL2 is both a programming language in which...
  • Coq

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

  • Referenced in 18 articles [sw00421]
  • Hybrid: a package for higher-order syntax in...
  • Isabelle

  • Referenced in 669 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 5270 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

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

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

  • Referenced in 31 articles [sw00663]
  • Semantic definitions of full-scale programming languages are...
  • R

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

  • Referenced in 743 articles [sw00789]
  • REDUCE is an interactive system for general algebraic...