Affine Functional Programs as Higher-order Boolean Circuits Damiano Mazza∗ CNRS, LIPN, Universit´e Paris 13, Sorbonne Paris Cit´e Implicit computational complexity. Loosely speakin

First Page		Document Content
		Affine Functional Programs as Higher-order Boolean Circuits Damiano Mazza∗ CNRS, LIPN, Universit´e Paris 13, Sorbonne Paris Cit´e Implicit computational complexity. Loosely speakin Add to Reading List Source URL: conf.researchr.org Download Document from Source Website File Size: 121,66 KB Share Document on Facebook