LUKKO(ID:1043/luk001)

Finnish abstraction microprogramming language 


for Logical language for the Ukko machine

Juha Heinanen, Tempere, Finland 1983.

An object-oriented microprogramming language, influenced by Alphard and Modula.



Structures:
Related languages
Alphard => LUKKO   Influence
Modula => LUKKO   Influence

References:
  • Heinänen, J., "Logical architecture of Ukko - a design for experimental microprogramming" University of Tampere, Dept. of Mathematical Sciences, Report C5, July 1978, revised April 1979. view details
  • R. Kurki-Suonio and J. Heinänen "A data abstraction language based on microprogramming" pp154-161 1980 view details
          in Proceedings of the 13th International Symposium on Microarchitecture Springs, Colorado, United States 1980 view details
  • Heinanen, Juha "A Data and Control Abstraction Approach to Microprogramming", Publ 18, Tampere U of Tech, Tampere, Finland, 1983. view details Abstract: The paper describes the basic ideas in extending a machine-oriented microprogramming language into a system implementation language through data and control abstraction. The approach allows an extremely primitive base language to be bootstrapped to a higher level by a type definition mechanism where the operations of the types may be microprogrammed. Vertical migration is then possible by local modifications in operation definitions. On the other hand, a suitable type definition library would make it unnecessary for an ordinary user to know that all operations are ultimately based on microprogrammed definitions. This work is part of project Ukko which has designed a special microprogrammable computer for experimentation with user microprogramming.
          in Proceedings of the 13th International Symposium on Microarchitecture Springs, Colorado, United States 1980 view details
  • Heinänen, Juha "A programmer controlled approach to data and control abstraction" pp41-52 view details Abstract: Traditionally, data abstraction languages have only provided a means to extend the language “upward” to include new procedures and data types not present in the base language. This paper introduces a complementary approach, which also allows programmers to extend the language “downward” and thus to override many of the previously preempted decisions concerning the nature and implementation of various language constructs. In order to illustrate the approach, several extension examples are presented that involve control of decisions below the level of Pascal-like languages. Implementation of the programmer defined language constructs is also discussed and benchmark results are reported that show them comparable—and in many cases exceeding—in efficiency the corresponding built-in constructs of conventional languages.
          in Proceedings of the SIGPLAN '83 symposium on Programming language issues in software systems 1983, San Francisco view details