Skip to main content

The L-Language for the Parallel L-Machine (A Parallel Architecture for AI Applications)

  • Conference paper
Österreichische Artificial Intelligence-Tagung

Part of the book series: Informatik-Fachberichte ((2252,volume 106))

Abstract

The L-language, a language for programming parallel computer architectures especially suited for symbolic computation, is presented. The main goal of the language design is the explicit description of the interconnection structure of the system. Our aproach allows even recursive descriptions of the interconnection topology. The interconnection structures defined by L-programs can be realized on the parallel L-machine developed in the CAMP-LINZ working group.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aspetsberger, K., 85: Towards Parallel Machines for Artificial Intelegence: Realisation of the Alice Architecture by L-Components, this conference.

    Google Scholar 

  2. Buchberger, B., 78: Computer-Trees and Their Programming. Proc. 4th Coll: Computer-Trees and Their Programming. Proc. 4th Coll. “Trees in Algebra and Programming”, Univ. Lille, Feb. 16–18, 1978, pp. 1–18.

    Google Scholar 

  3. Buchberger B., Fegerl J., 78: A Universal Module for the Hardware-Implementation of Recursion. Univ. Linz, Inst. f. Mathematik, Report Nr. 106.

    Google Scholar 

  4. Buchberger, B., 83: Components for Restructurable Multi-Micro-Processor Systems of Arbitrary Topology. Proc. of MIMI 83 (Lugano), Acta Press Anaheim, pp. 67–71.

    Google Scholar 

  5. Buchberger, B., 84: The Present State of the L-Networks Project. Proc. of MIMI 84 (Bari), Acta Press Anaheim, pp. 178–181.

    Google Scholar 

  6. Bibel W., Buchberger B., 84: Towards a Connection Machine for Logical Inference. (Invited talk, Int. Symp. on Fifth Generation and Super Computers, Rotterdam, December 84) To appear in: Future Generations Computer Systems, North Holland.

    Google Scholar 

  7. Wirth, N., 82: Programming in Modul a-2. Springer-Verlag, Berlin Heidelberg New York.

    Google Scholar 

  8. National Semiconductor Corporation, 83: NS16000 Instruction Set Reference Manual.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hintenaus, P., Buchberger, B. (1985). The L-Language for the Parallel L-Machine (A Parallel Architecture for AI Applications). In: Trost, H., Retti, J. (eds) Österreichische Artificial Intelligence-Tagung. Informatik-Fachberichte, vol 106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46552-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46552-9_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15695-6

  • Online ISBN: 978-3-642-46552-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics