75 search results - page 3 / 15 » Termination Analysis of Higher-Order Functional Programs |
122
click to vote
UC
2009
Springer
15 years 6 months ago
2009
Springer
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...
104
Voted
IEICET
2007
14 years 11 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
VMCAI
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a multi-pass interprocedural analysis and transformation for the functional aggregate update problem. Our solution handles untyped programs, including unrestri...
KI
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specificati...
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...