Вы здесь

Главная

теория

Связанные издания:

Towards a Formal Theory of Computer Architecture
Towards an Algebraic Theory of Concurrency
Towards an Algebraic Theory of Typed Mobile Processes
Towards a Net-Theoretic Notion of Type based on Predicate-Transition Nets
Towards an Object Calculus
Towards a Predictive Computational Complexity Theory
Towards a Set-Theoretic Type Theory
Towards a Theory of Recursive Structures
Towards Testing Stochastic Timed Systems
Towards the Theory-Guided Design of Help Systems for Programming and Modelling Tasks
TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory
Traces, Histories, Graphs: Instances of a Process Monoid
Transactions on Computational Collective Intelligence XXIII
Transformational Programming, Type Simulations & Intensional Set Theory
Tridirectional Typechecking
True Concurrency: Theory and Practice
Typed Lambda Calculi and Applications: Proc./Intern. Conf. on Typed Lambda Calculi and Applications, TLCA 93. March 1993, Utrecht, The Netherlands
Typed Operational Semantics
Type Isomorphisms and Proof Reuse in Dependent Type Theory
Types as Parameters
Types for Proofs and Programs: Proc./Intern. Workshop, TYPES 2000, Durhum, UK, December 2000
Types for Proofs and Programs: Proc./Intern. Workshop, TYPES 98. Kloster Irsee, Germany, March 1998
Types for Proofs and Programs: Selected Papers/ International Workshop TYPES 94. Bastad, Sweden, June 1994
Types, Subtypes, and ASL+
Type Synthesis in B and the Translation of B to PVS
Type Theory and Concurrency
Type Theory and Projections for Higher-Order Static Analysis
Type Theory and the Informal Language of Mathematics
Typing Abstract Data Types
Uber die Notwendigkeit einer Systemtheorie in der Wissenschaftsdisziplin Informatik
Ultra-Structure: A Design Theory for Complex Systems and Processes
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests
Undecidability of Implication Problems in Logic Programming, Database Theory and Classical Logic
UNIF 89: Extended Abstracts of the 3rd Intern. Workshop on Unification
Unification Algorithms for Boolean Rings
Unifying Theories for Parallel Programming
Unifying Theories of Parallel Programming
Universes in the Theories of Types and Names
Un Langage pour Calculer sur des Ensembles
Update by Means of Inference Rules
Using Conceptual Graph Theory to Support Schema Integration
Using Type Theory to Synthesise Database Functions
Value-passing in process algebras
Verifying Properties of Module Construction in Type Theory
Views, Mappings and Functions: Essential Definitions to the Conceptual Graph Theory
Weak Completion Theory for Non-Horn Programs
Weak Systems of Set Theory Related to HOL
Well Quasi-Orders and Regular Languages
What Does the Future Hold for Theoretical Computer Science?
What Is a Theory?