Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
We consider the methods xδ n+1 = xδ n − gαn (F (xδ n)∗F (xδ n))F (xδ n)∗(F (xδ n)− yδ) for solving nonlinear ill-posed inverse problems F (x) = y using the only ava...
This paper is about the design of an artificial neural network to control an autonomous robot that is required to iteratively solve a discrimination task based on time-dependent s...