Computing Reviews, the leading online review service for computing literature.

Search

Jacques Carette
McMaster University
Hamilton, Canada

Jacques Carette is an associate professor of computer science and software engineering in the Department of Computing and Software at McMaster University, in Hamilton, Canada.¿He received his BMath from the University of Waterloo, MS from the Université de Montréal, and PhD (in pure mathematics) from the Université de Paris-Sud.¿Before joining academia, he worked for Maplesoft Inc. for 11 years, with roles ranging from math developer to product development director.

His current research is centered on mechanized mathematics, joining computer algebra and theorem-proving facilities into a single system.¿He has emphasized the use of techniques from modern programming languages as well as meta-programming in his efforts to build a next-generation system. He also enjoys applying these techniques to the certified software area, and to improving software engineering strategies for game design.

	Reviews by Jacques Carette

	Modular product programs Eilers M., Müller P., Hitz S. ACM Transactions on Programming Languages and Systems 42(1): 1-37, 2019. Type: Article Some properties of programs are not about a single run of the program; instead, they relate multiple runs. For example, a program is deterministic if, given the same input, two runs will always produce the same answer. Many other properties of int...

	Photoplethysmogram-based cognitive load assessment using multi-feature fusion model Zhang X., Lyu Y., Qu T., Qiu P., Luo X., Zhang J., Fan S., Shi Y. ACM Transactions on Applied Perception 16(4): 1-17, 2019. Type: Article Physiological measures of cognitive load have become more accessible with advancements in neuro-imaging devices and wearable technology, and provide quantifiable data that previous measurement tools (for example, surveys) could not. As such, findi...

	A predicate transformer semantics for effects (functional pearl) Swierstra W., Baanen T. Proceedings of the ACM on Programming Languages 3(ICFP): 1-26, 2019. Type: Article Proving properties of imperative programs with side effects is quite arduous. Purely functional code, on the other hand, has a relatively pleasant equational theory that enables reasonable proofs. Is it possible to use modern machinery to make pro...

	Quantum relational Hoare logic Unruh D. Proceedings of the ACM on Programming Languages 3(POPL): 1-31, 2019. Type: Article All programs need to be verified--even post-quantum cryptography software. To prove properties of such protocols requires proofs that involve not only quantum programming, but also pairs of programs, an encryptor and an attacker. But proof al...

	Bayesian synthesis of probabilistic programs for automatic data modeling Saad F., Cusumano-Towner M., Schaechtle U., Rinard M., Mansinghka V. Proceedings of the ACM on Programming Languages 3(POPL): 1-32, 2019. Type: Article Somewhat overshadowed by neural networks (NN) is another thread in machine learning: the Bayesian-based approach. Less data hungry, it also has the promise of being closer to explainable artificial intelligence (XAI), although it hasn’t had ...

	more...