2025/11/27 by Sakayori, Ken, Colledan, Andrea, Lago, Ugo Dal
Computer Science · #Logic, programming, and type systems #Formal Methods in Verification #Embedded Systems Design Techniques
paper · doi:10.48550/arxiv.2511.22419
In this paper, a monad-based denotational model is introduced and shown adequate for the Proto-Quipper family of calculi, themselves being idealized versions of the Quipper programming language. The use of a monadic approach allows us to separate the value to which a term reduces from the circuit that the term itself produces as a side effect. In turn, this enables the denotational interpretation and validation of rich type systems in which the size of the produced circuit can be controlled. Notably, the proposed semantic framework, through the novel concept of circuit algebra, suggests forms of effect typing guaranteeing quantitative properties about the resulting circuit, even in presence of optimizations.