Thompson, Simon (2001) Logic and Dependent Types in the Aldor Computer Algebra System. In: Kerber, Manfred and Kohlhase, Michael, eds. Symbolic Computation and Automated Reasoning. . pp. 205-219. A K Peters ISBN 1-56881-145-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13642)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. |
Abstract
We show how the Aldor type system can represent propositions of first-order logic, by means of the 'propositions as types' correspondence. The representation relies on type casts (using pretend) but can be viewed as a prototype implementation of a modified type system with type evaluation reported elsewhere [9]. The logic is used to provide an, axiomatisation of a number of familiar Aldor categories as well as a type of vectors
Item Type: | Conference or workshop item (Paper) |
---|---|
Uncontrolled keywords: | logic dependent type computer algebra Aldor Axiom |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 24 Nov 2008 17:59 UTC |
Last Modified: | 05 Nov 2024 09:47 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/13642 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):