scientific article; zbMATH DE number 3911699
[For the entire collection see Zbl 0533.00026.] This paper is meant to be an invitation for and a 'feasibility proof' of 'doing' mathematics with 'programming tools'. The author asserts that in a sufficiently rich programming language it is possible to express a very substantial amount of mathematics in a natural way and that expressing mathematics in this way reveals its computational content and makes it available for use with digital computers. The first three sections in the paper establish the general framework of the discussion and the basic concepts: a programming logic, with a rich type structure, is employed as context to define a higher order predicate calculus using the 'propositions-as-types principle' as fundamental organizing principle (similarly to AUTOMATH and Martin-Löf's type theory). The fourth section is devoted to the definition of the primitive recursive functions, of the partial functions and of \(\mu\)-recursive functions. The last section shows that the study of a 'Simple Arithmetic' theory may be carried out in the used framework, starting from a definition of the Arithmetic as a type.
- Mathematics for reasoning about loop functions
- Object-oriented programming in mathematics
- In code. A mathematical journey.
- Metamathematical fundamental concepts of computer programming
- scientific article; zbMATH DE number 622677 (Why is no real title available?)
- Domain-specific languages of mathematics
- Intrinsic reasoning about functional programs. I: First order theories
- Innovations in computational type theory using Nuprl
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3687706)