Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
1
0
1
0
Compositional program verification, notoriously difficult, gets a boost from polynomial functors and dependent type theory, offering a path to more modular and scalable verification techniques.