[1] Fred B. Schneider. Enforceable security policies. ACM Transactions on Information and System Security, 3(1), February 2000.
[ bib ]
[2] Fred B. Schneider, Gregory Morrisett, and Robert Harper. A language-based approach to security. In Informatics, pages 86-101, 2001.
[ bib ]
[3] Kevin W. Hamlen, Greg Morrisett, and Fred B. Schneider. Computability classes for enforcement mechanisms. Technical Report TR 2003-1908, Cornell Computer Science Department, August 2003.
[ bib ]
[4] Luca Cardelli. Type systems. In The Computer Science and Engineering Handbook, pages 2208-2236. CRC press, 1997.
[ bib ]
[5] Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, January 1993.
[ bib ]
[6] Frank Pfenning. Logical frameworks-a brief introduction. In H. Schwichtenberg and R. Steinbrüggen, editors, Proof and System-Reliability, NATO Science Series II, pages 137-166. Kluwer Academic Publishers, 2002. Lecture notes from the Marktoberdorf Summer School, July 2001.
[ bib | .ps | .pdf ]
[7] Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN '88 Symposium on Language Design and Implementation, pages 199-208, Atlanta, Georgia, June 1988.
[ bib | .ps | .pdf ]
[8] Carsten Schürmann. A type-theoretic approach to induction with higher-order encodings. In LPAR, pages 266-281, 2001.
[ bib ]
[9] Carsten Schürmann. Recursion for higher-order encodings. In CSL, pages 585-599, 2001.
[ bib ]
[10] P. L. Wadler. A taste of linear logic. In Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, Gdánsk, New York, NY, 1993. Springer-Verlag.
[ bib ]
[11] Jawahar L. Chirimar, Carl A. Gunter, and Jon G. Riecke. Reference counting as a computational interpretation of linear logic. Journal of Functional Programming, 6(2):195-244, 1996.
[ bib | .pdf ]

This file has been generated by bibtex2html 1.77