A Polymorphic Groundness Analysis of Logic Programs

Simple item page
dc.creatorLu, Lunjin
dc.date1998-10-31
dc.date.accessioned2026-07-07T03:23:46Z
dc.date.available2026-07-07T03:23:46Z
dc.descriptionA polymorphic analysis is an analysis whose input and output contain parameters which serve as placeholders for information that is unknown before analysis but provided after analysis. In this paper, we present a polymorphic groundness analysis that infers parameterised groundness descriptions of the variables of interest at a program point. The polymorphic groundness analysis is designed by replacing two primitive operators used in a monomorphic groundness analysis and is shown to be as precise as the monomorphic groundness analysis for any possible values for mode parameters. Experimental results of a prototype implementation of the polymorphic groundness analysis are given.
dc.description30 pages
dc.identifierhttps://arxiv.org/abs/cs/9811001
dc.identifierhttp://arxiv.org/abs/cs/9811001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33074
dc.subjectProgramming Languages
dc.subjectF.3.2;D.3.2
dc.titleA Polymorphic Groundness Analysis of Logic Programs
dc.typetext

Files

Collections

arXiv