Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Dependency analysis of natural language gives rise to non-projective structures. The constraint of well-nestedness on dependency trees has been recently shown to give a good fit ...
We propose a new type system for information flow analysis for the -calculus. As demonstrated by recent studies, information about whether each communication succeeds is important ...
The Sort operation is a core part of many critical applications. Despite the large efforts to parallelize it, the fact that it suffers from high data-dependencies vastly limits it...
Layali K. Rashid, Wessam Hassanein, Moustafa A. Ha...