S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 1993. To appear. Revised version of Imperial College Technical Report DoC 90/20, October 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Approximation Algorithms - Schulz, Shmoys, Williamson (1997) (Correct)
....is at most (1 e)C , and hence within a factor of (1 e) of the optimal congestion. Finally, there also has been a dramatic recent advance for the drilling problem discussed in the introduction. If the time to move the drill is the Euclidean distance between the holes, Arora [8] and Mitchell [9] gave a (1 e) approximation algorithm, for any constant e 0. These examples highlight the importance of strong relaxations in the design of approximation algorithms, and show the power of randomization in constructing good solutions. Other related important algorithmic techniques also have ....
Mitchell, J. S. B. SIAM J. Comput., to appear.
Approximation Algorithms - Andreas Schulz (Correct)
....is at most (1 e)C , and hence within a factor of (1 e) of the optimal congestion. Finally, there has also been a dramatic recent advance for the drilling problem discussed in the introduction. If the time to move the drill is the Euclidean distance between the holes, Arora [8] and Mitchell [9] gave a (1 e) approximation algorithm, for any constant e 0. These examples highlight the importance of strong relaxations in the design of approximation algorithms, and show the power of randomization in constructing good solutions. Other related important algorithmic techniques have also ....
Mitchell, J. S. B. SIAM J. Comput., to appear.
New Foundations for the Geometry of Interaction - Samson Abramsky Radha (1993) (27 citations) Self-citation (Abramsky) (Correct)
No context found.
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 1993. To appear. Revised version of Imperial College Technical Report DoC 90/20, October 1990.
Games and Full Completeness for Multiplicative Linear Logic - Samson Abramsky And (1994) (132 citations) Self-citation (Abramsky) (Correct)
....of game semantics. We note, finally, that the connection between sequential algorithms and negative games confirms our identification of negative games with demand driven computation. This also ties up with the first author s association of and (more precisely of w ) with lazy evaluation [Abr93]. ....
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 1993. To appear. Revised version of Imperial College Technical Report DoC 90/20, October 1990.
Normal Forms and Cut-Free Proofs as Natural Transformations - Girard, Scedrov, Scott (1992) (4 citations) Self-citation (Scedrov) (Correct)
....exercise is just a special case of a theorem that the universal Horn condition considered in Wadler [32] implies dinaturality, for definable functors. This general result, along with the categorical framework for this Horn condition (given by the notion of relator) is discussed in Abramsky, et al. [1]. 3 Gentzen Sequents and Natural Deduction In what follows, we sketch the translation of Gentzen sequents into natural deduction calculi [12, 31, 33, 6, 22] which motivate our presentation. 3.1 Natural Deduction and Sequent Calculus A deduction D of formula A (to be defined below) is a certain ....
....for the logical rules, 5. L i 0; A i C 0; A 1 A 2 C translates to [A 1 A 2 ] 0] A i . C . That is, there is an operation ( projection ) which allows us to go from A 1 A 2 assumption classes to A i assumption classes, i = 1; 2: 6. R 0 A 1 B 0; 1 A B translates as [0] [1] . A B A B . In this case, we form the union of the two assumption classes. 16 7. L 0 A 1;B C 0 , 1;A ) B C translates as follows: suppose [0] D A and [1] B] D 0 C interpret the premisses. Then [0] D A [A ) B] 1] B D 0 C interprets the conclusion, where in ....
[Article contains additional citation context not shown here]
S. Abramsky, J. C. Mitchell, A. Scedrov, P. Wadler. Relators (to appear.)
Normal Forms and Cut-Free Proofs as Natural Transformations - Girard, Scedrov, Scott (1992) (4 citations) Self-citation (Scedrov) (Correct)
....exercise is just a special case of a theorem that the universal Horn condition considered in Wadler [32] implies dinaturality, for definable functors. This general result, along with the categorical framework for this Horn condition (given by the notion of relator) is discussed in Abramsky, et al. [1]. 3 Gentzen Sequents and Natural Deduction In what follows, we sketch the translation of Gentzen sequents into natural deduction calculi [12, 31, 33, 6, 22] which motivate our presentation. 3.1 Natural Deduction and Sequent Calculus A deduction D of formula A (to be defined below) is a certain ....
S. Abramsky, J. C. Mitchell, A. Scedrov, P. Wadler. Relators (to appear.)
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