Abstract compilation of λProlog

被引：0

作者：

Malesieux, F ^{[1
]}

Ridoux, O ^{[1
]}

Boizumault, P ^{[1
]}

机构：

[1] Ecole Mines Nantes, F-44307 Nantes 03, France

来源：

LOGIC PROGRAMMING - PROCEEDINGS OF THE 1998 JOINT INTERNATIONAL CONFERENCE AND SYMPOSIUM ON LOGIC PROGRAMMING | 1998年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We propose a static analysis method for lambda Prolog programs using a technique of abstract compilation that has already been applied to Prolog by Codish and Demoen. The method features two phases: program abstraction and goal abstraction. Since these phases require normalized programs as inputs, we present procedures for both the normalization of lambda Prolog programs and their abstraction. The analysis of lambda Prolog programs is more complex than for Prolog because the language include universal and existential quantifications, implication and X-terms (higher-order). The principal difficulty is with higher-order because a static analysis must not only discover the properties of X-terms but also how X-terms propagate them. The propagation is described by transfer functions. We apply this method to groundness analysis.

引用

页码：130 / 144

页数：15