Modula

swMATH1224MaRDI QIDQ13964

No author found.

Related Items (only showing first 100 items - show all)

On the applicability of the longest-match rule in lexical analysis. ⋮ Unnamed Item ⋮ DMODULA: A distributed programming language ⋮ Unnamed Item ⋮ The natural representation of real numbers ⋮ Unnamed Item ⋮ Types for modules ⋮ Computability and implementability issues in abstract data types ⋮ A modula-2 kernel for supporting monitors ⋮ A partially formalized model of the type system in Modula-2 ⋮ Formatted syntaxes and modula-2 ⋮ Transformations of sequential specifications into concurrent specifications by synchronization guards ⋮ Compatibility problems in the development of algebraic module specifications ⋮ On the look-ahead problem in lexical analysis ⋮ Unnamed Item ⋮ Solving problems with automated reasoning, expert systems and neural networks ⋮ Unnamed Item ⋮ Solution of the neutron diffusion equation through multigrid methods implemented on a memory-coupled 25-processor system ⋮ Writing concurrent assemblers–a case study in path pascal ⋮ Estimating the execution complexity of logical specifications based on context-free grammars ⋮ Average case analysis of DJ graphs ⋮ A software architecture for distributed computer control systems ⋮ MUPPET: A programming environment for message-based multiprocessors ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Data dependence analysis in programs with pointers ⋮ Unnamed Item ⋮ The formal definition of a real-time language ⋮ Methods and means of parallel processing of information ⋮ Issues in the design of a parallel object-oriented language ⋮ Behandlung verschiedener INTEGER-Darstellungen durch optimierende Compiler ⋮ Verification of object-oriented programs: a transformational approach ⋮ From modula to oberon ⋮ The programming language oberon ⋮ Efficient expansion of factored expressions ⋮ Neuere Konzepte und Entwuerfe für Programmiersprachen ⋮ Optimal networks for distributing nonsequential programs ⋮ An abstract data type for name analysis ⋮ The oberon system ⋮ Canonical codings of \(\mathbb{N}{}^ k\) ⋮ Unnamed Item ⋮ Concepts in the Modula-90 database programming language ⋮ Type extensions ⋮ Unnamed Item ⋮ Program structures: Some new characterisations ⋮ Einführung in die Informatik. Algorithmenentwicklung. (Introduction into computer science. Development of algorithms.) ⋮ Discrete simulation. An introduction in Modula-2 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computer science. A fundamental introduction. Part 1: Problem oriented programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On a new approach to representation independent data classes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On removing the machine from the language ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ All structured programs have small tree width and good register allocation ⋮ Hardware/software co-design then and now ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Generating Uniformly Distributed Random Numbers without Floating Point Operations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Stable marriages by coroutines ⋮ Unnamed Item ⋮ Combining mascot with modula-2 to aid the engineering of real-time systems ⋮ Implementation of asynchronous parallel computations in control space ⋮ Implementation of the grid file: Design concepts and experience ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for software: Modula