Results 111 to 120 of about 8,375 (166)

A category theory for programming languages

Mathematical Systems Theory, 1973
The paper first shows how the categorical theory of sequences is useful in explaining properties of the (word) differentiation of Brzozowski (1964). Then, the paper shows how a more general theory of languages, including both procedural and functional languages, should be constructed by using a switch proposition that extends the common equivalence ...
openaire   +1 more source

Array theory and the nial programming language

BIT, 1988
The nested interactive array language Nial is based on a mathematical theory of hierarchical rectangular arrays known as array theory. This paper gives a brief introduction to array theory and Nial and then discusses the main characteristics of the Nial language, its current implementation and some of its applications.
openaire   +1 more source

Toward a semiotic theory of programming languages

ACM SIGPLAN Notices, 1968
Based on previous results in a variety of related areas, a schema is described to produce a unified semiotic theory specifically applicable to programming languages. An alternative to BNF-like descriptions is referred to, and the structure of the semantic and pragmatic components is outlined.
openaire   +1 more source

Theories of Programming Languages

1998
First published in 1998, this textbook is a broad but rigourous survey of the theoretical basis for the design, definition and implementation of programming languages and of systems for specifying and proving programme behaviour. Both imperative and functional programming are covered, as well as the ways of integrating these aspects into more general ...
openaire   +1 more source

REMARKS ON THEORIES OF COMPUTATION AND SEMANTICS OF PROGRAMMING LANGUAGES

Kybernetes, 1978
Theories of computation related to the semantics of programming languages, like those of McCarthy and Scott, rely on non‐constructive mathematical “ideas.” Turing's theory does not assume any mathematical “ideas.” In the approaches of Floyd, McCarthy and Scott the attempt is to develop a general theory of “meaning of programs” and then to consider the ...
openaire   +1 more source

Programming Languages as Mathematical Theories

2010
That computer science is somehow a mathematical activity was a view held by many of the pioneers of the subject, especially those who were concerned with its foundations. At face value it might mean that the actual activity of programming is a mathematical one. Indeed, at least in some form, this has been held.
openaire   +1 more source

Applying Theories in Language Programs

2017
Selected Topics in Applied Linguistics: How to Choose a Theory. I offer a critical exploration of some of the conditions involved in Instructed Second Language Acquisition (ISLA), as well as of the paradoxical approaches in the theoretical questions, methods, categories, and perspectives of ISLA.
openaire   +1 more source

Theory of Programming Languages: Design and Implementation

2022
The textbook has been prepared in accordance with the State educational Standard in the fields of "Computer Science and Computer Engineering" (09.03.01), "Applied Computer Science" (09.03.03) for the cycle of disciplines of information specialties.
openaire   +1 more source

Problems in the Theory of Programming Languages

1968
Publisher Summary The theory of programming languages is usually divided into syntax, semantics, and pragmatics. It is clear that for practical purposes, pragmatic problems are the most important. Consequently, most of the efforts in programming languages have been spent in this field.
openaire   +1 more source

Universal domains in the theory of denotational semantics of programming languages

[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, 2002
The authors present a categorical generalization of a well-known result in model theory, the Fraisse-Jonsson theorem, by which they characterize large classes of reasonable categories if they contain universal homogeneous objects. As a first application, they derive from this, for various categories of bifinite domains and with embedding-projection ...
Manfred Droste, Rüdiger Göbel
openaire   +1 more source