The Java Series, Technical Advisor, Ken Arnold et al. · 1996
Method Declarations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189 9.4.1 Inheritance and Overriding . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189 9.4.2 Overloading . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 190 9.4.3 Examples of Abstract Method Declarations . . . . . . . . . . . . . . . 190 9.4.3.1 Example: Overriding . . . . . . . . . . . . . . . . . . . . . . . . 190 9.4.3.2 Example: Overloading . . . . . . . . . . . . . . . . . . . . . . . 191 10 Arrays. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193 10.1 Array Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194 10.2 Array Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 194 xii 10.3 Array Creation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 195 10.4 Array Access...
Cited by 0
Ib Holm Sorensen · Oxford University Research Archive (ORA) (University of Oxford) · 1982
Cited by 0
SpringerReference · 2011
Cited by 5
2001
This document may be copied, published and distributed to others, and certain derivative works of it may be prepared, copied, published, and distributed, in whole or in part, provided that the above copyright notice and this Copyright License and Disclaimer are included on al l such copies and derivative works. The only derivative works that are permissible under this Copyright License and Disclaimer are: (i) works which incorporate all or portion of this document for the purpose of providing commentary or explanation (such as an annotated version of the document), (ii) works which incorporate all or portion of this document for the purpose of incorporating features that provide accessibility, (iii) translations of this document into languages other than English and into differ ent formats and (iv) works by making use of this specification in standard conformant products by implementing (e.g. by copy and paste wholly or partly) the functionality therein. However, the content of this document itself may not be modified in any way, including by removing the copyright notice or references to Ecma International, except as required to translate it into languages other than English or into a different format.
Cited by 0
Jochen Ludewig · IFAC Proceedings Volumes · 1981
Cited by 2Open access
Jochen Ludewig · Annual Review in Automatic Programming · 1981
Cited by 1
Mohamed Riyadh Baghdadi, Albert Cohen, Tobias Grosser et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2015
Programming accelerators such as GPUs with low-level APIs and languages such as OpenCL and CUDA is difficult, error prone, and not performance-portable. Automatic parallelization and domain specific languages (DSLs) have been proposed to hide this complexity and to regain some performance portability. We present PENCIL, a rigorously-defined subset of GNU C99 with specific programming rules and few extensions. Adherence to this subset and the use of these extensions enable compilers to exploit parallelism and to better optimize code when targeting accelerators. We intend PENCIL both as a portable implementation language to facilitate the acceleration of applications,and as a tractable target language for DSL compilers.
Cited by 6Open access
Jeffrey H · 2003
Cited by 0
SpringerReference · 2011
Cited by 0
Hendrik Blockeel · Encyclopedia of Machine Learning · 2010
Cited by 0Open access
2012
Cited by 0
David Waltermire, Paul Cichonski, Karen Scarfone et al. · 2011
Cited by 0
2006
Cited by 0
Aleksej Dvojnev · Zenodo (CERN European Organization for Nuclear Research) · 2026
This document defines the A11 Language — a structured communication and intent‑formalization system used within Algorithm 11 (A11). The A11 Language transforms human intention into structured, interpretable, and machine‑processable form, enabling stable hybrid reasoning between human and AI agents. The specification describes the syntax, semantics, message types, frames, and interaction patterns that ensure clarity, reproducibility, and cognitive stability across all A11‑based systems.
Cited by 3Open access
Dan Micsa · Zenodo (CERN European Organization for Nuclear Research) · 2026
MinEnglish is a formal simplification and clarification of Modern English. It removes inherited irregularities while preserving the core vocabulary, phoneme inventory, and word order of English. The specification defines phonetic spelling, explicit quantitative marking, regular temporal operators, and symbolic operators intended to improve regularity, clarity, and compression. This record contains the PDF specification for MinEnglish. The underlying project reports an average 28.2% byte-length reduction across a 35-sentence comparison corpus versus standard American English.
Cited by 0Open access
Ib Sørensen · Oxford University Research Archive (ORA) (University of Oxford) · 1982
Cited by 0
Hugo Torres Vieira, Licenciatura Em Engenharia Informática · 2002
This document is a reference manual of the POLY programming language, covering it's syntax, type system and semantics.
Cited by 0
2011
Cited by 0
Eric J. Tyson · Open Scholarship Institutional Repository (Washington University in St. Louis) · 2005
Language X provides a formal and intuitive way to describe a series of interconnected processing fiblocks.fl Users of Language X may enter in a logical arrangement of blocks that describes the interconnection of their inputs and outputs. Language X also provides syntax for specifying implementation details for processing blocks and for targeting the entire architecture onto arbitrary sets of devices. Formally, Language X is a structure-only dataflow programming language (DFPL) that is heavily dependent on its library of functions.
Cited by 16Open access
Gerard O’Regan · Undergraduate topics in computer science · 2022
Cited by 0