Some characterization results for permutation algebras

Electronic Notes in Theoretical Computer Science

Volumn 104, Issue , 2004, Pages 129-147

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

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Categorical and algebraic metamodels of languages; Name passing calculi; Semantics of programming languages

Indexed keywords

CHARACTERIZATION; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DATA STORAGE EQUIPMENT; SEMANTICS;

CATEGORICAL AND ALGEBRAIC METAMODELS OF LANGUAGES; NAME-PASSING CALCULI; PERMUTATION ALGEBRAS; SEMANTICS OF PROGRAMMING LANGUAGES;

ALGEBRA;

EID: 23844434704     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.08.022     Document Type: Conference Paper

References (17)

1. Barr, M. and C. Wells, "Category Theory for Computing Science," Les Publications CMR, 1999.
2. Bucalo, A., M. Hofmann, F. Honsell, M. Miculan and I. Scagnetto, Consistency of the theory of contexts (2001), submitted.
3. Buscemi, M. and U. Montanari, A first order coalgebraic model of π-calculus early observational equivalence, in: P. Brim, L.and Jančar, M. Křetínský and A. Kučera, editors, Concurrency Theory, Lect. Notes in Comp. Sci. 2421 (2002), pp. 449-465.
4. Ferrari, G., U. Montanari and M. Pistore, Minimizing transition systems for name passing calculi: A co-algebraic formulation, in: M. Nielsen and U. Engberg, editors, Foundations of Software and Computer Science, Lect. Notes in Comp. Sci. 2303 (2002), pp. 129-143.
5. Fiore, M. and D. Turi, Semantics of name and value passing, in: H. Mairson, editor, Logic in Computer Science (2001), pp. 93-104.
6. Gabbay, M. J. and A. M. Pitts, A new approach to abstract syntax with variable binding, Formal Aspects of Computing 13 (2002), pp. 341-363.
7. Gadducci, F., M. Miculan and U. Montanari, About permutation algebras and sheaves (and named sets, too!), Technical Report UDMI/26/2003/RR, Dipartimento di Matematica e Informatica, Università di Udine (2003).
8. Hofmann, M., Semantical analysis of higher-order abstract syntax, in: G. Longo, editor, Logic in Computer Science, (1999), pp. 204-213.
9. Johnstone, P., "Sketches of an Elephant, I," Oxford University Press, 2002.
10. Kelley, J., "General Topology," Springer, 1975.
11. Mac Lane, S., "Categories for the Working Mathematician," Springer, 1971.
12. McLane, S. and I. Moerdijk, "Sheaves in Geometry and Logic: A First Introduction to Topos Theory," Springer, 1994.
13. Moggi, E., Notions of computation and monads, Information and Computation 93 (1991), pp. 55-92.
14. Montanari, U. and M. Pistore, Structured coalgebras and minimal HD-automata for the πcalculus, Theor. Comp. Sci. To appear.
15. Pitts, A. M., Nominal logic, a first order theory of names and binding, Information and Computation 186 (2003), pp. 165-193.
16. Stark, I., "Names and Higher-Order Function," Ph.D. thesis, University of Cambridge, Cambridge Computer Laboratory (1994).
17. Stark, I., A fully abstract domain model for the π-calculus, in: E. Clarke, editor, Logic in Computer Science (1996), pp. 36-42.