Do-it-yourself type theory-Reference-Cited by-同舟云学术

Do-it-yourself type theory

Published:1989-03 Issue:1 Volume:1 Page:19-84
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Backhouse Roland¹,Chisholm Paul¹,Malcolm Grant¹,Saaman Erik¹

Affiliation:

1. Department of Mathematics and Computing Science, University of Groningen, P.O. Box 800, 9700, AV Groningen, Netherlands

Abstract

Abstract This paper provides a tutorial introduction to a constructive theory of types based on, but incorporating some extensions to, that originally developed by Per Martin-Löf. The emphasis is on the relevance of the theory to the construction of computer programs and, in particular, on the formal relationship between program and data structure. Topics discussed include the principle of propositions as types, free types, congruence types, types with information loss and mutually recursive types. Several examples of program development within the theory are also discussed in detail.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01887198.pdf

Reference62 articles.

1. Allen S.: A Non-Type-Theoretic Semantics for Type-Theoretic Language. PhD thesis Cornell University September 1987.

2. Backhouse R. C.: Notes on Martin-Löf's Theory of Types parts 1 and 2. In: FACS ACTS British Computer Society 1986.

3. Backhouse R. C.: On the Meaning and Construction of the Rules in Martin-Löf's Theory of Types . Computing Science Notes CS 8606 Department of Mathematics and Computing Science University of Groningen 1986.

4. Backhouse R. C.: Program Construction and Verification . Prentice-Hall International 1986.

5. Boyer R. S. and Moore J. S.: A Computational Logic . Academic Press 1979.

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithmics;IFIP Advances in Information and Communication Technology;2021

2. Typal Heterogeneous Equality Types;ACM Transactions on Computational Logic;2020-07-31

3. ETA-RULES IN MARTIN-LÖF TYPE THEORY;The Bulletin of Symbolic Logic;2019-07-22

4. Intuitionistic completeness of first-order logic;Annals of Pure and Applied Logic;2014-01

5. Behavioral interface specification languages;ACM Computing Surveys;2012-06