Global Abstraction-Safe Marshalling with Hash Types

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn 8, Issue , 2003, Pages 87-98

  Leifer, James J ^a   Peskine, Gilles ^a   Sewell, Peter ^b   Wansbroug, Keith ^b  

^a NRIA Rocquencourt   (France)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Abstract types; Distributed programming; Hashing; Lambda calculus; Marshalling; ML; Modules; Programming languages; Serialisation; Singleton kinds; Type theory

Indexed keywords

CODES (SYMBOLS); COMMUNICATION; COMPUTER NETWORKS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE; CONSTRAINT THEORY; MAPPING; SEMANTICS;

ABSTRACT TYPES; DISTRIBUTED PROGRAMMING; HASHING; LAMBDA CALCULUS; MARSHALLING; ML-LIKE LANGUAGES; MODULES; SERIALIZATION; SINGLETON KINDS; TYPE THEORY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1142299754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/944705.944714     Document Type: Conference Paper

References (33)

1. M. Abadi, L. Cardelli, B. Pierce, and G. Plotkin. Dynamic typing in a statically typed language. ACM TOPLAS, 13(2):237-268, 1991.
2. M. Abadi, L. Cardelli, B. Pierce, and D. Rémy. Dynamic typing in polymorphic languages. J. Functional Programming, 5(1):111-130, 1995.
3. T. Alice Project. Alice manual: Pickling. http://www.ps.uni-sb.de/alice/manual/pickling.html, 2003.
4. G. Bierman, M. Hicks, P. Sewell, G. Stoyle, and K. Wansbrough. Dynamic rebinding for marshalling and update, with destruct-time λ. In Proc. ICFP 2003, 2003. Full version available as UCAM-CL-TR-568. http://www.cl.cam.ac.uk/̃pes20/.
5. A. Birrell, G. Nelson, S. Owicki, and E. Wobber. Network objects. Software - Practice & Experience, 25(S4):87-130, 1995. Available in slightly different form as SRC-115 revised.
6. A.Z. Broder et al. Fingerprint.i3. http://research.Compaq.com/SRC/m3sources/html/lingerprint/src/Fingerprint.13. html, 1994.
7. D. Dreyer, K. Crary, and R. Harper. A type system for higher-order modules. In Proc. 30th POPL, New Orleans, pages 236-249, 2003.
8. D. Duggan. Type-safe linking with recursive DLLs and shared libraries. ACM TOPLAS, 24(6):711-804, 2002.
9. J. Furuse and P. Weis. Entrées/sorties de valeurs en Caml. In J. Francophones des Langages Applicatifs, 2000.
10. D. Grossman, G. Morrisett, and S. Zdancewic. Syntactic type abstraction. ACM TOPLAS, 22(6): 1037-1080, 2000.
11. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Proc. 21st POPL, 1994.
12. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In Proc. 22nd POPL, pages 130-141, 1995.
13. M. Hicks, S. Weirich, and K. Crary. Safe and flexible dynamic linking of native code. In Proc. 3rd Workshop on types in Compilation, pages 147-176, 2000.
14. JoCaml. http://pauillac.inria.fr/jocaml/.
15. F. Knabe, Language Support for Mobile Agents. PhD thesis, Carnegie Mellon University, Dec. 1995.
16. J. J. Leifer, G. Peskine, P. Swell, and K. Wansbrough. Global abstraction-safe marshalling with hash types. Technical Report RR-4851, INRIA Rocquencourt, 2003. Available from http://pauillac.inria.fr/̃leifer/research.html. Also published as UCAM-CL-TR-569.
17. X. Leroy. Manifest types, modules, and separate compilation. In Proc. 21st POPL, pages 109-122, 1994.
18. X. Leroy. Applicative functors and fully transparent higher-order modules. In Proc. 22nd POPL, pages 142-153, 1995.
19. D. MacQueen. Modules for Standard ML. In Proc. 1984 ACM Symp. LISP and Func. Prog., pages 198-207, 1984.
20. Microsoft Corporation. .NET Framework developer's guide: Serializing objects. http://msdn.microsoft.com/library/en-us/cpguide/html/cpovrserializingobjects. asp, 2001.
21. R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990.
22. Objective Caml. http://caml.inria.fr.
23. B. Pierce and E. Sumii. Relating cryptography and polymorphism. http://web.yl.is.s.u-tokyo.ac.jp/̃sumii/pub/, July 16 2000. Substantially revised version to appear in J. Comp. Security.
24. M. J. B. Robshaw. On recent results for MD2, MD4 and MD5. RSA Laboratories' Bulletin, (4), Nov. 12 1996.
25. A. Rossberg. Dynamic opacity for abstract types. Technical report, Programming Systems Lab, Universität des Saarlandes, 2002. http://www.pa.uni-sb.de/Papers/abstracts/opaque.html.
26. P. Sewell. Modules, abstract types, and distributed versioning. In Proc. 28th POPL, pages 236-247, 2001.
27. P. Sewell, P. T. Wojciechowski, and B. C. Pierce. Location-independent communication for mobile agents: a two-level architecture. In Internet Programming Languages, LNCS 1686, pages 1-31, 1999.
28. C. A. Stone and R. Harper. Deciding type equivalence in a language with singleton kinds. In Proc. 27th POPL, pages 214-227, 2000.
29. Sun Microsystems. Java object serialization specification 1.4.4. http://Java.sun.com/j2se/1.4.1/docs/guide/serialization/, 2002.
30. B. Thomsen, L. Leth, and T.-M. Kuo. A Facile tutorial. In CONCUR'96, LNCS 1119, pages 278-298, 1996.
31. S. Weirich, Type-safe cast: Functional pearl. In Proc. ICFP, Montreal, pages 58-67, 2000.
32. S. Weirich. Higher-order intensional type analysis. In Proc. 11th ESOP, LNCS 2305, Grenoble, France, 2002.
33. S. Zdancewic, D. Grossman, and G. Morrisett. Principals in programming languages: A syntactic proof technique. In Proc. ICFP, Paris, pages 197-207, Sep 1999.