In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
In this paper we suggest a typed compositional semantics for nominal compounds of the form [Adj Noun] that models adjectives as higher-order polymorphic functions, and where types...
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...