Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Lambda calculus.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Lambda calculus.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This textbook explains the basic principles of categorical type theory and the techniques used to derive categorical semantics for specific type theories. It introduces the reader to ordered set theory, lattices and domains, and this material provides plenty of examples for an introduction to category theory. which covers categories, functors, natural transformations, the Yoneda lemma, cartesian closed categories, limits, adjunctions and indexed categories. Four kinds of formal system are considered in detail, namely algebraic, functional, polymorphic functional, and higher order polymorphic functional type theory. For each of these the categorical semantics are derived and results about the type systems are proved categorically. Issues of soundness and completeness are also considered. Aimed at advanced undergraduates and beginning graduates, this book will be of interest to theoretical computer scientists, logicians and mathematicians specialising in category theory.

Categories (Mathematics) --- Lambda calculus.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modelling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.

Lambda calculus. --- Programming languages (Electronic computers) --- Semantics.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logique mathématique --- Logique générale --- Lambda-calculus --- Logique générale --- Lambda-calculus