Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Browse subjects
  3. Computer Science
  4. Programming Languages and Applied Logic
  5. Content listing

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

5646 results in Programming Languages and Applied Logic

Page 105 of 283

  • Preface

  • Henk Barendregt, Radboud Universiteit Nijmegen, Wil Dekkers, Radboud Universiteit Nijmegen, Richard Statman
  • Book:
    Lambda Calculus with Types
    Published online:
    05 August 2013
    Print publication:
    20 June 2013, pp ix-x

  • Summary

    This book is about lambda terms typed using simple, recursive and intersection types. In some sense it is a sequel to Barendregt (1984).That book is about untyped lambda calculus. Types give the untyped terms more structure: function applications are allowed only in some cases. In this way one can single out untyped terms having special properties. But there is more to it. The extra structure makes the theory of typed terms quite different from the untyped ones.

    The emphasis of the book is on syntax. Models are introduced only insofar as they give useful information about terms and types or if the theory can be applied to them.

    The writing of this book has been different from the one on untyped lambda calculus. First of all, since many researchers are working on typed lambda calculus, we were aiming at a moving target. Moreover there has been a wealth of material to work with. For these reasons the book was written by several authors. Several long-term open problems have been solved during the period the book was written, notably the undecidability of lambda definability in finite models, the undecidability of second-order typability, the decidability of the unique maximal theory extending βη-conversion and the fact that the collection of closed terms of not every simple type is finitely generated, and the decidability of matching at arbitrary types of order higher than 4. The book has not been written as an encyclopedic monograph: many topics are only partially treated; for example, reducibility among types is analyzed only for simple types built up from only one atom.

Noncommutative Rational Series with Applications
  • Jean Berstel, Christophe Reutenauer
  • Published online:
    05 June 2013
    Print publication:
    14 October 2010
  • The algebraic theory of automata was created by Schützenberger and Chomsky over 50 years ago and there has since been a great deal of development. Classical work on the theory to noncommutative power series has been augmented more recently to areas such as representation theory, combinatorial mathematics and theoretical computer science. This book presents to an audience of graduate students and researchers a modern account of the subject and its applications. The algebraic approach allows the theory to be developed in a general form of wide applicability. For example, number-theoretic results can now be more fully explored, in addition to applications in automata theory, codes and non-commutative algebra. Much material, for example, Schützenberger's theorem on polynomially bounded rational series, appears here for the first time in book form. This is an excellent resource and reference for all those working in algebra, theoretical computer science and their areas of overlap.

Systematic Program Design
  • From Clarity to Efficiency
  • Yanhong Annie Liu
  • Published online:
    05 June 2013
    Print publication:
    20 May 2013
  • A systematic program design method can help developers ensure the correctness and performance of programs while minimizing the development cost. This book describes a method that starts with a clear specification of a computation and derives an efficient implementation by step-wise program analysis and transformations. The method applies to problems specified in imperative, database, functional, logic and object-oriented programming languages with different data, control and module abstractions. Designed for courses or self-study, this book includes numerous exercises and examples that require minimal computer science background, making it accessible to novices. Experienced practitioners and researchers will appreciate the detailed examples in a wide range of application areas including hardware design, image processing, access control, query optimization and program analysis. The last section of the book points out directions for future studies.

  • 0 - Introduction

  • Andrew M. Pitts, University of Cambridge
  • Book:
    Nominal Sets
    Published online:
    05 July 2013
    Print publication:
    30 May 2013, pp 1-10

  • Summary

    This is a book about names and symmetry in the part of computer science that has to do with programming languages. Although symmetry plays an important role in many branches of mathematics and physics, its relevance to computer science may not be so clear to the reader. This introduction explains the computer science motivation for a theory of names based upon symmetry and provides a guide to what follows.

    Atomic names

    Names are used in many different ways in computer systems and in the formal languages used to describe and construct them. This book is exclusively concerned with what Needham calls ‘pure names’:

    A pure name is nothing but a bit-pattern that is an identifier, and is only useful for comparing for identity with other such bit-patterns – which includes looking up in tables to find other information. The intended contrast is with names which yield information by examination of the names themselves, whether by reading the text of the name or otherwise. […] like most good things in computer science, pure names help by putting in an extra stage of indirection; but they are not much good for anything else.

    (Needham, 1989, p. 90)

    We prefer to use the adjective ‘atomic’ rather than ‘pure’, because for this kind of name, internal structure is irrelevant; their only relevant attribute is their identity. Although such names may not be much good for anything other than indirection, that one thing is a hugely important and very characteristic aspect of computer science.

Page 105 of 283