ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
The SLam calculus: programming with secrecy and integrity
Full text PdfPdf (1.78 MB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
San Diego, California, United States
Pages: 365 - 377  
Year of Publication: 1998
ISBN:0-89791-979-3
Authors
Nevin Heintze  Bell Laboratories, Lucent Technologies, 700 Mountain Avenue, Murray Hill, NJ
Jon G. Riecke  Bell Laboratories, Lucent Technologies, 700 Mountain Avenue, Murray Hill, NJ
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 52,   Citation Count: 78
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/268946.268976
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
 
4
 
5
 
6
7
8
9
 
10
D. McCullough. Noninterference and the composabillty of security properties. In 19881EEE Symposium on SecuriJy and Privacy, pages 177-186, 1988.
 
11
 
12
13
 
14
J. Palsberg and P. ~rba~k. Trust in the X-calculus. In Proceedings of the 1995 Static Analysis Symposium, number 983 hL Leer. Notes in Computer $ci. Spdnger-Verlag, 1995.
 
15
A. M. Pitts. Relational properties of domains. Information and Computation, t27:66-90, 1996.
 
16
G. D. Plotkin. A structural appr6aeh to operational semantics. Technical Report DAIMI FN-19, Aarhus Univ., Com. puti~r Science Dept., Denmark, 1981.
 
17
G. D. Plotkin. (Towards a) logic for computable functions, Unpublished manuscript, CSLI Summer School Notes, 1985,
 
18
J. C. Reynolds. Types, abstraction and parametric polyrnorphism. In R. E. A. Mason, editor, Information Processing 83, pages 513-523. Noah Holland, Amsterdam, 1983.
19
 
20
J.-P. Talpin and P. Jouvelot. Polymorphie type, region and effect inference. Journal of Functional Programming, 2:245- 271, 1992.
 
21
 
22
 
23

CITED BY  78

Collaborative Colleagues:
Nevin Heintze: colleagues
Jon G. Riecke: colleagues