The standard versions of HOL only support disjoint sums over finite families of types. This paper introduces disjoint sums over type classes containing possibly a countably infinit...
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
On-line partial evaluators are hardly ever selfapplicable, because the complexity of deciding whether to residualize terms causes combinatorial explosion when self-application is ...
Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A...