Narrow your search

Library

ULiège (2)

AP (1)

EhB (1)

KBR (1)

KDG (1)

KU Leuven (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLouvain (1)

More...

Resource type

book (3)

digital (1)


Language

English (4)


Year
From To Submit

2011 (3)

1995 (1)

Listing 1 - 4 of 4
Sort by
Algorithms, concurrency and knowledge. 1995 Asian computing science conference, ACSC 95, Thailand, Decmeber 1995. Proceedings
Authors: ---
ISBN: 3540606882 0387606882 3540492623 9783540606888 Year: 1995 Volume: 1023 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This volume constitutes the refereed proceedings of the 1995 Asian Computing Science Conference, ACSC 95, held in Pathumthani, Thailand in December 1995. The 29 fully revised papers presented were selected from a total of 102 submissions; clearly the majority of the participating researchers come from South-East Asian countries, but there is also a strong international component. The volume reflects research activities, particularly by Asian computer science researchers, in different areas. Special attention is paid to algorithms, knowledge representation, programming and specification languages, verification, concurrency, networking and distributed systems, and databases.


Book
Introduction to the Theory of Programming Languages
Authors: ---
ISBN: 0857290754 0857290762 Year: 2011 Publisher: London : Springer London : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The design and implementation of programming languages, from Fortran and Cobol to Caml and Java, has been one of the key developments in the management of ever more complex computerized systems. Introduction to the Theory of Programming Languages gives the reader the means to discover the tools to think, design, and implement these languages. It proposes a unified vision of the different formalisms that permit definition of a programming language: small steps operational semantics, big steps operational semantics, and denotational semantics, emphasising that all seek to define a relation between three objects: a program, an input value, and an output value. These formalisms are illustrated by presenting the semantics of some typical features of programming languages: functions, recursivity, assignments, records, objects, ... showing that the study of programming languages does not consist of studying languages one after another, but is organized around the features that are present in these various languages. The study of these features leads to the development of evaluators, interpreters and compilers, and also type inference algorithms, for small languages.


Digital
Introduction to the Theory of Programming Languages
Authors: ---
ISBN: 9780857290762 Year: 2011 Publisher: London Springer London

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Introduction to the Theory of Programming Languages
Authors: --- ---
ISBN: 9780857290762 Year: 2011 Publisher: London Springer London

Loading...
Export citation

Choose an application

Bookmark

Abstract

The design and implementation of programming languages, from Fortran and Cobol to Caml and Java, has been one of the key developments in the management of ever more complex computerized systems. Introduction to the Theory of Programming Languages gives the reader the means to discover the tools to think, design, and implement these languages. It proposes a unified vision of the different formalisms that permit definition of a programming language: small steps operational semantics, big steps operational semantics, and denotational semantics, emphasising that all seek to define a relation between three objects: a program, an input value, and an output value. These formalisms are illustrated by presenting the semantics of some typical features of programming languages: functions, recursivity, assignments, records, objects, ... showing that the study of programming languages does not consist of studying languages one after another, but is organized around the features that are present in these various languages. The study of these features leads to the development of evaluators, interpreters and compilers, and also type inference algorithms, for small languages.

Listing 1 - 4 of 4
Sort by