


default search action
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, 1990
- Jan van Leeuwen:

Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics. Elsevier and MIT Press 1990, ISBN 0-444-88074-7 - Dominique Perrin:

Finite Automata. 1-57 - Jean Berstel, Luc Boasson:

Context-Free Languages. 59-102 - Arto Salomaa:

Formal Languages and Power Series. 103-132 - Wolfgang Thomas:

Automata on Infinite Objects. 133-191 - Bruno Courcelle:

Graph Rewriting: An Algebraic and Logic Approach. 193-242 - Nachum Dershowitz, Jean-Pierre Jouannaud:

Rewrite Systems. 243-320 - Hendrik Pieter Barendregt:

Functional Programming and Lambda Calculus. 321-363 - John C. Mitchell:

Type Systems for Programming Languages. 365-458 - Bruno Courcelle:

Recursive Applicative Program Schemes. 459-492 - Krzysztof R. Apt:

Logic Programming. 493-574 - Peter D. Mosses

:
Denotational Semantics. 575-631 - Carl A. Gunter, Dana S. Scott:

Semantic Domains. 633-674 - Martin Wirsing:

Algebraic Specification. 675-788 - Dexter Kozen, Jerzy Tiuryn:

Logics of Programs. 789-840 - Patrick Cousot:

Methods and Logics for Proving Programs. 841-993 - E. Allen Emerson:

Temporal and Modal Logic. 995-1072 - Paris C. Kanellakis:

Elements of Relational Database Theory. 1073-1156 - Leslie Lamport, Nancy A. Lynch:

Distributed Computing: Models and Methods. 1157-1199 - Robin Milner:

Operational and Algebraic Semantics of Concurrent Processes. 1201-1242

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














