Analysing the complexity of functional programs: higher-order meets first-order
… complexity of higher-order functional programs can be analysed automatically by applying
program … complexity analysis of first-order term rewrite systems. This is done while carefully …
program … complexity analysis of first-order term rewrite systems. This is done while carefully …
Analysing the complexity of functional programs: Higher-order meets first-order (long version)
… complexity of higher-order functional programs can be analysed automatically by applying
program … complexity analysis of first-order term rewrite systems. This is done while carefully …
program … complexity analysis of first-order term rewrite systems. This is done while carefully …
[PDF][PDF] Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order
MAU Dal Lago, G Moser - 2015 - www-sop.inria.fr
… complexity of higher-order functional programs can be analysed automatically by applying
program … complexity analysis of first-order term rewrite systems. This is done while carefully …
program … complexity analysis of first-order term rewrite systems. This is done while carefully …
[PDF][PDF] Higher-Order Complexity Analysis With First-Order Tools
M Avanzini, U Dal Lago12… - Joint Proceedings of …, 2019 - cl-informatik.uibk.ac.at
… the complexity analysis of higher-order functional programs, … turn higher-order functional
programs into equivalent first-order … : higher-order meets first-order. In Proc. of 20th ICFP, pages …
programs into equivalent first-order … : higher-order meets first-order. In Proc. of 20th ICFP, pages …
Verifying higher-order functional programs with pattern-matching algebraic data types
… when applied to first-order, imperative programs such as C, … by a given HMTT meets the
output specification, assuming … algorithmically (though with extremely high asymptotic complexity)…
output specification, assuming … algorithmically (though with extremely high asymptotic complexity)…
Tuple interpretations for higher-order complexity
… However, developing a new technique for first-order termination and traditional
complexity analysis is not our goal. Our method does provide a more fine-grained notion of …
complexity analysis is not our goal. Our method does provide a more fine-grained notion of …
Typed open programming: a higher-order, typed approach to dynamic modularity and distribution
A Rossberg - 2007 - publikationen.sulb.uni-saarland.de
… is desirable to introduce a type complex of complex numbers, plus a … true with dynamics or
more general forms of type analysis. … In a first-order module system, we cannot express such a …
more general forms of type analysis. … In a first-order module system, we cannot express such a …
TiML: a functional language for practical complexity analysis with invariants
… the source program into a first-order program instrumented by … complexity analysis, which
requires analyzing higher-order … : Higher-order Meets First-order. In Proceedings of the 20th …
requires analyzing higher-order … : Higher-order Meets First-order. In Proceedings of the 20th …
Recurrence extraction for functional programs through call-by-push-value
… The main way of analyzing the complexity of a program is … the syntax of higher-order
recursive functional programs. The … least in the context of first-order programs. Thus the entire …
recursive functional programs. The … least in the context of first-order programs. Thus the entire …
Contract-based resource verification for higher-order functions with memoization
… first-order program that accurately models the higher-order … to verify complex resource
bounds in a challenging domain: … In our implementation, we perform a type-level static analysis …
bounds in a challenging domain: … In our implementation, we perform a type-level static analysis …