Uniqueness typing simplified

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

Volumn 5083 LNCS, Issue , 2008, Pages 201-218

  De Vries, Edsko ^a   Plasmeijer, Rinus ^b   Abrahamson, David M ^a  

^a TRINITY COLLEGE DUBLIN   (Ireland)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); LINGUISTICS;

CALL-BY-NEED; FUNCTIONAL LANGUAGES; INTERNATIONAL SYMPOSIUM; LAMBDA-CALCULUS; TYPE SYSTEMS;

QUERY LANGUAGES;

EID: 51849089632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85373-2_12     Document Type: Conference Paper

References (27)

1. Barendsen, E., Smetsers, S.: Conventional and uniqueness typing in graph rewrite systems. Technical Report CSI-R9328, University of Nijmegen (December 1993)
2. Barendsen, E., Smetsers, S.: Uniqueness typing for functional languages with graph rewriting semantics. Math. Struct. in Computer Science 6, 579-612 (1996)
3. De Vries, E., Plasmeijer, R., Abrahamson, D.: Uniqueness typing redefined. In: Horváth, Z., Zsók, V., Butterfield, A. (eds.) IFL 2006. LNCS, vol. 4449. Springer, Heidelberg (2007)
4. Maraist, J., Odersky, M., Wadler, P.: The call-by-need lambda calculus. JFP 8(3), 275-317 (1998)
5. Jones, M.P.: A system of constructor classes: overloading and implicit higher-order polymorphism. In: FPCA 1993, pp. 52-61 (1993)
6. Sheard, T.: Putting Curry-Howard to work. In: Haskell Workshop 2005, pp. 74-85. ACM, New York (2005)
7. Sulzmann, M., Chakravarty, M.M.T., Jones, S.P., Donnelly, K.: System F with type equality coercions. In: TLDI 2007, pp. 53-66. ACM Press, New York (2007)
8. Damas, L., Milner, R.: Principal type-schemes for functional programs. In: POPL 1982, pp. 207-212 (1982)
9. Baader, F., Niphow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
10. Brown, F.M.: Boolean Reasoning. Dover Publications, Inc. (2003)
11. Peyton Jones, S., Vytiniotis, D., Weirich, S., Shields, M.: Practical type inference for arbitrary-rank types. JFP 17(1), 1-82 (2007)
12. Leijen, D.: HMF: Simple type inference for first-class polymorphism. Technical Report MSR-TR-2007-118, Microsoft Research, Redmond
13. Vytiniotis, D., Weirich, S., Peyton Jones, S.: Boxy types: inference for higher-rank types and impredicativity. In: ICFP 2006, pp. 251-262 (2006)
14. f: raising ML to the power of System F. In: ICFP 2003, pp. 27-38 (2003)
15. Walker, D.: Substructural type systems. In: Pierce, B. (ed.) Advanced Topics in Types and Programming Languages. The MIT Press, Cambridge (2005)
16. Cervesato, I., Pfenning, F.: A linear logical framework. Inf. Comput. 179(1), 19-75 (2002)
17. Launchbury, J.: A natural semantics for lazy evaluation. In: POPL 1993, pp. 144-154 (1993)
18. de Vries, E.: Uniqueness typing simplified - technical appendix. Technical Report TCD-CS-2008-19, Trinity College Dublin
19. Harrington, D.: Uniqueness logic. Theor. Comput. Sci. 354(1), 24-41 (2006)
20. Hage, J., Holdermans, S., Middelkoop, A.: A generic usage analysis with subeffect qualifiers. In: ICFP 2007, pp. 235-246. ACM, New York (2007)
21. Hage, J., Holdermans, S.: Heap recycling for lazy languages. In: PEPM 2008, pp. 189-197. ACM, New York (2008)
22. Wadler, P.: Is there a use for linear logic? In: PEPM 1991, pp. 255-273 (1991)
23. Turner, D.N., Wadler, P., Mossin, C.: Once upon a type. In: FPCA 1995, pp. 1-11 (1995)
24. Guzman, J., Hudak, P.: Single-threaded polymorphic lambda calculus. In: Logic in Computer Science 1990, June 1990, pp. 333-343 (1990)
25. Plasmeijer, R., van Eekelen, M.: Clean language report (version 2.1)
26. Odersky, M.: Observers for linear types. In: Krieg-Brückner, B. (ed.) ESOP 1992. LNCS, vol. 582, pp. 390-407. Springer, Heidelberg (1992)
27. Aydemir, B., Charguéraud, A., Pierce, B.C., Pollack, R., Weirich, S.: Engineering formal metatheory. SIGPLAN Not. 43(1), 3-15 (2008)