Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 16
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Ciobanu, Gabriel Horne, Ross and Sassone, Vladimiro 2016. A descriptive type foundation for RDF Schema. Journal of Logical and Algebraic Methods in Programming,

    Rowe, Reuben N.S. and van Bakel, S.J. 2014. Semantic Types and Approximation for Featherweight Java. Theoretical Computer Science, Vol. 517, p. 34.

    Cīrulis, Jānis 2011. Nearlattices with an Overriding Operation. Order, Vol. 28, Issue. 1, p. 33.

    Pu, Ken Q. 2007. 2007 IEEE 23rd International Conference on Data Engineering Workshop. p. 379.

    Lumpe, M. and Schneider, J.-G. 2005. A form-based meta-model for software composition. Science of Computer Programming, Vol. 56, Issue. 1-2, p. 59.

    Compagnoni, Adriana 2004. Higher-order subtyping and its decidability. Information and Computation, Vol. 191, Issue. 1, p. 41.

    Compagnoni, Adriana and Goguen, Healfdene 2003. Typed operational semantics for higher-order subtyping. Information and Computation, Vol. 184, Issue. 2, p. 242.

    Villanova-Oliver, M. Gensel, J. Martin, H. and Erb, C. 2002. Proceedings. International Conference on Information Technology: Coding and Computing. p. 300.

    Albano, A. Antognoni, G. and Ghelli, G. 2000. View operations on objects with roles for a statically typed database language. IEEE Transactions on Knowledge and Data Engineering, Vol. 12, Issue. 4, p. 548.

    He, Ziqiang 1998. Another definition of order-sorted algebra. Journal of Computer Science and Technology, Vol. 13, Issue. 6, p. 547.

    Ghelli, Giorgio 1995. Divergence of F⩽ type checking. Theoretical Computer Science, Vol. 139, Issue. 1-2, p. 131.

    Najm, Elic and Stefani, Jean-Bernard 1995. A formal semantics for the ODP computational model. Computer Networks and ISDN Systems, Vol. 27, Issue. 8, p. 1305.

    Abadi, M. and Cardelli, L. 1994. Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science. p. 332.

    Pierce, Benjamin C. and Turner, David N. 1994. Simple type-theoretic foundations for object-oriented programming. Journal of Functional Programming, Vol. 4, Issue. 02, p. 207.

    Mitchell, J.C. Honsell, F. and Fisher, K. 1993. [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science. p. 26.

    Breazu-Tannen, Val Coquand, Thierry Gunter, Carl A. and Scedrov, Andre 1991. Inheritance as implicit coercion. Information and Computation, Vol. 93, Issue. 1, p. 172.

  • Mathematical Structures in Computer Science, Volume 1, Issue 1
  • March 1991, pp. 3-48

Operations on records

  • Luca Cardelli (a1) and John C. Mitchell (a2)
  • DOI:
  • Published online: 01 March 2009

We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order type system over these operations supports both subtyping and polymorphism. We provide typechecking algorithms and limited semantic models.

Our approach unifies and extends previous notions of records, bounded quantification, record extension, and parametrization by row-variables. The general aim is to provide foundations for concepts found in object-oriented languages, within a framework based on typed lambda-calculus.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

K.B. Bruce , A.R. Meyer and J.C. Mitchell (1990) The semantics of second order lambda calculus. Informat. Computat. Vol. 85, No. 1, pp. 76134

L. Cardelli (1988) A semantics of multiple inheritance. In Information and Computation 76 138164 (First appeared in Semantics of Data Types, eds G. Kahn, D. B. MacQueen and G. Plotkin. Springer Lecture Notes in Computer Science173, Springer-Verlag, 1984.)

L. Cardelli and P. Wegner (1985) On understanding types, data abstraction and polymorphism. Comput. Surv. 17(4) 471522

O. Dahl and K. Nygaard (1966) Simula, an Algol-based simulation language. Commun. ACM 9 671678

J.-Y. Girard (1971) Une extension de Interpretation de Gödel é l’analyse, et son application à l’élimination des coupures dans l’analyse ct la théorie des types. Proc. Second Scandinavian Logic Symposium, ed. J.E. Fenstad . North-Holland, pp. 6392

R. Milner (1978) A theory of type polymorphism in programming. J. Comput. Sys. Sci. 17 348375

J.C. Reynolds (1974) Towards a theory of type structure. In: Colloquium sur la Programmation. Springer Lecture Notes in Computer Science 19, pp. 408423

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *