Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements
نویسندگان
چکیده
منابع مشابه
Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements
interpretation [Cousot and Cousot 1977, 1979] is a well-establised theory for program analysis specification, which is gradually gaining ground also as a Article No. IC982724 153 0890-5401 98 25.00 Copyright 1998 by Academic Press All rights of reproduction in any form reserved. formal basis for the comparative study and the design of programming language semantics at different levels of abstra...
متن کاملUniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Re nements
The notion of uniform closure operator is introduced, and it is shown how this concept surfaces in two diierent areas of application of abstract interpretation, notably in semantics design for logic programs and in the theory of abstract domain reenements. In logic programming , uniform closures permit to generalize, from an order-theoretic perspective, the standard hierarchy of declarative sem...
متن کاملFunctorial Semantics for Higher-order Logic Dissertation Abstract
This dissertation investigates what may be termed the model theory of higher-order logic using the methods of category theory. Of course, there is no such eld of logic as \higher-order model theory," and so our rst concern in chapter I will be to specify the basic objects under investigation, viz. higher-order logical theories and their models. This is a fairly straightforward generalization|in...
متن کاملComplementing Logic Program Semantics
We consider abstract interpretation, and in particular the basic operators of reduced product and complementation of abstract domains, as a tool to systematically derive denotational semantics by composition and decomposition. Reduced product allows to perform the logical conjunction of semantics, while complementation characterizes what is left from a semantics when the information concerning ...
متن کاملClassical Logic, Continuation Semantics and Abstract Machines
One of the goals of this paper is to demonstrate that denotational semantics is useful for operational issues like implementation of functional languages by abstract machines. This is exempliied in a tutorial way by studying the case of extensional untyped call-by-name-calculus with Felleisen's control operator C. We derive the transition rules for an abstract machine from a continuation semant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1998
ISSN: 0890-5401
DOI: 10.1006/inco.1998.2724