InKreSAT is a prover for the modal logics K, T, K4, and S4. InKreSAT reduces a given modal satisfiability problem to a Boolean satisfiability problem, which is then solved using a SAT solver.â€¦ (More)

Reasoning about syntax with binders plays an essential role in the formalization of the metatheory of programming languages. While the intricacies of binders can be ignored in paper proofs,â€¦ (More)

We consider a two-sorted algebra over de Bruijn terms and de Bruijn substitutions equipped with the constants and operations from Abadi et al.'s sigma-calculus. We consider expressions with termâ€¦ (More)

We give a machine-checked proof of the equivalence of the usual, two-sorted presentation of System F and its single-sorted pure type system variant ÃŽÂ»2. This is established by reducing the typabilityâ€¦ (More)

Formalizing syntactic theories with variable binders is not easy. We present Autosubst [1], a library for the Coq proof assistant to automate this process. Given an inductive definition of syntacticâ€¦ (More)

A recursion scheme is an orthogonal rewriting system with rules of the form f(x1, . . . , xn)â†’ s. We consider terms to be equivalent if they rewrite to the same redex-free possibly infinite termâ€¦ (More)