Open AccessType Checking in a Typeless Language
Author(s) -
C. J. Higley
Publication year - 1976
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/19.2.166
Subject(s) - computer science , flexibility (engineering) , value (mathematics) , type (biology) , programming language , algorithm , mathematics , statistics , machine learning , ecology , biology
To obtain flexibility and efficiency, BCPL was designed as a typeless language. Despite this, every value used in a BCPL program may be shown to have an implicit type associated with it and these implicit types obey certain run-time rules. Violation of these rules may be trapped, leading to improved facilities for error detection and correction, without restrictions on the language. (Received December 1974)
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom