• DocumentCode
    3294231
  • Title

    Experience using type theory as a foundation for computer science

  • Author

    Constable, Robert L.

  • Author_Institution
    Cornell Univ., Ithaca, NY, USA
  • fYear
    1995
  • fDate
    26-29 Jun 1995
  • Firstpage
    266
  • Lastpage
    279
  • Abstract
    Type theory is an elegant organisation of the fundamental principles of a foundational theory of computing, with theory taken in the sense of a scientific theory as well as a deductive theory. This theory generates a research programme. I examine the elements of this programme and assess progress. A large number of people world wide have been pursuing the type theory aspects of this research programme, so we can survey a large body of work created over a 20 year period for hints of success and failure and challenge. I first look at a few successes. Some of the applications we have attempted have not worked out as expected, and we don´t know whether the fault lies with the type theory or elsewhere. I first describe a failure that is clearly not the type theory, but the state of the foundations of computational mathematics. Then we look at problems closer to the structure of modern type theories-problems suggested by the success of classical set theory
  • Keywords
    Boolean algebra; formal logic; programming theory; type theory; Boolean algebra; computer science; database query languages; foundational issues; logic programming; predicate logic; programming language design; type theory; Circuit synthesis; Computer languages; Computer science; Database languages; Logic programming; Mathematics; Physics computing; Reliability theory; Set theory; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1995. LICS '95. Proceedings., Tenth Annual IEEE Symposium on
  • Conference_Location
    San Diego, CA
  • ISSN
    1043-6871
  • Print_ISBN
    0-8186-7050-9
  • Type

    conf

  • DOI
    10.1109/LICS.1995.523262
  • Filename
    523262