On a monadic semantics for freshness

Theoretical Computer Science

Volumn 342, Issue 1, 2005, Pages 28-55

  Shinwell, Mark R ^a   Pitts, Andrew M ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; MATHEMATICAL MODELS; RESOURCE ALLOCATION; SYNTACTICS;

MONADIC SEMANTICS; SWAPPING; VARIABLE BINDING;

SEMANTICS;

EID: 23844493780     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.06.003     Document Type: Article

References (22)

1. S. Abramsky, D.R. Ghica, A.S. Murowski, C.-H.L. Ong, and I.D.B. Stark Nominal games and full abstraction for the nu-calculus 19th Annu. Symp. Logic in Computer Science 2004 IEEE Computer Society Press Washington
2. S. Abramsky, A. Jung, Domain theory, in: Handbook of Logic in Computer Science, vol. 3, Clarendon Press, 1994, pp. 1-168.
3. H.P. Barendregt The Lambda Calculus Its Syntax and Semantics revised ed. 1984 North-Holland Amsterdam
4. M.J. Gabbay, and A.M. Pitts A new approach to abstract syntax with variable binding Formal Aspects of Comput. 13 2002 341 363
5. I.A. Mason, and C.L. Talcott Equivalence in functional languages with effects J. Function. Program. 1 3 1991 287 327
6. E. Moggi, An abstract view of programming languages, Technical Report ECS-LFCS-90-113, Dept. Computer Science, Univ. Edinburgh, 1989.
7. E. Moggi Notions of computation and monads Inform. Comput. 93 1 1991 55 92
8. S.L. Peyton Jones Tackling the awkward squad monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell C.A.R. Hoare M. Broy R. Steinbruggen Engineering Theories of Software Construction 2001 IOS Press 47 96
9. A.M. Pitts Relational properties of domains Inform. Comput. 127 1996 66 90
10. A.M. Pitts, Operational semantics and program equivalence, in: Applied Semantics, Advanced Lectures, Lecture Notes in Computer Science Tutorial, vol. 2395, Springer, Berlin, 2002, pp. 378-412.
11. A.M. Pitts Nominal logic a first order theory of names and binding Inform. Comput. 186 2003 165 193
12. A.M. Pitts, I.D.B. Stark, Observable properties of higher order functions that dynamically create local names, or: What's new? in: Mathematical Foundations of Computer Science, Proc. 18th Internat. Symp., Gdańsk, 1993, Lecture Notes in Computer Science, vol. 711, Springer, Berlin, 1993, pp. 122-141.
13. A.M. Pitts, and I.D.B. Stark Operational reasoning for functions with local state A.D. Gordon A.M. Pitts Higher Order Operational Techniques in Semantics 1998 Cambridge University Press Cambridge 227 273
14. G.D. Plotkin LCF considered as a programming language Theor. Comput. Sci. 5 1977 223 255
15. M.R. Shinwell, Swapping the atom: programming with binders in Fresh O'Caml, Proc. MER λ IN, 2003.
16. M.R. Shinwell, The Fresh Approach: Functional Programming with Names and Binders, Ph.D. Thesis, University of Cambridge Computer Laboratory, 2005, in preparation.
17. M.R. Shinwell, A.M. Pitts, Fresh O'Caml User Manual, Cambridge University Computer Laboratory, September. Available at 〈 http://www.freshml.org/foc/ 〉.
18. M.R. Shinwell, A.M. Pitts, and M.J. Gabbay FreshML programming with binders made simple Proc. ICFP '03 2003 ACM Press 263 274
19. I.D.B. Stark Categorical models for local names Lisp Symbol. Comput. 9 1 1996 77 107
20. C. Urban, A.M. Pitts, M.J. Gabbay, Nominal unification, in: Proc. CSL'03 & KGC, Lecture Notes in Computer Science, vol. 2803, Springer, Berlin, 2003, pp. 513-527.
21. P. Wadler Comprehending monads Math. Struct. Computer Sci. 2 1992 461 493
22. A.K. Wright, and M. Felleisen A syntactic approach to type soundness Inform. Comput. 115 1994 38 94