List structures in SIMULA and PL/1—a comparison
Jacob Palme · Software Practice and Experience · 1974
Abstract A typical list structurre application program was written in both SIMULA and PL/1. The program was executed using the IBM 360/370 SIMULA and PL/1 optimizing compilers. SIMULA was found to give shorter compile time, about the same execution time and larger memory requirement than PL/1. The source program for the same algorithm was shorter in SIMULA. The SIMULA system could discover semantic programming errors earlier and diagnose them better them PL/1.