Вы здесь

Главная

тип

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

An Approach to Improve Locality Using Sandwich Types
An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages
A Nested-Graph Model for the Representation and Manipulation of Complex Objects
A New Concept of Refinement used for Behaviour Modeling with Automata
A New Technigue for Strictness Analysis
A New Type Checking Approach for OCL Version 2.0?
A New Type Theory for Representing Logics
An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs
An Extended Theory of Primitive Objects: First Order System
An Extensible Type System for Component-Based Design
An Imperative Language with Read/Write Type Modes
An Imperative Object Calculus
An Implementation of Session Types
An Implementation of the Heine-Borel Covering Theorem in Type Theory
An Implementation of Type:Type
An Instance of Abstract Interpretation Integrating Type and Mode Inferencing
An Interaction-Based Language and Its Typing System
An Introduction to Dependent Type Theory
Annotated Structure Shape Graphs for Abstract Analysis of Prolog
An Object Calculus with Algebraic Rewriting
An Object-Oriented Data Model for Artificial Intelligence Application
A Nominal Theory of Objects with Dependent Types
An Operational Semantics for TOOPLE: A Statically-Typed Object-Oriented Programming Language
A Note on Completeness of Patterns
A Note on Covariance and Contravariance Unification
A Note on Type Checking Linear Functional Languages
A Note on Type Composition and Reusability
Another Type System for In-Place Update
A Partially Deadlock-Free Typed Process Calculus
A Polymorphic Language which is Typable and Poly-step
A Polymorphic Type System for Bulk Synchronous Parallel ML
A Polymorphic Type System for the Polyadic Pi-calculus
Application of OOP Type Theory: State, Decidability, Integration
Application of Typed Lambda Calculi in the Untyped Lambda Calculus
Applications of Type Theory
Applied Semantics: Advanced Lectures/Intern. Summer School, APPSEM 2000, Caminha, Portugal, September 2000
A Practical Approach to Software Portability Based on Strong Typing and Architectural Stratification
A Practical Soft Type System for Scheme
A Practical Subtyping System for Erlang
A Pragmatic Approach to Software Synthesis
A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types
A Realization of the Negative Interpretation of the Axiom of Choice
A Record Calculus with Principal Types
A Region Inference Algorithm
A Sequent Calculus for Subtyping Polymorphic Types
A Simple Adequate Categorical Model for PCF
A Simple Approach to Supporting Untagged Objects in Dynamically Typed Languages
A Simple Model for Quotient Types
A Simple Take on Typed Abstract Syntax in Haskell-like Languages
A Simplification of Girard s Paradox