Advertisement

Constructive Mathematics and Functional Programming (Abstract)

  • Thierry Coquand
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4960)

Abstract

Around thirty years ago, P. Martin-Löf [12] suggested that the intuitionistic theory of types, originally designed as a formal system for constructive mathematics, could be viewed as a programming language. The conclusion of this paper stresses the mutual benefit of relating constructive mathematics and computer programming. In one direction one gets a precise system of notations for both statements and proofs, and one obtains the computerization of abstract intuitionistic mathematics that was asked by Bishop [2]. In the other direction, computer programming “gets access to the whole conceptual apparatus of pure mathematics”.

References

  1. 1.
  2. 2.
    Bishop, E.: Mathematics as a numerical language. In: 1970 Intuitionism and Proof Theory (Proc. Conf., Buffalo, N.Y., 1968), pp. 53–71. North-Holland, Amsterdam (1970)Google Scholar
  3. 3.
    Berger, U.: Continuous Semantics for Strong Normalization. CiE, 23-34 (2005)Google Scholar
  4. 4.
    Bertot, Y.: Affine functions and series with co-inductive real numbers. Mathematical Structures in Computer Science 17(1), 37–63 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Coquand, T., Spiwack, A.: A proof of strong normalisation using domain theory. LMCS 3(4:12) (2007)Google Scholar
  6. 6.
    Dufourd, J.-F.: A hypermap framework for computer-aided proofs in surface subdivisions: genus theorem and Euler’s formula. In: SAC 2007, pp. 757–761 (2007)Google Scholar
  7. 7.
    Dufourd, J.-F.: Design and formal proof of a new optimal image segmentation program with hypermaps. Pattern Recognition 40(11), 2974–2993 (2007)zbMATHCrossRefGoogle Scholar
  8. 8.
    Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Théry, L.: A Modular Formalisation of Finite Group Theory. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 86–101. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Gonthier, G.: A computer-checked proof of the Four Colour Theorem. (unpublished)Google Scholar
  10. 10.
    Grégoire, B., Leroy, X.: A compiled implementation of strong reduction. In: ICFP 2002, pp. 235–246 (2002)Google Scholar
  11. 11.
    Landin, P.J.: The mechanical evaluation of expressions. Computer Journal 6(4) (1964)Google Scholar
  12. 12.
    Martin-Löf, P.: Constructive mathematics and computer programming. In: Logic, methodology and philosophy of science, VI (Hannover, 1979), Stud. Logic Found. Math., 104, pp. 153–175. North-Holland, Amsterdam (1982)Google Scholar
  13. 13.
    O’Connor, R.: A monadic, functional implementation of real numbers. Mathematical Structures in Computer Science 17(1), 129–159 (2007)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Thierry Coquand
    • 1
  1. 1.Department of Computer Science and EngineeringGöteborg University and Chalmers University of TechnologySweden

Personalised recommendations