About permutation algebras, (pre)sheaves and named sets

Higher-Order and Symbolic Computation

Volumn 19, Issue 2-3, 2006, Pages 283-304

  Gadducci, Fabio ^a   Miculan, Marino ^b   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Named sets; Nominal calculi; Permutation algebras; Presheaf categories

Indexed keywords

DIFFERENTIATION (CALCULUS); MATHEMATICAL MODELS; NUMERICAL METHODS; SET THEORY;

NAMED SET; NOMINAL CALCULI; PERMUTATION ALGEBRAS; PRESHEAF CATEGORY;

ALGEBRA;

EID: 33747220068     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10990-006-8749-3     Document Type: Article

References (24)

1. Bucalo, A., Hofmann, M., Honsell, F., Miculan, M., Scagnetto, I.: Consistency of the theory of contexts. J. Funct. Progr. 16, 327-395 (2006)
2. Corradini, A., Heckel, R., Montanari, U.: Compositional SOS and beyond: A coalgebraic view of open systems. Theor. Comp. Sci. 280, 163-192 (2002)
3. Ferrari, G., Montanari, U., Pistore, M.: Minimizing transition systems for name passing calculi: A coalgebraic formulation. In: Nielsen. M., Engberg, U. (eds.), Foundations of Software and Computer Science, vol. 2303, Lect. Notes in Comp. Sci., Springer, pp. 129-143 (2002)
4. Fiore, M.: Notes on combinatorial functors (draft). Unpublished manuscript available from the author's web page (2001)
5. Fiore, M., Moggi, E., Sangiorgi, D.: A fully abstract model for the π-calculus. In: Clarke, E. (ed.), Logic in Computer Science, IEEE, pp. 43-54 (1996)
6. Fiore, M., Staton, S.: Comparing operational models of name-passing process calculi. In: Adámek, J., Milius, S. (eds.), Coalgebraic Methods in Computer Science, vol. 106, Electr. Notes in Theor. Comp. Sci., Elsevier Science (2004)
7. Fiore, M., Turi, D.: Semantics of name and value passing. In: Maierson, H. (ed.), Logic in Computer Science. IEEE, pp. 93-104 (2001)
8. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13, 341-363 (2002)
9. Gadducci, F., Miculan, M., Montanari, U.: Some characterization results for permutation algebras. In: Honsell, F., Lenisa, M., Miculan, M. (eds.), Computational Metamodels, Workshop of the COMET A Project, vol. 104, Electr. Notes in Theor. Comp. Sci., Elsevier Science (2004)
10. Hofmann, M. : Semantical analysis of higher-order abstract syntax. In : Longo, G. (ed.), Logic in Computer Science, IEEE, pp. 204-213 (1999)
11. Honsell, F., Miculan, M., Scagnetto, I.: An axiomatic approach to metareasoning on nominal algebras in HOAS. In: Orejas, F., Spirakis, P., van Leeuwen, J. (eds.), Automata, Languages and Programming, vol. 2076, Lect. Notes in Comp. Sci., Springer, pp. 963-978 (2001)
12. Kelley, J.: General topology. Springer (1975)
13. MacLane, S.: Categories for the working mathematician. Springer (1971)
14. McLane, S., Moerdijk, I.: Sheaves in geometry and logic: A first introduction to topos theory. Springer (1994)
15. Miculan, M., Yemane, K.: A unifying model of variables and names. In: Sassone, V. (ed.), Foundations of Software Science and Computational Structures, vol. 3441, Lect. Notes in Comp. Sci., Springer, pp. 170-186 (2005)
16. Moggi, E.: Notions of computation and monads. Information and Computation 93, 55-92 (1991)
17. Montanari, U., Pistore, M.: Structured coalgebras and minimal HD-automata for the π-calculus. Theor. Comp. Sci. 340, 539-576.
18. Montanari, U., Pistore, M.: π-Calculus, structured coalgebras, and minimal HD-automata. In: Nielsen, M., Rovan, B. (eds.), Mathematical Foundations of Computer Science, vol. 1893, Lect. Notes in Comp. Sci., Springer, pp. 569-578 (2000)
19. O'Hearn, P., Tennent, R.: Parametricity and local variables. In: O'Hearn, P., Tennent, R. (eds.), Algol-like Languages, Birkhauser, pp. 109-164 (1997)
20. Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation 186, 165-193 (2003)
21. Plotkin, G., Power, J.: Semantics for algebraic operations. In: Brookes, S., Mislove, M. (eds.), Mathematical Foundations of Programming Semantics, vol. 45, Electr. Notes in Theor. Comp. Sci., Elsevier Science (2001)
22. Rutten, J.: Universal coalgebra: A theory of systems. Theor. Comp. Sci. 249, 3-80 (2000)
23. Stark, I.: Names and higher-order function. Ph.D. thesis, University of Cambridge, Cambridge Computer Laboratory (1994)
24. Stark, I.: A fully abstract domain model for the π-calculus. In: Clarke, E. (ed.), Logic in Computer Science. IEEE, pp. 36-42 (1996)