The following pages link to Nick Benton (Q2392478):
Displaying 27 items.
- Strongly typed term representations in Coq (Q2392480) (← links)
- Exceptional syntax (Q2757081) (← links)
- Interlanguage working without tears (Q2817716) (← links)
- Integrating Linear and Dependent Types (Q2819785) (← links)
- Adding Equations to System F Types (Q2892742) (← links)
- High-level separation logic for low-level code (Q2931805) (← links)
- Biorthogonality, step-indexing and compiler correctness (Q2936808) (← links)
- Higher-order functional reactive programming in bounded space (Q2942856) (← links)
- (Q3046754) (← links)
- Some Domain Theory and Denotational Semantics in Coq (Q3183523) (← links)
- Counting Successes: Effects and Transformations for Non-deterministic Programs (Q3188280) (← links)
- Embedded interpreters (Q3367665) (← links)
- Simple relational correctness proofs for static analyses and program transformations (Q3452246) (← links)
- Abstracting Allocation (Q3613337) (← links)
- (Q4281466) (← links)
- (Q4283230) (← links)
- Traced Premonoidal Categories (Q4460686) (← links)
- (Q4499197) (← links)
- Proof-Relevant Logical Relations for Name Generation (Q4637685) (← links)
- A semantic model for graphical user interfaces (Q5176962) (← links)
- Compiling standard ML to Java bytecodes (Q5234263) (← links)
- Correctness of compiling polymorphism to dynamic typing (Q5371998) (← links)
- Reading, Writing and Relations (Q5385590) (← links)
- Abstract effects and proof-relevant logical relations (Q5408454) (← links)
- Shrinking Reductions in SML.NET (Q5423549) (← links)
- Programming Languages and Systems (Q5493398) (← links)
- Typed Lambda Calculi and Applications (Q5704031) (← links)
