Skip to main content
SpringerLink
Log in

A type-theoretic approach to program development

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A paradigm of program development using type theories is given after analyzing some typical examples. In order to carry this approach forward, a language ALT is designed. It is a linguistic description of a generalized higher order typed lambda calculus with π, Σ types and π, Σ kinds (supertypes). Four examples are given to show how ALT can be used to implement many concepts of software engineering and artificial intelligence. They are intuitionistic logic, Peano arithmetic, approximate reasoning and program transformations. ALT is described formally, using a structural operational approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Avron, F.A. Honsell and I.A. Mason, Using Typed Lambda Calculus to Implement Formal Systems on a Machine, Technical Report of LFCS, ECS-LFCS-87-31, University of Edinburgh, July 1987.

  2. M. Broy, Algebraic Methods for Program Construction: The Project CIP. Program Transformation and Programming Environments. NATO ASI Series, 1984.

  3. L. Cardelli, Polymorphic /-Calculus with Type: Type, Technical Report No. 10, System Research Center, May 1986.

  4. L. Cardelli, Structural subtyping and the notion of power type, Proc. POPL 1988.

  5. L. Cardelli, A Quest Preview, A Draft of Technical Report, System Research Center, January, 1988.

  6. Conquand and G. Huet, A High-Order Proof System for Mechanizing Mathematics. EUROCAL ’85. Springer-Verlag, 1985.

  7. R.L. Constable, Implementing Mathematics with the Nuprl Development System, Prentice-Hall, 1986.

  8. R. Harper, F. Honsell and G. Plotkin, A Framework of Defining Logic, Proc. Symposium on Logic in Computer Science, IEEE Computer Society, June 1987.

  9. J. Hidley and J. Seldin, Introduction to Combinators and Lambda Calculus, Cambridge University Press, 1986.

  10. W. Li, An Operational Approach to Semantics and Translation Theory for Concurrent Programming Languages, Ph.D thesis, University of Edinburgh, January 1983.

  11. P. Martin-Löf, Constructive mathematics and computer science, In Sixth International Congress for Logic, Methodology, and Philosophy of Science, North-Holland, Amsterdam, 1982.

    Google Scholar 

  12. P. Martin-Löf, Intuitionistic Type Theory. Studies in Proof Theory Lecture Notes, BIBLIOPOLIS, Napoli, 1984.

  13. L. Paulson, Natural deduction proofs as high-order resolution.Journal of Logic Programming,3 (1986).

  14. G. Plotkin, A structural approach to operational semantics, a lecture note, Dept, of Computer Science, Aarhus University, September 1981.

  15. L.A. Zadeh, Fuzzy logic and approximate reasoning, Synthese 30, 1975.

Download references

Author information

Authors and Affiliations

  1. Beijing University of Aeronautics and Astronautics, Beijing, China

    Li Wei

Authors
  1. Li Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, W. A type-theoretic approach to program development. J. of Comput. Sci. & Technol. 5, 209–224 (1990). https://doi.org/10.1007/BF02945309

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02945309

Keywords

Search

Navigation