- Strictness Analysis Lazy Functional Programs
- J. Functional Programming 1 (1): 1{15, January 1993 c 1993 Cambridge University Press 1
- Compiling Functional Types to Relational Specifications for Low Level Imperative Code
- Simple Relational Correctness Proofs for Static Analyses and Program Transformations
- Modern Concurrency Abstractions for C Nick Benton, Luca Cardelli, and Cedric Fournet
- Relational Reasoning in a Nominal Semantics for Storage
- Ultrametric Semantics of Reactive Programs Neelakantan R. Krishnaswami
- Realizability and Compositional Compiler Correctness for a Polymorphic Language
- On the Relationship Between Formal Semantics and Static Analysis
- Call for Papers First Workshop on MultiLanguage Infrastructure and Interoperability
- Relational Semantics for Effect-Based Program Transformations: Higher-Order Store
- Biorthogonality, Step-Indexing and Compiler Correctness Nick Benton
- Formalizing and Verifying Semantic Type Soundness of a Simple Compiler
- A Typed, Compositional Logic for a Stack-Based Abstract Machine
- Semantics of Program Analyses and Transformations
- A Typed Logic for Stacks and Jumps Nick Benton
- SML.NET 1.1 User Guide Andrew Kennedy, Claudio Russo, Nick Benton
- Strictness Logic and Polymorphic Invariance P. N. Benton*
- J Autom Reasoning manuscript No. (will be inserted by the editor)
- Some Domain Theory and Denotational Semantics in Coq
- Relational Semantics for Effect-Based Program Transformations with Dynamic Allocation
- Formalizing and Verifying Semantic Type Soundness of a Simple Compiler
- Semantics of an Effect Analysis for Exceptions Nick Benton
- Machine Obstructed Proof How many months can it take to verify 30 assembly instructions?
- Shrinking Reductions in SML.NET Nick Benton1
- Adventures in Interoperability: The SML.NET Experience Nick Benton
- Interlanguage Working Without Tears: Blending SML with Java
- Lecture Notes on for Part II of the Computer Science Tripos
- An Ultrametric Model of Reactive Programming Neelakantan R. Krishnaswami
- Compiling Standard ML to Java Bytecodes Nick Benton, Andrew Kennedy, George Russell
- A Term Calculus for Intuitionistic Linear Logic Nick Benton 1 , Gavin Bierman 1 , Valeria de Paiva 1 and Martin Hyland 2
- Monads and Effects Nick Benton 1 , John Hughes 2 , and Eugenio Moggi 3?
- A Mechanized Bisimulation for the Nu-Calculus Nick Benton
- A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models
- Lecture Notes on for Part II of the Computer Science Tripos
- Compiling Standard ML to Java Bytecodes Nick Benton, Andrew Kennedy, George Russell
- Under consideration for publication in J. Functional Programming 1 Exceptional Syntax
- Strictness Properties of Lazy Algebraic P. N. Benton
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Simple Relational Correctness Proofs for Static Analyses and Program Transformations
- A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models
- Linear Logic, Monads and the Lambda Calculus Nick Benton
- Term Assignment for Intuitionistic Linear Logic \Lambda (Preliminary Report)
- Introduction CurryHoward
- Call for Papers First Workshop on Multi-Language Infrastructure and Interoperability
- J. Functional Programming 1 (1): 1--000, January 1993 c fl 1993 Cambridge University Press 1
- A Proof Sketch Of Something Which May Possibly Be A Conjecture of Oege de Moor
- MLj 0.2 User Guide Nick Benton, Andrew Kennedy, George Russell
- Step-Indexing: The Good, the Bad and the Ugly Nick Benton
- Ultrametric Semantics of Reactive Programs Neelakantan R. Krishnaswami
- Undoing Dynamic Typing (Declarative Pearl)
- Linear Calculus and Categorical Models Nick Benton 1 , Gavin Bierman 1 , Valeria de Paiva 1 and Martin Hyland 2
- Abstracting Allocation The New new Thing
- Pattern Transfer: bridging the gap between theory and practice
- Jingle Bells: Solving the Santa Claus Problem in Polyphonic C
- Reading, Writing and Relations Towards Extensional Semantics for Effect Analyses
- Under consideration for publication in J. Functional Programming 1 Embedded Interpreters
- University of Cambridge Computer Science Tripos Part IB
- A Uni ed Approach to Strictness Analysis and Optimising Transformations
- Monads and Effects Nick Benton John Hughes Eugenio Moggi
- Under consideration for publication in J. Functional Programming 1 Embedded Interpreters
- Under consideration for publication in Math. Struct. in Comp. Science Formalizing Domains, Ultrametric Spaces and
- Electronic Notes in Theoretical Computer Science 26 (1999) URL: http://www.elsevier.nl/locate/entcs/volume26.html 18 pages
- Some Shortcomings of, and Possible Improvements to, the Java Virtual Machine.
- A Semantic Model for Graphical User Interfaces Neelakantan R. Krishnaswami
- Higher-Order Functional Reactive Programming in Bounded Space
- Adding Equations to System F Types Neelakantan R. Krishnaswami1
