Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
Saul Kripke's thesis that ordinary proper names are rigid designators is supported by widely shared intuitions about the occurrence of names in ordinary modal contexts. By th...
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
We propose a new numerical scheme for linear transport equations. It is based on a decomposition of the distribution function into equilibrium and non-equilibrium parts. We also us...