Sat 13 Jan 2018 16:00 - 16:25 at Watercourt A - Semantics and Synthesis Chair(s): Ilya Sergey

We explore the design space of using dependent types to type check and verify quantum circuits. We weigh the trade-offs between the expressivity of dependent types against the costs imposed by large proof terms. We propose lightweight dependent types, or phantom types, as a middle ground, which provide useful type information for programming while specifying the properties to be externally verified.

Sat 13 Jan
Times are displayed in time zone: Tijuana, Baja California change

16:00 - 18:05: Semantics and SynthesisCoqPL at Watercourt A
Chair(s): Ilya SergeyUniversity College London
16:00 - 16:25
Talk
CoqPL
Robert RandUniversity of Pennsylvania, Jennifer PaykinUniversity of Pennsylvania, Steve ZdancewicUniversity of Pennsylvania
File Attached
16:25 - 16:50
Talk
CoqPL
Abhishek AnandCornell University, Greg MorrisettCornell University
File Attached
16:50 - 17:15
Talk
CoqPL
Paul KrogmeierPurdue University, Steven KiddPurdue University, Benjamin DelawarePurdue University
File Attached
17:15 - 17:40
Talk
CoqPL
Edwin WestbrookGalois, Inc.
File Attached
17:40 - 18:05
Talk
CoqPL
Dan FruminRadboud University, Robbert KrebbersDelft University of Technology
File Attached