Implementing CCS, the LCS experiment

Implementing CCS, the LCS experiment (1989)

by Bernard Berthomieu

Citations:

5 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Implementing CCS, the LCS experiment	user correction - Legacy Corrections
AUTHOR NAME	Bernard Berthomieu	SVM HeaderParse 0.1
AUTHOR AFFIL	; LAAS-CNRS*	SVM HeaderParse 0.2
AUTHOR ADDR	; 7, avenue du Colonel Roche, 31077 Toulouse Cedex	SVM HeaderParse 0.1
ABSTRACT	machine is implemented with 8 registers and the stack. These registers are E (environment, a linked list), C (the cell packing the code), PC (program counter), R (resumption register, a stack height), P (process positions, encoded as pairs of values), L (process lines, encoded as linked lists), G (positions accumulator, encoded as P) and Rp (ready processes, encoded as a queue of processes); the stack provided by the Format layer encodes both the S and D abstract registers. There are about 40 basic instructions, plus a number of derived instructions representing frequent sequences of the former, and about 70 primitives (logic, arithmetic, input/output, etc,).	user correction - Legacy Corrections
YEAR	1989	user correction - Legacy Corrections
CITATIONS	16 found	ParsCit 1.0