Static analysis of Linear Logic programming

1997 ◽  
Vol 15 (4) ◽  
pp. 449-481 ◽  
Author(s):  
Jean -Marc Andreoli ◽  
Remo Pareschi ◽  
Tiziana Castagnetti
Keyword(s):  
Logic Programming ◽  
Static Analysis ◽  
Linear Logic

scholarly journals Distributed concurrent linear logic programming

1999 ◽  
Vol 227 (1-2) ◽  
pp. 185-220 ◽  
Author(s):  
Naoki Kobayashi ◽  
Toshihiro Shimizu ◽  
Akinori Yonezawa
Keyword(s):  
Logic Programming ◽  
Linear Logic

A specification logic for concurrent object-oriented programming

1999 ◽  
Vol 9 (3) ◽  
pp. 253-286 ◽  
Author(s):  
G. DELZANNO ◽  
D. GALMICHE ◽  
M. MARTELLI
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Linear Logic ◽  
Operational Semantics ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Higher Order Logic ◽  
Specification Logic ◽  
Theoretic Characterization

This paper focuses on the use of linear logic as a specification language for the operational semantics of advanced concepts of programming such as concurrency and object-orientation. Our approach is based on a refinement of linear logic sequent calculi based on the proof-theoretic characterization of logic programming. A well-founded combination of higher-order logic programming and linear logic will be used to give an accurate encoding of the traditional features of concurrent object-oriented programming languages, whose corner-stone is the notion of encapsulation.

scholarly journals Logic Programming in a Fragment of Intuitionistic Linear Logic

1994 ◽  
Vol 110 (2) ◽  
pp. 327-365 ◽  
Author(s):  
J.S. Hodas ◽  
D. Miller
Keyword(s):  
Logic Programming ◽  
Linear Logic ◽  
Intuitionistic Linear Logic

scholarly journals Optimality in goal-dependent analysis of Sharing

2009 ◽  
Vol 9 (05) ◽  
pp. 617-689 ◽  
Author(s):  
GIANLUCA AMATO ◽  
FRANCESCA SCOZZARI
Keyword(s):  
Logic Programming ◽  
Static Analysis ◽  
Abstract Interpretation ◽  
Logic Programs ◽  
Semantic Operators

AbstractWe face the problems of correctness, optimality, and precision for the static analysis of logic programs, using the theory of abstract interpretation. We propose a framework with a denotational, goal-dependent semantics equipped with two unification operators for forward unification (calling a procedure) and backward unification (returning from a procedure). The latter is implemented through a matching operation. Our proposal clarifies and unifies many different frameworks and ideas on static analysis of logic programming in a single, formal setting. On the abstract side, we focus on the domainsharingby Jacobs and Langen (The Journal of Logic Programming, 1992, vol. 13, nos. 2–3, pp. 291–314) and provide the best correct approximation of all the primitive semantic operators, namely, projection, renaming, and forward and backward unifications. We show that the abstract unification operators are strictly more precise than those in the literature defined over the same abstract domain. In some cases, our operators are more precise than those developed for more complex domains involving linearity and freeness.

A Uniform Proof-theoretic Investigation of Linear Logic Programming

1994 ◽  
Vol 4 (2) ◽  
pp. 175-207 ◽  
Author(s):  
DAVID J. PYM ◽  
JAMES A. HARLAND
Keyword(s):  
Logic Programming ◽  
Linear Logic

scholarly journals Linear Logic Programming for Narrative Generation

2013 ◽  
pp. 427-432 ◽  
Author(s):  
Chris Martens ◽  
Anne-Gwenn Bosser ◽  
João F. Ferreira ◽  
Marc Cavazza
Keyword(s):  
Logic Programming ◽  
Linear Logic ◽  
Narrative Generation
Sign in / Sign up

Export Citation Format

Share Document