A framework for analysis of typed logic programs

Vitaly Lagoon, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

11 Citations (Scopus)

Abstract

The paper presents a novel approach to the analysis of typed logic programs. We assume regular type descriptions of logic program variables provided by regular tree grammars. Types are used to identify components of terms which can be equated during the programs execution. This information is reflected in form of set constraints in the generic abstract domain called Type(X). The domain allows for abstract compilation of typed logic programs into set logic programs. We demonstrate how the analyzers of groundness and sharing of typed logic programs are obtained by applying the existing (untyped) techniques based on Pos and Sharing to set logic programs. The corresponding analyses in Type(Pos) and Type(Sharing) are more precise than those in Pos and Sharing.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsHerbert Kuchen, Kazunori Ueda
PublisherSpringer
Pages296-310
Number of pages15
ISBN (Print)3540417397, 9783540417392
DOIs
Publication statusPublished - 1 Jan 2001
Externally publishedYes
Event5th International Symposium on Functional and Logic Programming, FLOPS 2001 - Tokyo, Japan
Duration: 7 Mar 20019 Mar 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2024
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Symposium on Functional and Logic Programming, FLOPS 2001
CountryJapan
CityTokyo
Period7/03/019/03/01

Cite this