You need JavaScript to view this

Programming list processes. SLIP: symmetric list processor - applications; Le traitement de listes en programmation. SLIP: langage de listes symetrique - applications

Abstract

Modern aspects of programming languages are essentially turned towards list processing. The ordinary methods of sequential treatment become inadequate and we must substitute list processes for them, where the cells of a group have no neighbourhood connection, but where the address of one cell is contained in the preceding one. These methods are required in 'time sharing' solving problems. They also allow us to treat new problems and to solve others in the shortest time. Many examples are presented after an abstract of the most usual list languages and a detailed study of one of them : SLIP. Among these examples one should note: locating of words in a dictionary or in a card index, treatment of non numerical symbols, formal derivation. The problems are treated in Fortran II on an IBM 7094 machine. The subroutines which make up the language are presented in an appendix. (author) [French] La programmation moderne ne se satisfait plus des methodes classiques de traitement sequentiel ni des tableaux a positions de memoire contigues. Elle tend a generaliser les methodes de listes ou les cellules d'un groupe n'ont pas de relation de voisinage, mais sont enchainees en listes, l'une donnant l'adresse machine de l'autre. Ces  More>>
Authors:
Broudin, Y [1] 
  1. Commissariat a l'Energie Atomique, Centre d'Etudes Nucleaires de Saclay, 91 - Gif-sur-Yvette (France)
Publication Date:
Jun 01, 1966
Product Type:
Technical Report
Report Number:
CEA-R-3040
Resource Relation:
Other Information: 10 refs; PBD: Jun 1966
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; FORTRAN; LISP; MEMORY MANAGEMENT; PROGRAMMING; S CODES
OSTI ID:
20468586
Research Organizations:
Commissariat a l'Energie Atomique, Centre d'Etudes Nucleaires de Saclay, 91 - Gif-sur-Yvette (France)
Country of Origin:
France
Language:
French
Other Identifying Numbers:
TRN: FR04R3040044296
Availability:
Available from INIS in electronic form
Submitting Site:
FRN
Size:
[152] pages
Announcement Date:
Jun 18, 2004

Citation Formats

Broudin, Y. Programming list processes. SLIP: symmetric list processor - applications; Le traitement de listes en programmation. SLIP: langage de listes symetrique - applications. France: N. p., 1966. Web.
Broudin, Y. Programming list processes. SLIP: symmetric list processor - applications; Le traitement de listes en programmation. SLIP: langage de listes symetrique - applications. France.
Broudin, Y. 1966. "Programming list processes. SLIP: symmetric list processor - applications; Le traitement de listes en programmation. SLIP: langage de listes symetrique - applications." France.
@misc{etde_20468586,
title = {Programming list processes. SLIP: symmetric list processor - applications; Le traitement de listes en programmation. SLIP: langage de listes symetrique - applications}
author = {Broudin, Y}
abstractNote = {Modern aspects of programming languages are essentially turned towards list processing. The ordinary methods of sequential treatment become inadequate and we must substitute list processes for them, where the cells of a group have no neighbourhood connection, but where the address of one cell is contained in the preceding one. These methods are required in 'time sharing' solving problems. They also allow us to treat new problems and to solve others in the shortest time. Many examples are presented after an abstract of the most usual list languages and a detailed study of one of them : SLIP. Among these examples one should note: locating of words in a dictionary or in a card index, treatment of non numerical symbols, formal derivation. The problems are treated in Fortran II on an IBM 7094 machine. The subroutines which make up the language are presented in an appendix. (author) [French] La programmation moderne ne se satisfait plus des methodes classiques de traitement sequentiel ni des tableaux a positions de memoire contigues. Elle tend a generaliser les methodes de listes ou les cellules d'un groupe n'ont pas de relation de voisinage, mais sont enchainees en listes, l'une donnant l'adresse machine de l'autre. Ces methodes sont indispensables en 'partage de temps' et dans les traitements en 'temps reel'. De plus, elles permettent de traiter des problemes nouveaux et d'optimiser le temps de traitement de nombreux autres. De nombreux exemples sont traites, apres un resume des langages les plus utilises et une etude plus precise d'un langage de listes: SLIP. Parmi les exemples traites signalons la recherche lexicographique, le traitement de symboles alphanumeriques, la derivation formelle. Probleme traite en Fortran II sur IBM 7094. Les sous-programmes constitutifs du langage sont fournis en annexe. (auteur)}
place = {France}
year = {1966}
month = {Jun}
}