A type-theoretic approach for program development

https://doi.org/10.1016/0167-739X(90)90009-3Get rights and content

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, a linguistic description of a generalized higher order typed lambda calculus with Π, Σ types and Π, Σ kinds (supertype). 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 transformation. ALT is described formally, using a structural operational approach.

References (15)

  • A Avron et al.

    Using typed lambda calculus to implement formal systems on a machine

  • M Broy

    Algebraic methods for program construction: The project CIP

  • L Cardelli

    Polymorphic ß-calculus with Type: Type

  • L Cardelli

    Structural subtyping and the notion of power type

  • L Cardelli

    A quest preview

  • T Conquand et al.

    A high-order proof system for mechanizing mathematics

  • R.L Constable

    Implementing Mathematics with the Nuprl Development System

    (1986)
There are more references available in the full text version of this article.

Cited by (0)

View full text