We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
The HM(X) framework is a constraint-based type framework with built-in letpolymorphism. This paper establishes purely syntactic type soundness for the framework, treating an exten...
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
Abstract— A novel approach named recursive evidence filtering for information processing in Distributed Sensor Networks (DSNs) is presented. It is based on the Dempster-Shafer (...
Duminda A. Dewasurendra, Peter H. Bauer, Kamal Pre...
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...