35 search results - page 2 / 7 » Logic-flow analysis of higher-order programs |
JMLR
2012
11 years 7 months ago
2012
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...
IFL
1998
Springer
13 years 9 months ago
1998
Springer
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...
TAPSOFT
1995
Springer
13 years 8 months ago
1995
Springer
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...
ESOP
2008
Springer
13 years 6 months ago
2008
Springer
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...
POPL
1990
ACM
13 years 8 months ago
1990
ACM
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...