| Iris from the ground up A modular foundation for higher-order concurrent separation logic |
5 |
| The verified CakeML compiler backend |
2 |
| Push versus pull-based loop fusion in query engines |
2 |
| A theory of RPC calculi for client-server model |
2 |
| POPLMark reloaded: Mechanizing proofs by logical relations |
2 |
| On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control |
2 |
| Systematic identification and communication of type errors |
1 |
| The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus |
1 |
| Foundations of dependent interoperability |
1 |
| How to prove decidability of equational theories with second-order computation analyser SOL |
0 |
| COCHIS: Stable and coherent implicits |
0 |
| Gradual session types |
0 |
| Pure iso-type systems |
0 |
| Applicative bidirectional programming Mixing lenses and semantic bidirectionalization |
0 |
| A SQL to C compiler in 500 lines of code |
0 |
| FUNCTIONAL PEARL How to find a fake coin |
0 |
| The adequacy of Launchbury's natural semantics for lazy evaluation |
0 |
| Infusing an HtDP-based CS1 with distributed programming using functional video games |
0 |
| Perturbation confusion in forward automatic differentiation of higher-order functions |
0 |
| Proof-relevant unification: Dependent pattern matching with only the axioms of your type theory |
0 |
| A programming model and foundation for lineage-based distributed computation |
0 |
| A relational logic for higher-order programs |
0 |
| Size-based termination of higher-order rewriting |
0 |
| A tutorial on computational classical logic and the sequent calculus |
0 |
| How to evaluate the performance of gradual type systems |
0 |
| Emerging languages: An alternative approach to teaching programming languages |
0 |
| Ghostbuster: A tool for simplifying and converting GADTs |
0 |
| FUNCTIONAL PEARLS Parberry's pairwise sorting network revealed |
0 |
| Dynamic witnesses for static type errors (or, Ill-Typed Programs Usually Go Wrong) |
0 |
| An extended account of contract monitoring strategies as patterns of communication |
0 |
| Abstract allocation as a unified approach to polyvariance in control-flow analyses |
0 |
| Batcher's odd-even merging network revealed |
0 |
| 1ML-Core and modules united |
0 |
| Constructive Galois Connections |
0 |
