This paper presents a new notion of typing for logic programs which generalizes the notion of directional types. The generation of type dependencies for a logic program is fully automatic with respect to a given domain of types. The analysis method is based on a novel combination of program abstract
โฆ LIBER โฆ
A Polymorphic Type Dependency Analysis for Logic Programs
โ Scribed by Lunjin Lu
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 489 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0288-3635
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Type dependencies for logic programs usi
โ
Michael Codish; Vitaly Lagoon
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 197 KB
A simple polynomial groundness analysis
โ
Andy Heaton; Muhamed Abo-Zaed; Michael Codish; Andy King
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 169 KB
Mints type deductive calculi for logic p
โ
J.C. Shepherdson
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 606 KB
A semantic basis for the termination ana
โ
Michael Codish; Cohavit Taboch
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 287 KB
This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings ยฑ a possibly inยฎnite set of binary clauses. Termination of a program P and goal G is determined by the absenc
A General Framework for Automatic Termin
โ
Nachum Dershowitz; Naomi Lindenstrauss; Yehoshua Sagiv; Alexander Serebrenik
๐
Article
๐
2001
๐
Springer
๐
English
โ 403 KB
A fact dependency system for the logic p
โ
Peter S.G. Swinson; Fernando C.N. Pereira; Aart Bijl
๐
Article
๐
1983
๐
Elsevier Science
๐
English
โ 621 KB