Higher-Order Superposition for Dependent Types

We recently designed two calculi as stepping stones towards superposition for full higher-order logic: Boolean-free $\lambda$-superposition and superposition for first-order logic with interpreted Booleans. Stepping on these stones, we finally reach a ...$$

We recently designed two calculi as stepping stones towards superposition for full higher-order logic: Boolean-free $\lambda$-superposition and superposition for first-order logic with interpreted Booleans. Stepping on these stones, we finally reach a ...$$

We extend an existing first-order typing system for strictness analysis to the fully higher-order case, covering both the derivation system and the inference algorithm. The resulting strictness typing system has expressive capabilities far beyond that ...