| |
|
|
| |
| | 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. |
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 10
reviews
|
|
|
 |
|
|
|
|
 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&...
|
Jun 3 2020 |
|
|
|
|
|
|
Computational mathematics with SageMath
Zimmermann P., Casamayou A., Cohen N., Connan G., Dumont T., Fousse L., Maltey F., Meulien M., Mezzarobba M., Pernet C., Thiry N., Bray E., Cremona J., Forets M., Ghitza A., Thomas H., SIAM-Society for Industrial and Applied Mathematics, Philadelphia, PA, 2018. 464 pp. Type: Book (978-1-611975-45-1)
SageMath is by now a well-established system for computational mathematics. It is used by many researchers, as well as increasingly in classrooms. While there is a wealth of material online to learn it, including many published papers,...
|
Sep 23 2019 |
|
|
|
|
|
|
Differential hybrid games
Platzer A. ACM Transactions on Computational Logic 18(3): 1-44, 2017. Type: Article
As software becomes ever more pervasive in safety-critical devices--from pacemakers to cars, from robots to airplanes--it is important that we have means of insuring their safety. For some of the more advanced applica...
|
Mar 22 2018 |
|
|
|
|
|
|
Markov chains and Markov decision processes in Isabelle/HOL
Hölzl J. Journal of Automated Reasoning 59(3): 345-387, 2017. Type: Article
The intermingling of rather different domains can, at times, produce rather interesting results. Here the author explores the intersection of probability theory (in the guise of Markov chains and Markov decision processes) and formal p...
|
Jan 11 2018 |
|
|
|
|
|
|
SC-Haskell: sequential consistency in languages that minimize mutable shared heap
Vollmer M., Scott R., Musuvathi M., Newton R. PPoPP 2017 (Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Austin, TX, Feb 4-8, 2017) 283-298, 2017. Type: Proceedings
Concurrency remains a hard problem. Efficient concurrency is even harder. But what if there were a setting where writing correct concurrent programs was significantly easier, at a very modest cost in efficiency? Too good to be true, ri...
|
Aug 11 2017 |
|
|
|
|
|
|
Computational complexity via finite types
Asperti A. ACM Transactions on Computational Logic 16(3): 1-25, 2015. Type: Article
Undergraduate-level computer science can feel disjointed at times: for example, at that level, one feels that operating systems and programming languages are entirely separate subdisciplines, whose practitioners have apparently never s...
|
Sep 1 2015 |
|
|
|
|
|
|
Towards a linear algebra of programming
Oliveira J. Formal Aspects of Computing 24(4-6): 433-458, 2012. Type: Article
We are, by now, quite used to relational interpretations of program semantics. Such interpretations live in a rich algebraic world. What if we wanted to use a probabilistic interpretation instead? Well, it turns out that this is a cons...
|
Jul 29 2014 |
|
|
|
|
|
|
Families of algorithms for reducing a matrix to condensed form
Van Zee F., van de Geijn R., Quintana-Ortí G., Elizondo G. ACM Transactions on Mathematical Software 39(1): 1-32, 2012. Type: Article
As hardware continues to change, developers look for ways to maintain compatibility with current platforms. Right now, the principal issue is that memory bandwidth has not kept up with other changes in hardware, which constrains the pe...
|
Feb 22 2013 |
|
|
|
|
|
|
Pearls of functional algorithm design
Bird R., Cambridge University Press, New York, NY, 2010. 290 pp. Type: Book (978-0-521513-38-8)
Most books on algorithm design are thoroughly imperative, sometimes with a thin veneer of object-oriented lacquer, to appeal to a larger audience. But it is slowly dawning on the computing community that these methods do not work so we...
|
Jul 21 2011 |
|
|
|
|
|
|
Refunctionalization at work
Danvy O., Millikin K. Science of Computer Programming 74(8): 534-549, 2009. Type: Article
Don’t let the title fool you--this paper is only partly about the technical details of some seemingly obscure program transformation technique. This engagingly written paper brings the reader along a much richer disc...
|
Jan 7 2010 |
|
|
|
|
|
| |
|
|
| |
|
|
