MattPD

• Teaching Compilers: https://danghica.blogspot.com/2020/04/teaching-compilers.html
• Thought Experiment: An Introductory Compilers Class: https://semantic-domain.blogspot.com/2020/02/thought-experiment-introductory.html
• Undergrad Compilers from the Hive Mind: https://eschew.wordpress.com/2020/01/26/undergrad-compilers-from-the-hive-mind/
• ChocoPy: A Programming Language for Compilers Courses: https://chocopy.org/
• Bril: An Intermediate Language for Teaching Compilers: https://www.cs.cornell.edu/~asampson/blog/bril.html
• My First Fifteen Compilers: https://blog.sigplan.org/2019/07/09/my-first-fifteen-compilers/
• Teaching Compilers Backward: https://blog.sigplan.org/2021/02/23/teaching-compilers-backward/
• Teaching and Learning Compilers Incrementally
  • ICFP 2023 Tutorial; Jeremy G. Siek
• https://www.youtube.com/watch?v=UJURb9H_q3A

MattPD

C++ links: Type Erasure

https://github.com/MattPD/cpplinks / C++ / Type Erasure

(draft; work in progress)

Type Erasure

• Back to Basics: Type Erasure
  • CppCon 2019; Arthur O'Dwyer

MattPD

C++ links: Performance Modeling: Criticality

https://github.com/MattPD/cpplinks / Performance / Modeling

See also:

• performance tools
  • microarchitecture

Criticality

MattPD

C++ links: Modules

https://github.com/MattPD/cpplinks / C++ Standard / C++20 / Modules

Contents

• Readings: WG21 papers
• Talks: 2024, 2021, 2020, 2019, 2018, 2017

---

MattPD

Correctness in Practice

Formal Methods and Program Analysis in Industry

(draft)

See also: Compilers: correctness, Software Verification Literature Review (https://alastairreid.github.io/RelatedWork/papers/)

2023

MattPD

Program Analysis Resources

(draft; work in progress)

See also:

• Compilers
  • correctness
• Program analysis:
• Dynamic analysis - instrumentation, translation, sanitizers

MattPD

C++ links: Coroutines

https://github.com/MattPD/cpplinks / C++ Standard / C++20 / Coroutines

(draft; work in progress)

#coroutines (C++ Slack): https://cpplang.slack.com/archives/C5JS5JXT5

Contents

MattPD

/* Running:
BNSIZE=10000; BNQUERIES=1000

./find --param=size:$BNSIZE --param=queries:$BNQUERIES >
  results.size=$BNSIZE.queries=$BNQUERIES.txt

./find --param=size:$BNSIZE --param=queries:$BNQUERIES --reporter=html
  --output=results.size=$BNSIZE.queries=$BNQUERIES.html
*/

MattPD

Related to discussion of
http://larshagencpp.github.io/blog/2016/05/01/a-cache-miss-is-not-a-cache-miss
at https://twitter.com/gregerlars/status/726781584481878017

Three variants:
- Simple: cacheS
- Pointer: cacheP
- LinkedList: cacheL

Context -- looking at average stall durations, we can confirm that cacheL wastes considerably more instruction slots than cacheP, which wastes only somewhat more instruction slots than cacheS:

MattPD

// Boost.Hana solution
// issue: http://baptiste-wicht.com/posts/2015/07/simulate-static_if-with-c11c14.html
// docs w/ explanation: http://ldionne.com/hana/#tutorial-introspection-is_valid

#include <iostream>
#include <string>

#include <boost/hana.hpp>

auto has_pop_back = boost::hana::is_valid([](auto && obj) -> decltype(obj.pop_back()) { });