This work expounds the notion that (structured) categories are syntax free presentations of type theories, and shows some of the ideas involved in deriving categorical semantics f...
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
The presentation layer of hypermedia systems could benefit from standard object querying functionality and this is most effective if strong typing is enforced. By strong typing we...
When students first learn programming, they often rely on a simple operational model of a program’s behavior to explain how particular features work. Because such models build o...