Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
Theoretical Computer Science
Связанные издания:
About primitive recursive algorithms
A bridge between constructive logic and computer programming
Abstract Language Design
Abstract specification of structures and methods in symbolic mathematical computation
A Characterization of digital search trees from the successful search viewpoint
Acyclic logic programs and the completeness of SLDNF-resolution
A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and Its Implementation
Adequacy-Preserving Transformations of COSY Path Programs
A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization
Algebraic construction of compilers
A List-Oriented Extension of the Lambda-Calculus Satisfying the Church-Rosser Theorem
An Algebraically Specified Language for Data Directed Design
An algebra of concurrent nondeterministic processes
An Algorithm deciding functional equivalence in a new class of program schemes
Analysis of program optimization possibilities and further development
An analysis of loop checking mechanisms for logic programs
A New Approach to Recursion Removal
An extensional fixed-point semantics for nondeterministic data flow
A note on model checking the modal v-calculus
A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets
A Prolog technology theorem prover: a new exposition and implementation in Prolog
A Semantic Characterization of the Well-Typed Formulae of -Calculus
A semi-algorithm for algebraic implementation proofs
A Structure to Decide Reachability in Petri Nets
A taxonomy of fairness and temporal logic problems for Petri nets
A theory for program and data type specification
A theory for the derivation of combinational C-mos circuit designs
A Transformation System for Deductive Database Modules with Perfect Model Semantics
A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets
Bounded delay L codes
Bounded linear logic: a modular approach to polynomial-time computability
Category-sorted Algebra-based Action Semantics
C-Expressions: A Variable-Free Calculus for Equational Logic Programming
Clocks in Dataflow Languages
Combining Angels, Demons and Miracles in Program Specifications
Compatibility Problems in the Development of Algebraic Module Specifications
Complete Restrictions of the Intersection Type Discipline
Completing the temporal picture
Completions of perpetual Logic programs
Comprehension Categories and the Semantics of Type Dependency
Conceptual Level Concurrency Control of Relational Update Transactions
Concurrent regular expressions and thier relationship to Petri nets
Conditional rewriting logic as a unified model of concurrency
Connectedness and synchronization
Constructive Logics Part I: A Tutorial on Proof Systems and Typed -Calculi
Contributions to the stable model semantics of logic programs with negation
Control machines: a new model of parallelism for compositional specifications and their effective compilation
Data refinement of predicate transformers
Data Types over Multiple-valued Logics
Data types with errors and exeptions
1
2
3
следующая ›
последняя »