Progress in Theoretical Computer Science – serie

Canonical Equational Proofs

Logic of Domains

Categorical Combinators, Sequential Algorithms, and Functional Programming

Algorithms for Random Generation and Counting: A Markov Chain Approach

Graph Isomorphism Problem

Its Structural Complexity

H-Infinity Control for Distributed Parameter Systems

A State-Space Approach

Finite Automata, Formal Logic, and Circuit Complexity

Subrecursive Programming Systems

Complexity & Succinctness

Polynomial and Matrix Computations

Fundamental Algorithms

Combinatory Programme

Algol-like Languages

Object-Oriented Programming A Unified Foundation

Comparative Metric Semantics of Programming Languages

Nondeterminism and Recursion

Algol-like Languages

Neural Networks and Analog Computation

Beyond the Turing Limit

Solving Higher-Order Equations

From Logic to Programming

Interpolating Cubic Splines

Subrecursive Programming Systems

Complexity & Succinctness

Polynomial and Matrix Computations

Fundamental Algorithms

Finite Automata, Formal Logic, and Circuit Complexity

Categorical Combinators, Sequential Algorithms, and Functional Programming

Algorithms for Random Generation and Counting: A Markov Chain Approach

Graph Isomorphism Problem

Its Structural Complexity

Semantics of Type Theory

Correctness, Completeness and Independence Results

Logic of Domains

Neural Networks and Analog Computation

Beyond the Turing Limit

Solving Higher-Order Equations

From Logic to Programming

Isomorphisms of Types

from ?-calculus to information retrieval and language design

Algol-like Languages