The Modula programming language is a descendant of the Pascal programming language. It was developed in Switzerland in the 1970s by Niklaus Wirth, the same person who designed Pascal. The main innovation of Modula over Pascal is a module system, used for grouping sets of related declarations into program units; hence the name Modula. The language is defined in a report by Wirth called Modula. A language for modular multiprogramming published 1976.[1] Modula was first implemented by Niklaus Wirth himself on a PDP-11. Very soon other implementations followed, most important the University of York Modula compiler and a compiler developed at Philips Laboratories named PL Modula, which generated code for the LSI-11 microprocessor. The development of Modula was discontinued soon after its publication. Wirth then concentrated his efforts on Modula’s successor, Modula-2 (wikipedia)

References in zbMATH (referenced in 46 articles , 2 standard articles )

Showing results 1 to 20 of 46.
Sorted by year (citations)

1 2 3 next

  1. Müller, Peter (ed.); Schaefer, Ina (ed.): Principled software development. Essays dedicated to Arnd Poetzsch-Heffter on the occasion of his 60th birthday. Selected papers based on the presentations at the symposium, Kaiserslautern, Germany, November 2018 (2018)
  2. Apt, Krzysztof R.; De Boer, Frank S.; Olderog, Ernst-Rüdiger; De Gouw, Stijn: Verification of object-oriented programs: a transformational approach (2012)
  3. Blieberger, Johann: Average case analysis of DJ graphs (2006)
  4. Russo, Claudio V.: Types for modules (2004)
  5. Wirth, Niklaus: Hardware/software co-design then and now (2003)
  6. Yang, Wuu; Tsay, Chey-Woei; Chan, Jien-Tsai: On the applicability of the longest-match rule in lexical analysis. (2002)
  7. Hashimoto, M.; Ohori, A.: A typed context calculus (2001)
  8. David F. Bacon, Robert E. Strom, Ashis Tarafdar: Guava: a dialect of Java without data races (2000) not zbMATH
  9. Radenski, Atanas: Module embedding. (1998) ioport
  10. Thorup, Mikkel: All structured programs have small tree width and good register allocation (1998)
  11. Flatt, Matthew; Felleisen, Matthias: Program units as higher-order modules (1997)
  12. Läufer, Konstantin: Type classes with existential types (1996)
  13. Radenski, A. A.: Introducing objects and parallelism to an imperative programming language. (1995) ioport
  14. Yang, Wuu: On the look-ahead problem in lexical analysis (1995)
  15. McIntosh, Aubrey; Brodbelt, Jennifer: The natural representation of real numbers (1993)
  16. Reiser, Martin; Wirth, Niklaus: Programming in Oberon. Steps beyond Pascal and Modula (1992)
  17. Kastens, U.; Waite, W. M.: An abstract data type for name analysis (1991)
  18. Wirth, N.: From Modula to Oberon (1991)
  19. Ehrig, Hartmut; Fey, Werner; Hansen, Horst; Löwe, Michael; Jacobs, Dean; Parisi-Presicce, Francesco: Compatibility problems in the development of algebraic module specifications (1990)
  20. Guenther, G. R.: Efficient expansion of factored expressions (1990)

1 2 3 next