Type checking by domain analysis in Ampersand

S.M.M. Joosten, S.J.C. Joosten

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    4 Citations (Scopus)
    1 Downloads (Pure)

    Abstract

    In the process of incorporating subtyping in relation algebra, an algorithm was found to derive the subtyping relation from the program to be checked. By using domain analysis rather than type inference, this algorithm offers an attractive visualization of the type derivation process. This visualization can be used as a graphical proof that the type system has assigned types correctly. An implementation is linked to in this paper, written in Haskell. The algorithm has been tried and tested in Ampersand, a language that uses relation algebra for the purpose of designing information systems.
    Original languageEnglish
    Title of host publicationRelational and Algebraic Methods in Computer Science (15th International Conference, RAMiCS 2015, Braga, Portugal, September 28-October 1, 2015)
    EditorsW. Kahl, M. Winter, J.N. Oliveira
    PublisherSpringer
    Pages225-240
    ISBN (Print)978-3-319-24703-8
    DOIs
    Publication statusPublished - 2015

    Publication series

    NameLecture Notes in Computer Science
    Volume9348
    ISSN (Print)0302-9743

    Fingerprint Dive into the research topics of 'Type checking by domain analysis in Ampersand'. Together they form a unique fingerprint.

    Cite this