P. Van Hentenryck, A. Cortesi, B. Le Charlier  Home/Search
Context Related
| brown.edu/pub/techreport...cs9352.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Type analyis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types and hence expensive in computation time. The purpose of this paper is to describe a type analysis system for Prolog based on abstract... (Update)
Cited by: More
Regular Trees as an Abstract Domain for Program Specialisation - Gallagher, Peralta (2000) (Correct)
Under consideration for publication in Theory and Practice.. - Tom Schrijvers And (Correct)
Inference of Well-typings for Logic Programs with.. - Bruynooghe.. (2005) (Correct)
Active bibliography (related documents): More All
0.4: Groundness Analysis for Prolog: Implementation and.. - Le Charlier, Van.. (1992) (Correct)
0.2: Cardinality Analysis of Prolog - Braem, Le Charlier, Modart, Van.. (1994) (Correct)
0.2: The Precision of a Simple Structure Analyzer - Lindgren, Mildner (1997) (Correct)
Similar documents based on text: More All
0.4: Generic Abstract Interpretation Algorithms for.. - Englebert, Le.. (1993) (Correct)
0.4: On the Design of an Automatic Tool for Prolog.. - Le Charlier.. (Correct)
0.4: Distinctness and Sharing Domains for Static Analysis of .. - Pollet, Le Charlier.. (2001) (Correct)
Related documents from co-citation: More All
15: Deriving descriptions of possible values of program variables by means of abstra.. (context) - Janssens, Bruynooghe - 1992
11: Fast and Precise Regular Approximations of Logic Programs - Gallagher, de Waal - 1994
8: freeness and linearity for the analysis of finite and rational tree languages (context) - Hill, Za et al. - 2004
BibTeX entry: (Update)
P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of Prolog using type graphs. JLP, 22(3):179-209, 1995. 2 We use some abbreviations and omit the termination ag for types Int, Balance and String. http://citeseer.ist.psu.edu/vanhentenryck93type.html More
@inproceedings{ vanhentenryck94type,
author = "Pascal Van Hentenryck and Agostino Cortesi and Baudouin Le Charlier",
title = "Type Analysis of Prolog Using Type Graphs",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "337-348",
year = "1994",
url = "citeseer.ist.psu.edu/vanhentenryck93type.html" }
Citations (may not include all citations):815 Abstract Interpretation: A Unified Lattice Model for Static .. (context) - Cousot, Cousot - 1977
380 Constraint Satisfaction in Logic Programming (context) - Van Hentenryck - 1989
112 The Art of Prolog: Advanced Programming Techniques (context) - Sterling, Shapiro - 1986
108 A Practical Framework for the Abstract Interpretation of Log.. (context) - Bruynooghe - 1991
105 Compile-Time Derivation of Variable Dependency Using Abstrac.. - Muthukumar, Hermenegildo - 1992
94 A Finite Presentation Theorem for Approximating Logic Progra.. - Heintze, Jaffar - 1990
91 Towards a Theory of Types in Prolog (context) - Mishra - 1984
89 Deriving Description of Possible Values of Program Variables.. (context) - Janssens, Bruynooghe - 1992
81 Solving Large Combinatorial Problems in Logic Programming (context) - Dincbas, Simonis et al. - 1990
77 Combinations of Abstract Domains for Logic Programming - Cortesi, Le Charlier et al. - 1994
54 Experimental Evaluation of a Generic Abstract Interpretation.. (context) - Le Charlier, Van Hentenryck - 1992
36 An Instance of Abstract Interpretation: Integrating Type and.. (context) - Bruynooghe, Janssens - 1988
33 Notes for a Tutorial on Abstract Interpretation of Logic Pro.. (context) - Marriott, Sondergaard - 1989
29 Practical Aspects of Set-based Analysis - Heintze - 1992
29 Multiple Specialization using Minimal-Function Graph Semanti.. (context) - Winsborough - 1992
21 Analysis of Shared Data Structures for Compile-Time Garbage .. (context) - Mulkers, Winsborough et al. - 1990
20 Logic Programs as Types for Logic Programs (context) - Fruehwirth, Shapiro et al. - 1991
14 Generic Abstract Interpretation Algorithms for Prolog: Two O.. - Englebert, Le Charlier et al. - 1993
14 A Universal Top-Down Fixpoint Algorithm - Le Charlier, Van Hentenryck - 1992
8 Polymorphic Types and Widening Operators (context) - Monsuez - 1993
8 Deriving Termination Proofs for Logic Programs Using Abstrac.. (context) - Verschaetse, De Schreye - 1991
5 Analysing Success Patterns of Logic Programs by Abstract Hyb.. (context) - Kanamori, Kawamura - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (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