Grail: A functional form for imperative mobile code

Electronic Notes in Theoretical Computer Science

Volumn 85, Issue 1, 2003, Pages 3-23

  Beringer, Lennart ^a   MacKenzie, Kenneth ^a   Stark, Ian ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SOFTWARE; DATA STORAGE EQUIPMENT; PROGRAM COMPILERS; SEMANTICS; THEOREM PROVING;

BYTECODE; FUNCTIONAL COMPILATION; FUNCTIONAL LANGUAGES; GLOBAL COMPUTING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 18944365902     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80083-0     Document Type: Conference Paper

References (35)

1. Amadio R. Max-plus quasi-interpretations, in: Typed Lambda Calculi and Applications: Proceedings of TLCA 2003. Lecture Notes in Computer Science. 2003
2. Appel A.W. "Compiling with Continuations," 1992;Cambridge University Press
3. Appel A.W. SSA is functional programming. ACM SIGPLAN Notices 33. 1998;17-20
4. Appel A.W. Foundational proof-carrying code. Proceedings of the Sixteenth Annual IEEE Symposium on Logic in Computer Science. 2001;247-258
5. Appel A.W., Felty A.P. A semantic model of types and machine instructions for proof-carrying code. Conference Record of POPL '00: 27th ACM Symposium on Principles of Programming Languages. 2000;243-253
6. Aspinall D., Hofmann M. Another type system for in-place update, Programming Languages and Systems: Proceedings of the 11th European Symposium on Programming, ESOP 2002. Lecture Notes in Computer Science. 2305:2002;36-52
7. Barber A. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Science, University of Edinburgh. 1996
8. Beringer L. "Asynchronous Queue Machines with Explicit Forwarding," Ph.D. thesis, University of Edinburgh. 2002
9. Beringer L. Cost model. Laboratory for Foundations of Computer Science, University of Edinburgh. 2002;. http://www.lfcs.ed.ac.uk/mrg/publications.
10. ECMA International. Common language infrastructure (CLI), 2nd edition, Standard. ECMA-335:2002;. http://www.ecma-international.org.
11. Flanagan C., Sabry A., Duba B.F., Felleisen M. The essence of compiling with continuations, in: Proceedings of the 1993 ACM SIGPLAN Conference on Programming Language Design and Implementation. SIGPLAN Notices, 28(6). 1993;237-247
12. Flanagan C., Sabry A., Duba B.F., Felleisen M. Retrospective on "The essence of compiling with continuations" 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1979-1999): A Selection. 2003;ACM Press
13. Girard J.-Y. Linear logic. Theoretical Computer Science. 46:1986;1-102
14. Hofmann M. A type system for bounded space and functional in-place update. Nordic Journal of Computing. 7:2000;258-289
15. Hofmann M., Jost S. Static prediction of heap space usage for first-order functional programs. Conference Record of POPL '03: 30th ACM Symposium on Principles of Programming Languages. 2003;185-197
16. KonečyA M. Typing with conditions and guarantees in LFPL, in: Types for Proofs and Programs: Proceedings of the International Workshop TYPES 2002. Lecture Notes in Computer Science. 2646:2002;182-199
17. League C., Trifonov V., Shao Z. Functional Java bytecode, in: Proceedings of the 5th World Multi conference on Systemics, Cybernetics and Informatics. Workshop on Intermediate Representation Engineering for the Java Virtual Machine. 2001;. URL http://flint.cs.yale.edu/flint/publications/lamjvm.html
18. Leroy X. Bytecode verification for Java smart cards. Software Practice & Experience. 32:2002;319-340
19. Lindholm T., Yellin F. "The Java Virtual Machine Specification," The Java Series. 1997;Addison-Wesley
20. MacKenzie K. Grail: A functional intermediate language for resource bounded computation, version 1.2. Laboratory for Foundations of Computer Science, University of Edinburgh. 2002;. http://www.lfcs.ed.ac.uk/mrg/ publications/Grail-manual.pdf.
21. MacKenzie K. JVML and.NET. Laboratory for Foundations of Computer Science, University of Edinburgh. 2002;. http://www.lfcs.ed.ac.uk/mrg/ publications/.
22. MacKenzie K. From Camelot to Grail: Compiling a high-level language. Laboratory for Foundations of Computer Science, University of Edinburgh. 2003;. http://www.lfcs.ed.ac.uk/mrg/publications.
23. Microsoft, Overview of the.NET framework, in:.NET Framework Developer's Guide, http://msdn.microsoft.com.
24. Morrisett G., Walker D., Crary K., Glew N. From System F to typed assembly language. ACM Transactions on Programming Languages and Systems. 21:1999;527-568
25. MRG, Mobile resource guarantees (2002-2004), www.lfcs.ed.ac.uk/mrg.
26. Necula G.C. Proof-carrying code. Conference Record of POPL '97: 24th ACM Symposium on Principles of Programming Languages. 1997;106-119
27. Nielson F., Nielson H.R., Hankin C. "Principles of Program Analysis," Springer. 1999
28. Nipkow T., Paulson L.C., Wenzel M. "Isabelle/HOL - A Proof Assistant for Higher-Order Logic," Lecture Notes in Computer Science. 2283:2002;Springer
29. Oheimb D.v., Nipkow T. Hoare logic for NanoJava: Auxiliary variables, side effects and virtual methods revisited, in: Formal Methods Europe 2002. Lecture Notes in Computer Science. 2391:2002;89-105
30. Reynolds J. Separation logic: A logic for shared mutable data structures, in: Proceedings of the Seventeenth Annual IEEE Symposium on Logic in Computer Science. 2002;55-74
31. Stevenson R.L. "Strange Case of Dr. Jekyll and Mr. Hyde," Longmans, Green, London. 1886
32. Sun Microsystems. "Java Card 2.2 Platform Specification," 2003;. available online at http://java.sun.com/products/javacard/specs.html
33. Turner D.N., Wadler P. Operational interpretations of linear logic. Theoretical Computer Science. 227:1999;231-248
34. Wand M. Correctness of procedure representations in higher-order assembly language, in: Mathematical Foundations of Programming Semantics '91: Proceedings of the 7th International Conference. number 598 in Lecture Notes in Computer Science. 1992;294-311
35. Wolverson N. Optimisation and resource bounds in Camelot compilation. Laboratory for Foundations of Computer Science, University of Edinburgh. 2003;. http://homepages.inf.ed.ac.uk/s9904010/camelot.