Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...