Download:
|
by Michael Codish, Bart Demoen
http://www.cs.kuleuven.ac.be/~bmd/pubs/polytypes.ps
Add To MetaCart
Abstract:
Abstract. This paper illustrates the application of abstract compilation using multiple incarnations of the domain Prop in deriving type dependencies for logic programs. We illustrate how dependencies can be derived in the presence of both monomorphic and polymorphic type information. Type dependencies generalize the recently proposed notion of directional types as well as the more common notion of groundness dependencies. Directional types have proven useful in a number of applications such as in proving termination. These applications, however, are based on type declarations. The main contribution of this paper is in the simplicity in which non-trivial type dependencies are inferred using abstract compilation and by associating each type with an incarnation of Prop. We illustrate the use of a semantics for open logic programs in maintaining space efficient analyses. Time efficiency is also maintained due to approximation of the type domain in a boolean lattice calling on results of universal algebra. 1
Citations
|
1654
|
Foundations of Logic Programming
– Lloyd
- 1984
|
|
1266
|
Abstract interpretation : a unified lattice model for the static analysis of programs by construction or approximation of fixpoints
– Cousot, Cousot
- 1977
|
|
70
|
A general framework for semanticsbased bottom-up abstract interpretation of logic programs
– Barbuti, Giacobazzi, et al.
- 1993
|
|
70
|
Global Flow Analysis as a Practical Compilation Tool
– Hermenegildo, Warren, et al.
- 1992
|
|
63
|
Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis
– Cortesi, Filè, et al.
- 1991
|
|
57
|
Bottom-up abstract interpretation of logic programs
– Codish, Dams, et al.
- 1994
|
|
53
|
Compositional analysis of modular logic programs
– Codish, Debray, et al.
- 1993
|
|
51
|
A framework of directionality for proving termination of logic programs
– Bronsard, Lakshman, et al.
- 1992
|
|
38
|
Suspension Analysis for Concurrent Logic Programs
– Codish, Falaschi, et al.
- 1991
|
|
37
|
Directional type checking of logic programs
– Aiken, Lakshman
- 1994
|
|
36
|
Analysing logic programs using "prop"-ositional logic programs and a magic wand
– Codish, Demoen
- 1995
|
|
30
|
Semantics-based dataflow analysis of logic programs
– Marriott, Sondergaard
- 1989
|
|
28
|
Polymorphically typed logic programs
– Yardeni, Fruhwirth, et al.
- 1991
|
|
26
|
Contributions to the Semantics of Open Logic Programs
– Bossi, Gabbrielli, et al.
- 1992
|
|
25
|
Efficient bottom-up abstract interpretation of Prolog by means of constraint solving over symbolic finite domains
– Corsini, Musumbu, et al.
- 1993
|
|
24
|
A type inference system for Prolog
– Xu, Warren
- 1988
|
|
19
|
A Bottom-up Polymorphic Type Inference in Logic Programming
– Barbuti, Giacobazzi
- 1992
|
|
17
|
Groundness analysis for Prolog: implementation and evaluation of the domain Prop
– Charlier, Hentenryck
- 1993
|
|
17
|
Integrating modes and subtypes into a Prolog type-checker
– Rouzaud, Nguyen-Phuong
- 1992
|
|
11
|
Modular logic programs over finite domains
– Gabbrielli, Giacobazzi, et al.
- 1993
|
|
7
|
Type Inference by Program Transformation and Partial Evaluation
– Fruhwirth
- 1989
|
|
3
|
A directional type system for Prolog: Unifying notions of types and directionality
– Lakshman, Reddy, et al.
- 1994
|
|
1
|
Proving implications by algebraic approximation
– Codish, Mashevitzky
- 1994
|
|
1
|
Type Systems for Logic Programs Based on Abstract Interpretation
– Yardeni
- 1992
|
