Author:
Aydemir Brian E.,Bohannon Aaron,Fairbairn Matthew,Foster J. Nathan,Pierce Benjamin C.,Sewell Peter,Vytiniotis Dimitrios,Washburn Geoffrey,Weirich Stephanie,Zdancewic Steve
Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. Appel, A.W.: Foundational proof-carrying code. In: IEEE Symposium on Logic in Computer Science (LICS), Boston, Massachusetts, June 2001, pp. 247–258 (2001)
2. Cardelli, L.: Extensible records in a pure calculus of subtyping. Research report 81, DEC/Compaq Systems Research Center (January 1992) Also In: Gunter, C.A., Mitchell, J.C. (eds.) Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design. MIT Press, Cambridge (1994)
3. Cardelli, L., Martini, S., Mitchell, J.C., Scedrov, A.: An extension of System F with subtyping. Information and Computation 109(1–2), 4–56 (1994); Summary in TACS 1991 (Sendai, Japan, pp. 750–770) (1991)
4. Crary, K.: Toward a foundational typed assembly language. In: ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages (POPL), New Orleans, Louisiana, January 2003, pp. 198–212 (2003)
5. Dennis, L.A.: Inductive challenge problems (2000), http://www.cs.nott.ac.uk/~lad/research/challenges
Cited by
144 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Beluga Formalization of the Harmony Lemma in the π-Calculus;Electronic Proceedings in Theoretical Computer Science;2024-07-08
2. Mechanizing Refinement Types;Proceedings of the ACM on Programming Languages;2024-01-05
3. Nominal Recursors as Epi-Recursors;Proceedings of the ACM on Programming Languages;2024-01-05
4. Definitions and Computational Properties of OCL: A Systematic Review;IEEE Access;2024
5. The Concurrent Calculi Formalisation Benchmark;Lecture Notes in Computer Science;2024