See this document in CiteSeerX!

Analysis of Polymorphically Typed Logic Programs Using ACI-Unification (2001)  (Make Corrections)  (1 citation)
Jan-Georg Smaus
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
wailoa.informatik....par01_camera.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wailoa.informat...i?ACTION=SEARCH (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . Analysis of (partial) groundness is an important application of abstract interpretation. There are several proposals for improving the precision of such an analysis by exploiting type information, including our own work [15], where we had shown how the information present in the type declarations of a program can be used to characterise the degree of instantiation of a term in a precise but finite way. This approach worked for polymorphically typed logic programs. Here, we recast this... (Update)

Similar documents based on text:   More   All
0.1:   Subject Reduction of Logic Programs as Proof-Theoretic Property - Deransart, Smaus (2002)   (Correct)
0.1:   Mode Analysis Domains for Typed Logic Programs (Extended.. - Smaus, Hill, King (2000)   (Correct)
0.1:   Mode Analysis Domains for Typed Logic Programs - Smaus, Hill, King (2000)   (Correct)

Related documents from co-citation:   More   All
2:   Type dependencies for logic programs using aciunification - Codish, Lagoon - 1996

BibTeX entry:   (Update)

J.-G. Smaus. Analysis of polymorphically typed logic programs using ACIunification. Available via CoRR: http://arXiv.org/archive/cs/intro.html, 2001. http://citeseer.ist.psu.edu/smaus01analysis.html   More

@article{ smaus01analysis,
    author = "Jan-Georg Smaus",
    title = "Analysis of Polymorphically Typed Logic Programs Using {ACI}-Unification",
    journal = "Lecture Notes in Computer Science",
    volume = "2250",
    pages = "282--??",
    year = "2001",
    url = "citeseer.ist.psu.edu/smaus01analysis.html" }
Citations (may not include all citations):
1838   Foundations of Logic Programming (context) - Lloyd - 1987
815   Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
179   The Godel Programming Language (context) - Hill, Lloyd - 1994
134   Unification theory - Baader, Schulz - 1998
89   Deriving descriptions of possible values of program variable.. (context) - Janssens, Bruynooghe - 1992
46   Types in Logic Programming (context) - Pfenning - 1992
36   Deriving polymorphic type dependencies for logic programs us.. - Codish, Demoen - 1994
26   cient purely declarative logic programming language (context) - Somogyi, Henderson et al. - 1996
19   Type dependencies for logic programs using ACIunification - Codish, Lagoon - 2000
19   Type dependencies for logic programs using ACIunification - Codish, Lagoon - 1996
13   Mode analysis domains for typed logic programs - Smaus, Hill et al. - 2000
8   Analyzing dependencies in typed logic programs - Bruynooghe, Vanhoof et al. - 2001
5   Garca de la Banda (context) - Demoen - 1999
1   AVL tree insertion: A benchmark program biased towards Prolo.. (context) - van Emden - 1981
1   Analysis of polymorphically typed logic programs using ACIun.. - Smaus - 2001

Documents on the same site (http://wailoa.informatik.uni-freiburg.de/cgi/publications/search.cgi?ACTION=SEARCH):
A Formal Data-Model of the CORBA Security Service - Basin, Rittinger, Viganò (2001)   (Correct)
Testing Distributed Component Based Systems Using UML/OCL - Brucker, Wolff (2001)   (Correct)

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