Simple relational correctness proofs for static analyses and program transformations N Benton ACM SIGPLAN Notices 39 (1), 14-25, 2004 | 446 | 2004 |
Modern concurrency abstractions for C# N Benton, L Cardelli, C Fournet ACM Transactions on Programming Languages and Systems (TOPLAS) 26 (5), 769-804, 2004 | 377 | 2004 |
A mixed linear and non-linear logic: Proofs, terms and models P Benton Computer Science Logic, 121-135, 1995 | 377 | 1995 |
A term calculus for intuitionistic linear logic N Benton, G Bierman, V De Paiva, M Hyland Typed Lambda Calculi and Applications, 75-90, 1993 | 282 | 1993 |
Compiling standard ML to Java bytecodes N Benton, A Kennedy, G Russell ACM SIGPLAN Notices 34 (1), 129-140, 1999 | 190 | 1999 |
Computational types from a logical perspective PN Benton, GM Bierman, VCV De Paiva Journal of Functional Programming 8 (2), 177-193, 1998 | 169 | 1998 |
Monads and effects N Benton, J Hughes, E Moggi Applied Semantics, 923-952, 2002 | 162 | 2002 |
Linear logic, monads and the lambda calculus N Benton, P Wadler Logic in Computer Science, 1996. LICS'96. Proceedings., Eleventh Annual IEEE …, 1996 | 157 | 1996 |
Term assignment for intuitionistic linear logic (preliminary report) N Benton, G Bierman, V De Paiva, M Hyland Technical report, University of Cambridge, Computer Laboratory, 1992 | 149* | 1992 |
Biorthogonality, step-indexing and compiler correctness N Benton, CK Hur ACM SIGPLAN Notices 44 (9), 97-108, 2009 | 139 | 2009 |
Strongly typed term representations in Coq N Benton, CK Hur, AJ Kennedy, C McBride Journal of Automated Reasoning, 1-19, 2010 | 110 | 2010 |
Linear λ-calculus and categorical models revisited N Benton, G Bierman, V De Paiva, M Hyland Computer Science Logic, 61-84, 1993 | 110 | 1993 |
Ultrametric semantics of reactive programs NR Krishnaswami, N Benton Logic in Computer Science (LICS), 2011 26th Annual IEEE Symposium on, 257-266, 2011 | 104 | 2011 |
Relational reasoning in a nominal semantics for storage N Benton, B Leperchey Typed Lambda Calculi and Applications, 86-101, 2005 | 95 | 2005 |
Integrating dependent and linear types NR Krishnaswami, P Pradic, N Benton POPL 2015, 2015 | 88* | 2015 |
Some domain theory and denotational semantics in Coq N Benton, A Kennedy, C Varming Theorem Proving in Higher Order Logics, 115-130, 2009 | 81 | 2009 |
High-level separation logic for low-level code JB Jensen, N Benton, A Kennedy Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2013 | 72 | 2013 |
Exceptional syntax N Benton, A Kennedy Journal of Functional Programming 11 (04), 395-410, 2001 | 72 | 2001 |
Strictness analysis of lazy functional programs PN Benton University of Cambridge, Computer Laboratory, 1993 | 71 | 1993 |
Higher-Order Functional Reactive Programming in Bounded Space NR Krishnaswami, N Benton, J Hoffmann 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages …, 2012 | 65 | 2012 |