Delzanno, G., & Martelli, M. (2001). Proofs as Computations in Linear Logic. Theoretical computer science, 258(1-2), 269-297.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....language, both the veri cation and validation of architecture properties are possible. 3. After being veri ed and validated, the architecture speci cation is translated into ProlAg, in order to be used in the prototype. 5. 2 The linear logic language E hhf The linear logic language E hhf [23, 24] can be used to specify agent architectures, including their data structures, and rules that model their execution engines. Speci cations in E hhf are executable, so it is possible to directly interpret a given speci cation. In this way it is possible to provide a better understanding of the ....

G. Delzanno and M. Martelli. Proofs as Computations in Linear Logic. Theoretical Computer Science. To appear.

....YahOO, has been designed and implemented in the higher order language Prolog, adding a form of inheritance which could be handled at the moment of the objects creation. In the paper, the above mentioned features are reformulated in the setting of a more general framework based on Linear Logic [6], suitable to describe operational aspects of programming languages. Differently from the authors previous proposal [5] inheritance is reconsidered by defining, in logical terms, a delegation based mechanism with characteristics similar to the ones presented in [1, 7] Furthermore, the ....

....considered as rewriting rules which allow to proceed in the proof of the considered goal. Further extensions of the language yielded a more general framework, E hhf , in which many aspects of operational semantics of programming constructs seem to find a well defined proof theoretical counterpart [6]. Such work can be considered as an attempt of isolating within the presentation of Linear Logic given by Forum [14] a core of formulas suitable to express extensions of standard Logic Programming while maintaining a simple presentation of the underlying logic. Thus, the set of rules of E hhf has ....

[Article contains additional citation context not shown here]

G. Delzanno and M. Martelli. Proofs as Computations in Linear Logic, submitted to APPIA-PRODEGULP 96, 1996.

.... The relation between Rewriting, Petri Nets and Linear Logic has been investigated in previous works like [11, 18, 36, 34] Our point of view is based on the proof as computation metaphor proposed in [4, 3, 38] our connection with models for concurrency is inspired to works in this eld like [11, 13, 27, 37, 38]. As an example, in [11] Cervesato shows how to encode Petri Nets in di erent fragments of linear logic like LO, Lolli [24] and Forum [38] exploiting the di erent features of these languages. Algorithmic aspects for veri cation of properties of the resulting linear logic speci cations are not ....

Delzanno, G., & Martelli, M. (2001). Proofs as Computations in Linear Logic. Theoretical computer science, 258(1-2), 269-297.

....12] provides a macro and micro level development method for agent applications, as well as tools and languages which support the development steps. In our methodology the more formal and abstract specification of the MAS can be given using the executable linear logic programming language E hhf [4], which provides constructs for concurrency and state updating. Even if E hhf has been successfully adopted as a specification language both at the inter agent (macro) 1] and intra agent (micro) 2] levels of abstraction, its use requires a profound knowledge of the linear logic [7] syntax and ....

G. Delzanno and M. Martelli. Proofs as Computations in Linear Logic. Theoretical Computer Science. To appear.

....to provide a library of agent architectures, implemented in a logic programming language, that can be picked up and used for the implementation of the prototype. In our method the more formal and abstract specifications can be given using the executable linear logic programming language E hhf [3], which provides constructs for concurrency and state updating. Even if E hhf has been successfully adopted as specification language for both microlevel [2] and macro level [1] modeling, its use requires a deep knowledge in the linear logic syntax and semantics [4] and the language is definitely ....

G. Delzanno and M. Martelli. Proofs as Computations in Linear Logic. Theoretical Computer Science, 1999. To appear.

....and Pareschi 1991; Hodas and Miller 1994; Miller 1996) In a sense, Forum (Miller 1996) can be viewed as an intermediate refinement step to achieve a readable form of linear logic specifications. Our final refinement step is to consider a specific sublanguage, namely E hhf (Delzanno 1997; Delzanno and Martelli 1998), by which we emphasize the view of proofs as statebased computations (essential in the object oriented paradigm) The considered restriction on the form of linear logic formulae allows us to define executable linear logic programs with a semantics dictated by the specialized proof system of E ....

....with such a specification logic naturally arises. To answer it, in the following section we restrict ourselves to a special fragment of Forum. 4. Towards Executable Specifications In this section we describe the main features of the logic of extended hereditary Harrop formulae (Delzanno 1997; Delzanno and Martelli 1998), a fragment of Forum that can be used as an executable specification language. Delzanno et al..l 10 Gamma; D Gamma Sigma A initial (A1 . ....

[Article contains additional citation context not shown here]

G. Delzanno and M. Martelli. Proofs as Computations in Linear Logic. Technical Report DISI-TR-98-12, DISI, Dipartimento di Informatica, Universit`a di Genova, 1998.

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