Вы здесь

Главная

тип

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

A Simply Typed Context Calculus with First-Class Environments
A Statically Safe Alternative to Virtual Types
A Subtyping for the Eisher-Honsell-Mitchell Lambda Calculus of Objects
A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects
A Symmetric Lambda Calculus for "Classical" Program Extraction
A Tape System for Computer Algebra
A Theory of Primitive Objects: Second-Order Systems
A Theory of Type Qualifiers
ATLAS: A Typed Language for Algebraic Specification
A Toolkit for Constructing Type- and Constraint-Based Program Analyses
Attached Types and Their Application to Three Open Problems of Object-Oriented Programming
Attaching Second-Order Types to Methods in an Object-Oriented Language
A Type-based Analysis for Stack Allocation in Functional Languages
A Type-Based Compiler for Standard ML
A Type-based Framework for Program Analysis
A Type Based Sharing Analysis for Update Avoidance and Optimisation
A Typed Language for Distributed Mobile Processes
A Type Inference System for Prolog
A Type Mechanism Based on Restricted CCS for Distributed Active Objects
A Type-Passing Approach for the Implementation of Parametric Methods in Java
A Type System and Analysis for the Automatic Extraction and Enforcement of Design Information
A Type System for Bounded Space and Functional In-Place Update - Extended Abstract
A Type System for Dynamic Web Documents
A Type System for Object Initialization in the Java Bytecode Language
A Type System for Object Initialization in the JavaTM Bytecode Language
A Type System for Prototyping Languages
A Type System for Well-Founded Recursion
A Type System of Logic Objects
A Type-Theoretic Approach to Higher-Order Modules with Sharing
A Uniform Methodology for Extracting Type Conflicts and Subscheme Similarities from Heterogeneous Databases
A Unifying Theory of Dependent Types: the Schematic Approach
A Unifying Type-Theoretic Framework for Objects
A Usage Analysis with Bounded Usage Polymorphism and Subtyping
A User s Friendly Syntax to Define Recursive Functions as Typed Lambda-terms
A Verified Typechecker
Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition
Backward Type Inference Generalises Type Checking
Basic Conceptual Structures Theory
Basic polymorphic typechecking
Basic Properties of Data Types with Inequational Refinements
Behavioral Compatibility of Self-Typed Theories
Behavioural Types for a Calculus of Concurrent Objects
Bending without Breaking: Making Software More Flexible
Branching Types
Bulk Types and Query Language Design
Call-by-Value Mixin Modules (Reduction Semantics, Side Effects, Types)
Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages
Categorical Models for Intuitionistic and Linear Type Theory
Cayenne - a language with dependent types
Cayenne - A Language with Dependent Types