The following pages link to G. M. Bierman (Q1575876):
Displaying 20 items.
- A classical linear \(\lambda\)-calculus (Q1575877) (← links)
- On an intuitionistic modal logic (Q1591340) (← links)
- A note on full intuitionistic linear logic (Q1919548) (← links)
- (Q2777490) (← links)
- Safe & Efficient Gradual Typing for TypeScript (Q2819802) (← links)
- Extending relational algebra with similarities (Q2909734) (← links)
- Semantic subtyping with an SMT solver (Q2913944) (← links)
- (Q3024825) (← links)
- Separation logic, abstraction and inheritance (Q3189828) (← links)
- (Q4218109) (← links)
- (Q4222823) (← links)
- Computational types from a logical perspective (Q4236755) (← links)
- (Q4281466) (← links)
- (Q4283230) (← links)
- (Q4461801) (← links)
- Program equivalence in a linear functional language (Q4500364) (← links)
- Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion (Q4921510) (← links)
- Semantic subtyping with an SMT solver (Q5176932) (← links)
- Separation logic and abstraction (Q5276150) (← links)
- Gradual typing embedded securely in JavaScript (Q5408437) (← links)
