CLEAR
发表于 2025-3-28 15:32:57
http://reply.papertrans.cn/88/8763/876203/876203_41.png
Gobble
发表于 2025-3-28 20:18:33
http://reply.papertrans.cn/88/8763/876203/876203_42.png
Supplement
发表于 2025-3-29 00:30:02
http://reply.papertrans.cn/88/8763/876203/876203_43.png
avarice
发表于 2025-3-29 03:33:12
Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop,programs. We illustrate how dependencies can be derived in the presence of both monomorphic and polymorphic type information. Type dependencies generalize the recently proposed notion of directional types as well as the more common notion of groundness dependencies. Directional types have proven use
GROG
发表于 2025-3-29 09:45:18
http://reply.papertrans.cn/88/8763/876203/876203_45.png
补角
发表于 2025-3-29 13:49:17
Directional type checking of logic programs,rrectness. We present lower bound complexity results for the general type checking problem where types are given as arbitrary set expressions, as well as for the restrictive class of discriminative directional types. For discriminative directional types the type checking procedure is shown to be sound and complete.
神圣不可
发表于 2025-3-29 19:18:09
Selective thunkification, necessarily evaluated under call-by-name, so the transformation does not need to generate thunks for them. The dataflow analysis is formulated as the solution to a set of constraints. We show that any solution to the constraints is sound, and that any such solution justifies the resulting transformation.
形上升才刺激
发表于 2025-3-29 21:53:55
Compile-time detection of uncaught exceptions in Standard ML programs, lines..We introduce semantic sparse analysis to reduce the analysis cost without compromising the analysis accuracy. In this method, expressions will only be analyzed when their evaluations are relevant to our analysis.
确定方向
发表于 2025-3-30 01:59:23
Estimating the computational cost of logic programs, estimate the number of solutions in order to give nontrivial upper bound cost estimates; on the other hand, the possibility of failure has to be taken into account while estimating lower bounds. Here we discuss techniques to address these problems to some extent.
妨碍
发表于 2025-3-30 06:03:59
Conference proceedings 1994eneric algorithms for fixpoint computations; program optimization, transformation and verification; strictness-related analyses; type-based analyses and type inference; dependency analyses and abstract domain construction.