The POPLmark challenge is a benchmark problem designed to advance research in the field of programming languages and formal verification. It was introduced in a paper titled "The POPLmark Challenge" by Andrew C. Myers, et al., in the context of the 2007 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). The challenge focuses on type systems for programming languages, specifically those involving features like polymorphism, subtyping, and aliasing.
New to topics? Read the docs here!