• Freshml

  • Referenced in 49 articles [sw08992]
  • FreshML: programming with binders made simple. FreshML extends ML with elegant and practical constructs ... binding operations. User-declared FreshML datatypes involving binders are concrete, in the sense that values ... correctness property that values of datatypes involving binders are operationally equivalent if and only...
  • Nominal Isabelle

  • Referenced in 67 articles [sw12055]
  • only very poorly supported with single binders, such as lambda-abstractions. Our extension includes...
  • Beluga

  • Referenced in 25 articles [sw01321]
  • with data structures that provide support for binders. Many object languages include binding constructs ... functional languages still lack direct support for binders and common tricky operations such as renaming ... order abstract syntax (HOAS) where we represent binders in the object language with binders...
  • AutoDock

  • Referenced in 33 articles [sw09659]
  • guide organic synthetic chemists design better binders...
  • Binder

  • Referenced in 14 articles [sw26750]
  • Binder, a logic-based security language. We introduce the concept of a security language, used ... ACLs and X.509 certificates. In contrast, Binder is an openlogic-based security language that encodes ... statements ascomponents of communicating distributed logic programs. Binder programscan be more expressive than statements ... simplified and clarified by theirformulation in Binder. Translation into Binder has been used to explorethe...
  • BlenX

  • Referenced in 21 articles [sw12373]
  • inspired to the process calculus Beta-binders and it is intended for modelling any system...
  • Bedwyr

  • Referenced in 20 articles [sw09460]
  • directly supported using term-level λ-binders and the ∇ quantifier. These features allow reasoning directly...
  • Psi-calculi

  • Referenced in 11 articles [sw28573]
  • treat binding sequences, as opposed to single binders, in an efficient way. While different methods ... formalising single binder calculi have been proposed over the last decades, representations for such binding...
  • Sibyl

  • Referenced in 6 articles [sw11995]
  • prover for multi-modal hibrid logic with binders, the converse and global modalities, transitivity assertions ... contain any occurrence of the binder that is both in the scope and contains...
  • FreshOCaml

  • Referenced in 7 articles [sw22615]
  • which involve the manipulation of object language binders...
  • Unbound

  • Referenced in 4 articles [sw22613]
  • Binders unbound. mplementors of compilers, program refactorers, theorem provers, proof checkers, and other systems that ... expressive – it supports multiple atom types, pattern binders, type annotations, recursive binders, and nested binding...
  • Autosubst

  • Referenced in 2 articles [sw22669]
  • Interactive Theorem Proving. Reasoning about syntax with binders plays an essential role in the formalization ... programming languages. While the intricacies of binders can be ignored in paper proofs, formalizations involving ... binders tend to be heavyweight. We present a discipline for syntax with binders based...
  • LiquidHaskell

  • Referenced in 2 articles [sw27633]
  • must take into account which subset of binders actually reduces to values. We present ... stratified type system that labels binders as potentially diverging or not, and that (circularly) uses...
  • NetMHCIIpan

  • Referenced in 1 article [sw11791]
  • threshold for defining strong and weak binders based on predicted affinity (IC50) or % Rank. Strong...
  • LVC

  • Referenced in 1 article [sw22727]
  • semantic interpretations, a functional one (variables are binders) and an imperative one (variables are imperative...
  • BCiC

  • Referenced in 1 article [sw26749]
  • authentication and trust relations. BCiC integrates the Binder security language with the Calculus...
  • sdols

  • Referenced in 1 article [sw32402]
  • minimize squared error loss, absolute error loss, Binder loss, or the lower bound...
  • Coq

  • Referenced in 1751 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 598 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...