Gerunds and representations
| Autor: | Robert Bernecky, Roger K. W. Hui |
|---|---|
| Rok vydání: | 1991 |
| Předmět: |
Recursion
Gerund Syntax (programming languages) Computer science Semantics (computer science) business.industry General Medicine computer.software_genre Linguistics Switch statement Noun Selection (linguistics) Artificial intelligence Control (linguistics) business computer Natural language processing |
| Zdroj: | APL |
| DOI: | 10.1145/114054.114059 |
| Popis: | Gerunds, verbal forms that can be used as nouns, are recognized as having utility in the realm of programming languages. We show that gerunds can be viewed as arrays of atomic representations of verbs (functions), in a way which is consistent with the syntax and semantics of APL, and which allows verbs to be first class objects in the language. We define derivations of verbs from gerunds in the J dialect of APL, and show how these derivations provide control structures for sequencing, selection (in the sense of generalized forms of CASE or SWITCH statements and IF/THEN/ELSE), iteration (DO UNTIL), recursion, and parallel computation (MIMD, or Multiple Instruction, Multiple Data). We conclude with alternative representations of verbs which are useful in other contexts. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|