| R. Amadio and M. Dam. Toward a modal theory of types for the -calculus. 1996. To appear in the proceedings of FTRTFT'96, Lecture Notes in Computer Science. 19 |
.... language PICT [PRT93] and of object oriented programming [Wal95] it can naturally encode higher order communications [San92] and the calculus [Mil92] There is a variety of proof methods based on bisimulations [MPW92, San96, San92, San95, PS96] rewrite systems [PS95] and model checking [Dam93, AD96] and automated tools for these are emerging [VM94, FMQ95] An example calculus reduction is the following interaction: b(x) P j bhai : Q Gamma Pfa=xg j Q: Here b(x) P is an input which receives something for x along b and continues as the subagent P , and bhai : Q is an output ....
R. Amadio and M. Dam. Toward a modal theory of types for the -calculus. 1996. To appear in the proceedings of FTRTFT'96, Lecture Notes in Computer Science. 19
.... language PICT [PRT93] and of objectoriented programming [Wal95] it can naturally encode higher order communications [San92] and the calculus [Mil92] There is a variety of proof methods based on bisimulations [MPW92, San96, San92, San95, PS96] rewrite systems [PS95] and model checking [Dam93, AD96] and automated tools for these are emerging [VM94, FMQ95] An example calculus reduction is the following interaction: b(x) P j bhai : Q Gamma Pfa=xg j Q: Here b(x) P is an input which receives something for x along b and continues as the subagent P , and bhai : Q is an output which ....
R. Amadio and M. Dam. Toward a modal theory of types for the ß-calculus. 1996. To appear in the proceedings of FTRTFT'96, Lecture Notes in Computer Science.
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