Semantics of Data Types : International symposium Sophia-Antipolis, France, June 27 29, 1984 : proceedings

محفوظ في:
التفاصيل البيبلوغرافية
مؤلف مشترك: International symposium on the semantics of data types :Sophia-Antipolis, Alpes-Maritimes
مؤلفون آخرون: Kahn, Gilles, 1946-2006 (مدير النشر), MacQueen, David B., 1946- (مدير النشر), Plotkin, Gordon, 1946-...., informaticien (مدير النشر)
التنسيق: Livre numérique
اللغة:Anglais
منشور في: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
سلاسل:Lecture notes in computer science 173
الموضوعات:
الوصول للمادة أونلاين:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
ملاحظة: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Semantics of data types, International symposium, Sophia-Antipolis, June 27-29, 1984, edited by G. Kahn, D.B. MacQueen and G. Plotkin, Berlin, Springer-Verlag, 1984, 1 vol. (VI-391 p.), Lecture notes in computer science, 3-540-13346-1
• Semantics of Data Types, Texte imprimé, 9783662198223
جدول المحتويات:
  • A kernel language for abstract data types and modules
  • A semantics of multiple inheritance
  • Understanding Russell a first attempt
  • A basic Abstract Semantic Algebra
  • Using information systems to solve reoursive domain equations effectively
  • The semantics of second order polymorphic lambda calculus
  • Polymorphism is not set-theoretic
  • A theory of data type representation independence
  • Abstract data types and their extensions within a constructive logic
  • Deriving structural induction in LCF
  • Executable specification of static semantics
  • Cartesian closed categories of enumerations for effective type structures
  • Type inference and type containment
  • F-semantics for intersection type discipline
  • The typechecking of programs with implicit type structure
  • Partial implementations of abstract data types: A dissenting view on errors
  • Building specifications in an arbitrary institution
  • A proof system for verifying composability of abstract implementations
  • Towards a proof theoryof parameterized specifications.