We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
When reasoning about inductively defined predicates, such as typing judgements or reduction relations, proofs are often done by inversion, that is by a case analysis on the last r...
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Abstract— Many spatial phenomena exhibit vagueness. Representation of such phenomena requires vague objects. In previous work, we provided definitions for vague objects: vague p...
— The type-2 Fuzzy Logic Controller (FLC) has started to emerge as a promising control mechanism for autonomous mobile robots navigating in real world environments. This is becau...