The design of correct concurrent and distributed algorithms is notoriously difficult, and they are prone to errors such as deadlocks and race conditions. Model checking is one of the most successful formal techniques that are used to verify these algorithms. For example, TLC accepts models written in TLA+, a specification language based on mathematical set theory and the Temporal Logic of Actions. Such languages have a very different flavor from the (pseudo-)programming languages that algorithm designers typically use to express algorithms. PLUSCAL introduced by Leslie Lamport, is a high-level language for describing concurrent and distributed algorithms, from which TLA+ models are generated and then analyzed using TLC. Unfortunately, PLUSCAL suffers from a number of limitations that restricts its usefulness as an abstraction layer for the underlying TLA+ formalism.