D. J. Pym and J.A. Harland. A Uniform Proof-Theoretical Investigation of Linear Logic Programming. Journal of Logic and Computation, 4(2):175-207, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Proofs as Computations in Linear Logic - Delzanno, Martelli (2000) (2 citations) (Correct)
....linear logic [15] have been isolated and proved to be ALPLs. Examples are LO [2] Lolli [18] and Forum [26] Furthermore, Lygon [17] has been proved to be the largest fragment of linear Preprint submitted to Elsevier Science 3 March 2000 logic enjoying uniform provability, in the sense stated in [30]. All these languages adhere to the so called proofs as computations interpretation of linear logic, an interpretation in which sequents represent instant con gurations of a computation and where the logical rules describe its evolution. The result of a computation is the computed answer ....
....based on linear logic. In the logic ehhf it is possible to combine the power of higher order logic programming languages like Prolog [28] with the view of proofs as computations via rewriting steps suggested in [26] Taking advantage of previously developed results in proof theory of linear logic [1,14,26,30], we will focus on the problems related to provability in a higher order setting. Speci cally, in the paper we will prove the completeness of provability in ehhf with respect to provability in Forum. This result is inspired by the result of completeness for hereditary Harrop formulas with respect ....
[Article contains additional citation context not shown here]
D. J. Pym and J.A. Harland. A Uniform Proof-Theoretical Investigation of Linear Logic Programming. Journal of Logic and Computation, 4(2):175-207, 1994.
A Linear Logic Specification of Chimera - Bozzano, Delzanno, Martelli (1997) (Correct)
....order to naturally model the typical backtracking based operational semantics of the deductive component. A new powerful logic, namely linear logic [22] seems to fulfil all these requirements. In particular, along with recent research on extensions of logic programming, linear logic programming [2, 28, 26, 24] settled the foundation for new executable specification languages [35] capable of describing modern programming features. In this paper we will employ Forum [35] a presentation of higher order linear logic, as the basic formalism to describe the most important operational aspects of Chimera. In ....
.... , are introduced to recover the expressiveness of CL (i.e. weakening and contraction can be applied over and formulas) As mentioned before it is possible to interpret sequent calculi for LL as operational semantics for logic programming. This proofs as computations view has been studied in [2, 24, 26, 28, 35]. The reader can refer to [1] to have an extensive bibliography and survey on the topic. In the sequel, we will focus on a particular presentation of the LL proof theory based on previous work on higher order logic programming [36] 3.2 Forum: Higher Order Linear Logic Forum [35] can be ....
[Article contains additional citation context not shown here]
J.A. Harland and D. J. Pym. A Uniform Proof-Theoretical Investigation of Linear Logic Programming. Journal of logic and Computation, 4(2):175--207, 1994.
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