Realizability semantics of parametric polymorphism, general references, and recursive types

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

Volumn 5504 LNCS, Issue , 2009, Pages 456-470

  Birkedal, Lars ^a   Støvring, Kristian ^a   Thamsborg, Jacob ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATA TYPES; FINITE MAPS; HIGHER ORDER; INDEXED FAMILIES; LOGICAL RELATIONS; METRIC SPACES; NEW APPROACHES; PARAMETRIC POLYMORPHISM; PARAMETRICITY; PROGRAMMING LANGUAGE; REALIZABILITY MODELS; REALIZABILITY SEMANTICS; RECURSIVE EQUATIONS; RECURSIVE TYPES; SEMANTIC TYPES;

COMPUTATIONAL LINGUISTICS; COMPUTER SOFTWARE; POLYMORPHISM; PROGRAM INTERPRETERS; SEMANTICS; SET THEORY; TOPOLOGY;

RECURSIVE FUNCTIONS;

EID: 70350352385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00596-1_32     Document Type: Conference Paper

References (22)

1. Abadi, M., Plotkin, G.D.: A per model of polymorphism and recursive types. In: Proceedings of LICS, pp. 355-365 (1990)
2. Ahmed, A.: Semantics of Types for Mutable State. PhD thesis, Princeton University (2004)
3. Ahmed, A., Dreyer, D., Rossberg, A.: State-dependent representation independence. In: Proceedings of POPL (to appear, 2009)
4. Amadio, R.M.: Recursion over realizability structures. Information and Computation 91(1), 55-85 (1991)
5. Amadio, R.M., Curien, P.-L.: Domains and Lambda-Calculi. Cambridge University Press, Cambridge (1998)
6. America, P., Rutten, J.J.M.M.: Solving reflexive domain equations in a category of complete metric spaces. J. Comput. Syst. Sci. 39(3), 343-375 (1989)
7. Benton, N., Leperchey, B.: Relational reasoning in a nominal semantics for storage. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 86-101. Springer, Heidelberg (2005)
8. Birkedal, L., Støvring, K., Thamsborg, J.: Relational parametricity for references and recursive types. In: Proceedings of TLDI (to appear, 2009)
9. Bohr, N., Birkedal, L.: Relational reasoning for recursive types and references. In: Kobayashi, N. (ed.) APLAS 2006. LNCS, vol. 4279, pp. 79-96. Springer, Heidelberg (2006)
10. Cardone, F.: Relational semantics for recursive types and bounded quantification. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 164-178. Springer, Heidelberg (1989)
11. Crary, K., Harper, R.: Syntactic logical relations for polymorphic and recursive types. Electronic Notes in Theoretical Computer Science 172, 259-299 (2007)
12. Levy, P.B.: Call-by-push-value: Decomposing call-by-value and call-by-name. Higher-Order and Symbolic Computation 19(4), 377-414 (2006)
13. MacQueen, D.B., Plotkin, G.D., Sethi, R.: An ideal model for recursive polymorphic types. Information and Control 71(1/2), 95-130 (1986)
14. Mitchell, J.C.: Foundations for Programming Languages. MIT Press, Cambridge (1996)
15. Moggi, E.: Notions of computation and monads. Information and Computation 93, 55-92 (1991)
16. Petersen, R.L., Birkedal, L., Nanevski, A., Morrisett, G.: A realizability model for impredicative hoare type theory. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 337-352. Springer, Heidelberg (2008)
17. Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)
18. Pitts, A.M.: Relational properties of domains. Information and Computation 127, 66-90 (1996)
19. Plotkin, G.D., Power, J.: Computational effects and operations: An overview. Electronic Notes in Theoretical Computer Science 73, 149-163 (2004)
20. Rutten, J.J.M.M.: Elements of generalized ultrametric domain theory. Theoretical Computer Science 170(1-2), 349-381 (1996)
21. Smyth, M.B., Plotkin, G.D.: The category-theoretic solution of recursive domain equations. SIAM Journal on Computing 11(4), 761-783 (1982)
22. Wagner, K.R.: Solving Recursive Domain Equations with Enriched Categories. PhD thesis, Carnegie Mellon University (1994)