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...
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
When constructing programs to process XML documents, we immediately face the question as to how XML documents should be represented internally in the programming language we use. C...
Agent communication languages (ACLs) invoke speech act theory and define individual message types by reference to particular combinations of beliefs and desires of the speaker (fea...
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...