Proofs as Processes Formulae-as-Types Correspondence Combinatory Logic and Lambda Calculus Computational Logic
(CiteSeer) Article by Engberg and Winskel showing that Petri nets provide a class of model for linear logic that is complete.
Top: Science: Math: Logic and Foundations: Computational Logic: Combinatory Logic and Lambda Calculus: Formulae-as-Types Correspondence: Proofs as Processes
- The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes (1998) - (CiteSeer) This PhD thesis proposes the fusion calculus as a combinatory logic and lambda calculus simplified pi-calculus with many formal advantages.
- A Non Functional Calculus: Linear Logic and Concurrency (2000) - (CiteSeer) This paper proposes the *-calculus as an proofs as processes formulae-as-types correspondence approach that unifies Abramsky\\'s proofs-as-processes approach with Boudol proofs as processes formulae-as-types correspondence and Berry's Chemical Abstract Machine approach.
- Completeness Results for Linear Logic on Petri Nets (1993) - (CiteSeer) Article by Engberg and Winskel showing that combinatory logic and combinatory logic and lambda calculus lambda calculus Petri nets provide a class of model for combinatory combinatory logic and lambda calculus logic and lambda calculus linear logic that is complete.
- Pi-Calculus and Linear Logic (1992) - (CiteSeer) Article by Bellin and Scott showing how classical linear logic may be interpreted in the pi calculus, thus supporting Abramksy\'s `Proofs as Processes\' thesis.
MySQL - Cache Direct
