Discrete
发表于 2025-3-26 21:37:24
Mode analysis of functional logic programs,om logic programming. Such implementations can be largely improved if information about the run-time behavior, in particular the modes of function calls, is available at compile time. In this paper we present a framework to derive such globed information. The concrete operational semantics considere
VERT
发表于 2025-3-27 03:42:59
http://reply.papertrans.cn/88/8763/876203/876203_32.png
ironic
发表于 2025-3-27 09:07:36
Constraint-based type inference and parametric polymorphism,lain it in a different and more intuitive way as a flow problem. The intuition is facilitated by a direct correspondence between run-time and analysis-time concepts..Precise analysis of polymorphism is hard; several algorithms have been developed to cope with it. Focusing on parametric polymorphism
Osteons
发表于 2025-3-27 12:31:11
Efficient on-the-fly analysis of program behavior and static cache simulation,sis, . for program behavior analysis during execution using a small number of instrumentation points. The formal model is further refined for certain analyses by transforming a program‘s call graph into a function-instance graph. Performance evaluations show that the number of measurement points can
SNEER
发表于 2025-3-27 17:41:20
From processor timing specifications to static instruction scheduling,m used is SCCS, a synchronous process algebra for specifying timed, concurrent systems. We illustrate the technique by specifying a hypothetical processor that shares many properties of commercial processors (such as the MIPS or SuperSparc) including delayed loads and branches, interlocked floating-
ICLE
发表于 2025-3-27 21:35:15
http://reply.papertrans.cn/88/8763/876203/876203_36.png
丧失
发表于 2025-3-27 22:08:02
Generalized boxings, congruences and partial inlining,Peyton-Jones‘ techniques for optimizing boxings (allocations) and unboxings (field selection) away in strongly-typed functional programs. Our techniques achieve this goal, while not needing types any more (so it applies to Lisp as well as to ML), and providing a finer analysis; moreover, our techniq
micronutrients
发表于 2025-3-28 02:52:48
http://reply.papertrans.cn/88/8763/876203/876203_38.png
残废的火焰
发表于 2025-3-28 09:39:04
Uniqueness and completeness analysis of array comprehensions,defines each array element at most once. Uniqueness is a necessary condition for correctness in single assignment languages such as Haskell, Id, and Sisal. The uniqueness problem can be stated as a data dependence problem, which in itself can be reformulated as an integer linear programming problem.
恶臭
发表于 2025-3-28 12:10:14
Extent analysis of data fields,s functions explicitly restricted to a finite set. Data parallel functional languages based on this view would reach a very high level of abstraction. Here we consider two static analyses that, when successful, give information about the . of a data field with recursively defined elements, in the fo