TL;DR: A method for giving a semantics to a Larch interface language specification by a translation of the specification into typed first-order logic is described.
Abstract: We describe a method for giving a semantics to a Larch interface language specification by a translation of the specification into typed first-order logic. This is illustrated using LM3, a Larch/Modula-3 interface language.
TL;DR: This latest version of Sedgewick's well-known book provides a comprehensive collection of algorithms implemented in the Modula-3 programming language and shows how key algorithms can be implemented, run, debugged, and used in real applications.
Abstract: This latest version of Sedgewick's well-known book provides a comprehensive collection of algorithms implemented in the Modula-3 programming language. Readers will see how key algorithms can be implemented, run, debugged, and used in real applications.
TL;DR: Two modem programming languages — Modula-3 and Oberon-2 — are compared in respect to the way how they handle module interfaces, type equivalence, subtyping, concurrency and exception-handling.
Abstract: Two modem programming languages — Modula-3 and Oberon-2 — are compared in respect to the way how they handle module interfaces, type equivalence, subtyping, concurrency and exception-handling. An assessment of the two languages is given discussing the value and cost of every feature.
TL;DR: The occurrence of clones is highly dependent on the system architecture, development model, language peculiarities, and software management practices.
Abstract: Software engineers often build new subprograms by cloning (copying) an existing one with similar requirements, and then slightly modifying it. While this may be easier than factoring the common part out, and sharing it from a library, it increases the system size and often leads to higher maintenance costs. The occurrence of clones is highly dependent on the system architecture, development model, language peculiarities, and software management practices.