Nominal domain theory for concurrency

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5771 LNCS, Issue , 2009, Pages 546-560

  Turner, David ^a   Winskel, Glynn ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DENOTATIONAL SEMANTICS; DOMAIN THEORY; HIGHER ORDER; HIGHER-ORDER PROCESS; SEMANTIC THEORIES;

COMPUTER SCIENCE; CRYSTAL LATTICES; LINGUISTICS; SEMANTICS;

SET THEORY;

EID: 70350366930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04027-6_39     Document Type: Conference Paper

References (8)

1. Benton, N., Bierman, G., de Paiva, V., Hyland, M.: Linear lambda-calculus and categorical models revisited. In: Martini, S., Börger, E., Kleine Büning, H., Jäger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol. 702, pp. 61-84. Springer, Heidelberg (1993)
2. Gabbay, M.J.: A Theory of Inductive Definitions with Alpha-Equivalence. PhD thesis, Cambridge University (2001)
3. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13, 341-363 (2001)
4. Nygaard, M., Winskel, G.: Domain theory for concurrency. Theor. Comput. Sci. 316(1-3), 153-190 (2004)
5. Turner, D.C.: Nominal Domain Theory for Concurrency. PhD thesis, Cambridge University (submitted) (2008), http://www.cl.cam.ac.uk/~dct25/
6. Winskel, G.: Name generation and linearity. In: LICS 2005: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science, Washington, DC, USA, pp. 301-310. IEEE Computer Society Press, Los Alamitos (2005)
7. Winskel, G., Larsen, K.G.: Using information systems to solve recursive domain equations effectively. Extended abstract: Springer Lecture Notes in Computer Science, vol. 173. Full version: Technical Report UCAM-CL-TR-51, University of Cambridge, Computer Laboratory (1984)
8. Winskel, G., Zappa Nardelli, F.: new-HOPLA: a higher-order process language with name generation. In: Proc. of 3rd IFIP TCS, pp. 521-534 (2004)