General structural operational semantics through categorical logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 166-177

  Staton, Sam ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CATEGORICAL LOGIC; FIRST ORDERS; LOGIC IN COMPUTER SCIENCE;

ARSENIC COMPOUNDS; BIOMINERALIZATION; COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; INFORMATION THEORY; LINGUISTICS; MATHEMATICAL TECHNIQUES; QUERY LANGUAGES; SEMANTICS;

CALCULATIONS;

EID: 51549103321     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.43     Document Type: Conference Paper

References (45)

1. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In POPL'01, pages 104-115, 2001.
2. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Inform. and Comput., 148(1):1-70, 1999.
3. L. Aceto, W. Fokkink, and F. Vaandrager. Structural operational semantics. In Bergstra, Ponse, and Smolka, editors, Handbook of Process Algebra. Elsevier, 2001.
4. P. Aczel and N. Mendler. A final coalgebra theorem. In CTCS'89, volume 389 of Lecture Notes in Comput. Sci., pages 357-365. Springer, 1989.
5. T. Altenkirch, N. Ghani, P. Hancock, C. McBride, and P. Morris. Indexed containers. Available online, 2006.
6. S. Awodey and A. Bauer. Propositions as [types]. J. Log. Comput., 14(4):447-471, 2004.
7. J. Bengtson and J. Parrow. Formalising the pi-calculus using nominal logic. In FoSSaCS'07, pages 63-77, 2007.
8. S. Briais and U. Nestmann. Open bisimulation, revisited. Theoret. Comput. Sci., 386:236-271, 2007.
9. A. Corradini, R. Heckel, and U. Montanari. Compositional SOS and beyond: a coalgebraic view of open systems. Theoret. Comput. Sci., 280:163-192, 2002.
10. B. Day. On closed categories of functors. In Reports of the Midwest Category Seminar, IV, volume 137 of Lecture Notes in Math., pages 1-38. Springer, 1970.
11. R. de Simone. Higher-level synchronising devices in Meije-SCCS. Theoret. Comput. Sci., 37:245-267, 1985.
12. M. P. Fiore and S. Staton. A congruence rule format for name-passing process calculi from mathematical structural operational semantics. In LICS'06, pages 49-58, 2006.
13. M. P. Fiore, G. D. Plotkin, and D. Turi. Abstract syntax and variable binding (extended abstract). In LICS'99, 1999.
14. W. Fokkink. The tyft/tyxt format reduces to tree rules. In TACS'94, pages 440-453, 1994.
15. W. J. Fokkink and C. Verhoef. A conservative look at operational semantics with variable binding. Inform. and Comput., 146(1):24-54, 1998.
16. M. J. Gabbay. The π-calculus in FM. In Thirty Five Years of Automating Mathematics. Kluwer, 2003.
17. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2001.
18. N. Gambino and M. Hyland. Wellfounded trees and dependent polynomial functors. In TYPES'03, 2003.
19. N. Ghani, K. Yemane, and B. Victor. Relationally staged computations in calculi of mobile processes. In CMCS'04, pages 105-120, 2004.
20. J. F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Inform. and Cornput., 100(2):202-260, 1992.
21. F. Honsell, M. Miculan, and I. Scagnetto. π-calculus in (co)inductive-type theory. Theoret. Comput. Sci., 253:239-285, 2000.
22. M. Hyland, G. D. Plotkin, and J. Power. Combining effects: Sum and tensor. Theoret. Comput. Sci., 357:70-99, 2006.
23. P. T. Johnstone. Sketches of an elephant: A Topos Theory Compendium. Oxford University Press, 2003.
24. A. Joyal and I. Moerdijk. Algebraic set theory. Cambridge University Press, 1995.
25. A. Joyal and I. Moerdijk. A completeness theorem for open maps. Ann. Pure Appl. Logic. 70(1):51-86, 1994.
26. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Inform. and Comput., 127(2):164-185, 1996.
27. G. M. Kelly. A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on. Bull. Austral. Math. Soc., 22:1-83, 1980.
28. B. Klin. Bialgebraic methods in structural operational semantics. In SOS'06, pages 33-43, 2006.
29. M. E. Maietti. Modular correspondence between dependent type theories and categorical universes including pretopoi and topoi. Math. Structures Comput. Sci., 15(6), 2005.
30. P. Martin-Löf. Intuitionistic type theory. Bibliopolis, Napoli, 1984.
31. M. Miculan and K. Yemane. A unifying model of variables and names. In FoSSaCS'05, pages 170-186, 2005.
32. C. A. Middelburg. Variable binding operators in transition system specifications. J. Log. Algebr. Program., 47:15-45. 2001.
33. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
34. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I and II. Inform. and Comput., 100(1):1-77, 1992.
35. I. Moerdijk and E. Palmgren. Wellfounded trees in categories. Ann. Pure Appl. Logic, 104:189-218, 2000.
36. M. R. Mousavi, M. A. Reniers, and J. Groote. SOS formats and meta-theory. Theoret. Comput. Sci., 373:238-272, 2007.
37. E. Palmgren. A categorical version of the Brouwer-Heyting-Kolmogorov interpretation. Math. Structures Comput. Sci., 14:57-72, 2004.
38. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI-FN-19, Aarhus, 1981.
39. D. Sangiorgi. A theory of bisimulation for the pi-calculus. Acta Inform., 33(1):69-97, 1996.
40. D. Sangiorgi and D. Walker. The π-calculus: a theory of mobile processes. Cambridge University Press, 2001.
41. S. Staton. Name-Passing Process Calculi: Operational Models and Structural Operational Semantics. PhD thesis, Cambridge, 2007. Technical Report UCAM-CL-TR-688.
42. R. Street. The formal theory of monads. J. Pure Appl. Algebra, 2:149-168, 1972.
43. A. Tiu and D. Miller. A proof search specification of the 7r-calculus. In FGUC'04, pages 79-101, 2004.
44. D. Turi and G. D. Plotkin. Towards a mathematical operational semantics. In LICS'97, pages 280-291, 1997.
45. A. Ziegler, D. Miller, and C. Palamidessi. A congruence format for name-passing calculi. In Proc. SOS'05.