Name
Abstract | ||
|---|---|---|
Linear Logic is gaining momentum in computer science because it offers a unified framework and a common vocabulary for studying and analyzing different aspects of programming and computation. We focus here on models where computation is identified with proof search in the sequent system of Linear Logic. A proof normalization procedure, called “focusing”, has been proposed to make the problem of proof search tractable. Correspondingly, there is a normalization procedure mapping formulae of Linear Logic into a syntactic fragment of that logic, called, where the focusing normalization for proofs can be most conveniently expressed. In this paper, we propose to push this compilation/normalization process further, by applying abstract interpretation and partial evaluation techniques to (focused) proofs in. These techniques provide information concerning the evolution of the computational resources (formulae) during the execution (proof construction). The practical outcome that we expect from this theoretical effort is the definition of a general tool for statically analyzing and reasoning about the runtime behavior of programs in frameworks where computations can be accounted for in terms of proof search in Linear Logic. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BF03037301 | New Generation Comput. |
Keywords | Field | DocType |
Linear Logic,Sequent Systems,Proof Search,Static Analysis,Abstract Interpretation,Partial Evaluation | Programming language,Geometry of interaction,Computer science,Proof calculus,Structural proof theory,Proof theory,Linear temporal logic,Bunched logic,Theoretical computer science,Linear logic,Proof complexity | Journal |
Volume | Issue | ISSN |
15 | 4 | 0288-3635 |
Citations | PageRank | References |
9 | 0.60 | 32 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Marc Andreoli | 1 | 764 | 72.75 |
| Remo Pareschi | 2 | 601 | 162.52 |
| Tiziana Castagnetti | 3 | 18 | 1.58 |