W e present a form al theory of abstract interpretation based on a new category theoretic form alism . This form alism allows one to derive a collecting semantics which preserves continuity of lifted functions and for which the lifting functor is itself continuous. The theory of abstract interpretation is then presented as an approxim ation of this collecting semantics. The use of categories rather than com plete partial orders elim inates the need for introducing tw o distinct partial orders and for introducing any closure operation on the allowable elem ents, as is necessary with powerdomains. Furthermore, our construction can be applied to any situation for which the underlying domains are com plete partial orders, sice the domains are not further restricted in any way. This form alism can be applied to first order languages. keywords and phrases: abstract interpretation, category theory, complete partial orders, denotational semantics, indeterm inate functions, quasi-functor, strictness.
[1]
George Gratzer,et al.
Universal Algebra
,
1979
.
[2]
Alan Mycroft,et al.
A Polymorphic Type System for Prolog
,
1984,
Logic Programming Workshop.
[3]
Robert M. Keller,et al.
Static inference of properties of applicative programs
,
1984,
POPL.
[4]
Krzysztof R. Apt,et al.
A Cook's Tour of Countable Nondeterminism
,
1981,
ICALP.
[5]
Michael B. Smyth,et al.
The Largest Cartesian Closed Category of Domains
,
1983,
Theor. Comput. Sci..
[6]
Patrick Cousot,et al.
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
,
1977,
POPL.