scientific article; zbMATH DE number 615137

No author found.

Publication date: 8 August 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

semantics object-oriented programming Object-oriented programming

Theory of programming languages (68N15) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01) Theory of software (68N99)

Related Items

Strong types for coordinating active objects, Higher-order subtyping and its decidability, Labelled reductions, runtime errors, and operational subsumption, Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping, A lambda-calculus for dynamic binding, Environment classifiers, Bigraphs and transitions, The m-calculus, A generic approach to the static analysis of concurrent programs with procedures, Discovering affine equalities using random interpretation, Bitwidth aware global register allocation, Folklore confirmed, New results on the computability and complexity of points--to analysis, Incremental algorithms for dispatching in dynamically typed languages, From control effects to typed continuation passing, Coercive subtyping for the calculus of constructions, A type theory for memory allocation and data layout, Static prediction of heap space usage for first-order functional programs, Ownership types for object encapsulation, Guarded recursive datatype constructors, A type system for higher-order modules, Pure patterns type systems, Object-oriented programming: some history, and challenges for the next fifty years, Higher-order subtyping, DNAQL: a query language for DNA sticker complexes, Typed operational semantics for higher-order subtyping., Implicit coercions in type systems, A Coalgebraic Semantics of Subtyping, Polymorphic type inference for the relational algebra, Subtyping recursion and parametric polymorphism in kernel Fun, Coherence of subsumption for monadic types, Efficient algorithms for isomorphisms of simple types, Completeness and Herbrand theorems for nominal logic, Privacy via subsumption, Objects and classes in Algol-like languages

Uses Software