G. Levi and F. Spoto. An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. In Principles of Declarative Programming, volume 1490 of Lecture Notes in Computer Science, pages 152--169. Springer-Verlag, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....kinds of program properties. But again, the choice of a pre interpretation is on a case by case basis. Others in one or another way annotate the types with information about the positions where a variable can occur. This is the case in: 26, 27] the binding time analysis of [30] and also in [21] which uses types and applies linear refinement to enrich the type domain with P os like dependencies. Most close to our approach is the work of [19] which associates properties with what we call in this paper the constituents of the type of the variable (the types possible for subterms of its ....

G. Levi and F. Spoto. An experiment in domain refinement: Type domains and type representations for logic programs. In Proc. PLILP/ALP'98, volume 1490 of LNCS, pages 152--169. Springer, 1998.

....kinds of program properties. But again, the choice of a pre interpretation is on a case by case basis. Others in one or another way annotate the types with information about the positions where a variable can occur. This is the case in: 26, 27] the binding time analysis of [30] and also in [21] which uses types and applies linear refinement to enrich the type domain with P os like dependencies. Most close to our approach is the work of [19] which associates properties with the subtypes of a variable. In that work, abstract unifications are abstracted by Boolean formulas expressing the ....

G. Levi and F. Spoto. An experiment in domain refinement: Type domains and type representations for logic programs. In Proc. PLILP/ALP'98, volume 1490 of LNCS, pages 152--169. Springer, 1998.

No context found.

G. Levi and F. Spoto. An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. In Principles of Declarative Programming, volume 1490 of Lecture Notes in Computer Science, pages 152--169. Springer-Verlag, 1998.

....[4] a domain with properties similar to those of Pos is built, the way it is constructed is not a generalisation of that used for Pos [15] Indeed, the domain defined in [4] is not made of logical formulas and cannot be obtained by linear refinement of a basic domain for the type properties. In [12] it is shown that a hierarchy of domains for type analysis can be defined in the same way as it has been done in the case of groundness analysis [15] Transfinite formulas, which are needed to deal with polymorphism, are used to represent the type domain and generalise the finite formulas of Pos . ....

....and Schroder elimination, are used as abstract operators over transfinite formulas and are the generalisation of the same operators used for the Pos domain for groundness analysis. In this paper we use the abstract interpretation framework [7, 8] to generalise the correctness result of [6] and [12] to a much larger class of type domains. Namely, we show that the abstract operators defined in these two papers are correct for every type domain, including then groundness and non freeness, which were not covered in [12] Moreover, we present a very weak condition, sufficient to entail the ....

[Article contains additional citation context not shown here]

Giorgio Levi and Fausto Spoto. An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs. In Catuscia Palamidessi, Hugh Glaser, and Karl Meinke, editors, Principles of Declarative Programming, volume 1490 of Lecture Notes in Computer Science, pages 152--169, Pisa, Italy, September 1998. c flSpringer-Verlag.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC