Progress in Theoretical Computer Science – serie
Visar alla böcker i serien Progress in Theoretical Computer Science. Handla med fri frakt och snabb leverans.
39 produkter
Canonical Equational Proofs
Av Bachmair
Häftad, 1991
552 kr
Lägg i varukorg
Equations occur in many computer applications, such as symbolic compu tation, functional programming, abstract data type specifications, program verification, program synthesis, and automated theorem proving. Rewrite systems are directed equations used to compute by replacing subterms in a given …
Logic of Domains
Av G. Zhang
Inbunden, 1991
1130 kr
Lägg i varukorg
This monograph studies the logical aspects of domains as used in de notational semantics of programming languages. Frameworks of domain logics are introduced; these serve as foundations for systematic derivations of proof systems from denotational semantics of programming languages. Any proof …
Categorical Combinators, Sequential Algorithms, and Functional Programming
Av P.-L. Curien
Inbunden, 1993
1095 kr
Lägg i varukorg
This book is a revised edition of the monograph which appeared under the same title in the series Research Notes in Theoretical Computer Science, Pit man, in 1986. In addition to a general effort to improve typography, English, and presentation, the main novelty of this second edition is the …
Algorithms for Random Generation and Counting: A Markov Chain Approach
Av A. Sinclair
Inbunden, 1993
1098 kr
Lägg i varukorg
This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The …
Graph Isomorphism Problem
Its Structural Complexity
Av J. Kobler, U. Schöning m. fl.
Inbunden, 1993
1098 kr
Lägg i varukorg
Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, …
H-Infinity Control for Distributed Parameter Systems
A State-Space Approach
Inbunden, 1993
880 kr
Lägg i varukorg
The aim of this book is to extend the major finite-dimensional state-space results to a large class of distributed parameter systems. These distributed parameter systems contain models for delay systems, as well as partial differential equations, and allow for unbounded inputs and outputs.
Finite Automata, Formal Logic, and Circuit Complexity
Inbunden, 1994
1130 kr
Lägg i varukorg
The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first order …
Subrecursive Programming Systems
Complexity & Succinctness
Inbunden, 1994
1128 kr
Lägg i varukorg
1.1. What This Book is About This book is a study of * subrecursive programming systems, * efficiency/program-size trade-offs between such systems, and * how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline …
Polynomial and Matrix Computations
Fundamental Algorithms
Inbunden, 1994
1643 kr
Lägg i varukorg
Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical computing (with matrices and polynomials). It greatly extends the study of these topics presented in the celebrated books of the seventies, [AHU] and [BM] (these topics have been under-represented in …
Combinatory Programme
Inbunden, 1994
1098 kr
Lägg i varukorg
Combinatory logic started as a programme in the foundation of mathematics and in an historical context at a time when such endeavours attracted the most gifted among the mathematicians. This small volume arose under quite differ ent circumstances, namely within the context of reworking the …
Algol-like Languages
Av Peter O'Hearn, Robert Tennent
Inbunden, 1996
1098 kr
Lägg i varukorg
In recent years there has been a remarkable convergence of interest in programming languages based on ALGOL 60. Researchers interested in the theory of procedural and object-oriented languages discovered that ALGOL 60 shows how to add procedures and object classes to simple imperative languages in …
Object-Oriented Programming A Unified Foundation
Inbunden, 1997
1130 kr
Lägg i varukorg
by Luea Cardelli Ever since Strachey's work in the 1960's, polymorphism has been classified into the parametric and overloading varieties. Parametric polymorphism has been the subject of extensive study for over two decades. Overloading, on the other hand, has often been considered too ad hoc to …
Comparative Metric Semantics of Programming Languages
Nondeterminism and Recursion
Inbunden, 1997
1130 kr
Lägg i varukorg
During the last three decades several different styles of semantics for program ming languages have been developed. This book compares two of them: the operational and the denotational approach. On the basis of several exam ples we show how to define operational and denotational semantic models …
Algol-like Languages
Av Peter O'Hearn, Robert Tennent
1996
1689 kr
Lägg i varukorg
In 1959 John Backus presented a paper on a proposed international algebraic language which evolved into ALGOL 60. This set of two volumes aims to review the attempts over recent years to use programming languages based on ALGOL 60, using Backus' original document as an introduction.
Algol-like Languages
Av Peter O'Hearn, Robert Tennent
Inbunden, 1996
1098 kr
Lägg i varukorg
To construct a compiler for a modern higher-level programming languagel one needs to structure the translation to a machine-like intermediate language in a way that reflects the semantics of the language. little is said about such struc turing in compiler texts that are intended to cover a wide …
Neural Networks and Analog Computation
Beyond the Turing Limit
Inbunden, 1998
1692 kr
Lägg i varukorg
Humanity's most basic intellectual quest to decipher nature and master it has led to numerous efforts to build machines that simulate the world or communi cate with it [Bus70, Tur36, MP43, Sha48, vN56, Sha41, Rub89, NK91, Nyc92]. The computational power and dynamic behavior of such machines is a …
Solving Higher-Order Equations
From Logic to Programming
Inbunden, 1997
1098 kr
Lägg i varukorg
This monograph develops techniques for equational reasoning in higher-order logic. Due to its expressiveness, higher-order logic is used for specification and verification of hardware, software, and mathematics. In these applica tions, higher-order logic provides the necessary level of abstraction …
Interpolating Cubic Splines
Inbunden, 1999
932 kr
Lägg i varukorg
1 Mathematical Preliminaries.- 1.1 The Pythagorean Theorem.- 1.2 Vectors.- 1.3 Subspaces and Linear Independence.- 1.4 Vector Space Bases.- 1.5 Euclidean Length.- 1.6 The Euclidean Inner Product.- 1.7 Projection onto a Line.- 1.8 Planes in-Space.- 1.9 Coordinate System Orientation.- 1.10 The Cross …
Subrecursive Programming Systems
Complexity & Succinctness
Häftad, 2012
1130 kr
Lägg i varukorg
1.1. What This Book is About This book is a study of * subrecursive programming systems, * efficiency/program-size trade-offs between such systems, and * how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline …
Polynomial and Matrix Computations
Fundamental Algorithms
Häftad, 2012
1643 kr
Lägg i varukorg
Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical computing (with matrices and polynomials). It greatly extends the study of these topics presented in the celebrated books of the seventies, [AHU] and [BM] (these topics have been under-represented in …
Finite Automata, Formal Logic, and Circuit Complexity
Häftad, 2012
1204 kr
Lägg i varukorg
The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first order …
Categorical Combinators, Sequential Algorithms, and Functional Programming
Av P.-L. Curien
Häftad, 2012
1130 kr
Lägg i varukorg
This book is a revised edition of the monograph which appeared under the same title in the series Research Notes in Theoretical Computer Science, Pit man, in 1986. In addition to a general effort to improve typography, English, and presentation, the main novelty of this second edition is the …
Algorithms for Random Generation and Counting: A Markov Chain Approach
Av A. Sinclair
Häftad, 2012
1095 kr
Lägg i varukorg
This monograph is a slightly revised version of my PhD thesis [86], com pleted in the Department of Computer Science at the University of Edin burgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers [50,88]. The …
Graph Isomorphism Problem
Its Structural Complexity
Av J. Kobler, U. Schöning m. fl.
Häftad, 2012
1098 kr
Lägg i varukorg
Recently, a variety ofresults on the complexitystatusofthegraph isomorphism problem has been obtained. These results belong to the so-called structural part of Complexity Theory. Our idea behind this book is to summarize such results which might otherwise not be easily accessible in the literature, …
Semantics of Type Theory
Correctness, Completeness and Independence Results
Av T. Streicher
Häftad, 2012
934 kr
Lägg i varukorg
Typing plays an important role in software development. Types can be consid ered as weak specifications of programs and checking that a program is of a certain type provides a verification that a program satisfies such a weak speci fication. By translating a problem specification into a …
Logic of Domains
Av G. Zhang
Häftad, 2012
1095 kr
Lägg i varukorg
This monograph studies the logical aspects of domains as used in de notational semantics of programming languages. Frameworks of domain logics are introduced; these serve as foundations for systematic derivations of proof systems from denotational semantics of programming languages. Any proof …
Neural Networks and Analog Computation
Beyond the Turing Limit
Häftad, 2012
1643 kr
Lägg i varukorg
Humanity's most basic intellectual quest to decipher nature and master it has led to numerous efforts to build machines that simulate the world or communi cate with it [Bus70, Tur36, MP43, Sha48, vN56, Sha41, Rub89, NK91, Nyc92]. The computational power and dynamic behavior of such machines is a …
Solving Higher-Order Equations
From Logic to Programming
Häftad, 2012
1098 kr
Lägg i varukorg
This monograph develops techniques for equational reasoning in higher-order logic. Due to its expressiveness, higher-order logic is used for specification and verification of hardware, software, and mathematics. In these applica tions, higher-order logic provides the necessary level of abstraction …
Isomorphisms of Types
from ?-calculus to information retrieval and language design
Häftad, 2011
551 kr
Lägg i varukorg
This is a book about isomorphisms 0/ types, arecent difficult research topic in type theory that turned out to be able to have valuable practical applications both for programming language design and far more human centered information retrieval in software libraries. By means of a deep study of …
Algol-like Languages
Av Peter O'Hearn, Robert Tennent
Häftad, 2011
1098 kr
Lägg i varukorg
In recent years there has been a remarkable convergence of interest in programming languages based on ALGOL 60. Researchers interested in the theory of procedural and object-oriented languages discovered that ALGOL 60 shows how to add procedures and object classes to simple imperative languages in …
