Laird, J., A deconstruction of non-deterministic classical cut elimination, TLCA'01, LNCS 2044, 268--282, Springer, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)
.... extension of the present proof method based on reducibility candidates induced by double negation closure, cf. 22] 67] extends the proof method in the present paper to obtain strong normalisation of first order state, combining it with recent proof techniques of termination in Classical Logic [43, 62]. These results can further be augmented to proving liveness in the presence of non termination and nondeterminism by mixing type structures [11] This incremental nature of type structure also leads to significant applications of SN to semantics of processes. For example, 69] reports a new ....
....useful as a meta language for logical systems with e.g. non deterministic cut elimination procedures. For stateful computation, 67] has verified that our proof method is also applicable in SN for first order stateful processes combining the proof method established in Classical Logics framework [43, 62]. The basic idea is first replacing replication with recursion [32] then applying the term rewriting technique directly using the extended reduction. This allows to carry over the SN type discipline and related results in imperative computation involving non trivial procedure calls in [35] For ....
Laird, J., A deconstruction of non-deterministic classical cut elimination, TLCA'01, LNCS 2044, 268--282, Springer, 2001.
Sequentiality vs. Concurrency in Games and Logic - Abramsky (2001) (Correct)
....is typi ed by systems such as Girard s LC [Gir91] the systems LKT and LKQ of Danos, Joinet and Schellinx [DJS96] and the calculus of Parigot [Par92] 2. Study the full, untamed non con uent calculus, and nd the computational structure which is there. This is typi ed by work such as [BB96, Urb00, Lai01]. In a similar fashion, there seem to be two possibilities for studying Linear Logic proofs. 1. Taming the syntax, in such a way as to control the scheduling, and to avoid the bad combination of polarities which led to the problem with composition. Most game semantics applies to the ....
J. D. Laird. A deconstruction of non-deterministic classical cut-elimination. To appear in the Proceedings of TLCA
Sequentiality vs. Concurrency in Games and Logic - Abramsky (2001) (Correct)
....is typi ed by systems such as Girard s LC [Gir91] the systems LKT and LKQ of Danos, Joinet and Schellinx [DJS96] and the calculus of Parigot [Par92] 2. Study the full, untamed non con uent calculus, and nd the computational structure which is there. This is typi ed by work such as [BB96, Urb00, Lai01]. In a similar fashion, there seem to be two possibilities for studying Linear Logic proofs. 1. Taming the syntax, in such a way as to control the scheduling, and to avoid the bad combination of polarities which led to the problem with composition. Most game semantics applies to the ....
J. D. Laird. A deconstruction of non-deterministic classical cut-elimination. To appear in the Proceedings of TLCA
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