Publication:4409150
From MaRDI portal
zbMath1019.68511MaRDI QIDQ4409150
Publication date: 30 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2441/24410021.htm
68N15: Theory of programming languages
Related Items
Efficient algorithms for isomorphisms of simple types, A descriptive type foundation for RDF Schema, On the tree-transformation power of XSLT, Query triggers for XML DBMS: Efficient implementation based on shadow mechanism, 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