Henrik Persson  Home/Search
Context
Related
| cs.chalmers.se/~henrikp/typesSS99.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.chalmers.se/~henrikp/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Computer algebra is about constructions and problems in algebra which can be efficiently computed or decided by mechanical procedures. A challenging point of importing computer algebra to type theory is that it require the formalisation of a considerable amount of non-trivial mathematics. The correctness of simple computer algebra algorithms can often depend on quite deep mathematical results, and since these results come from classical (and hence in general non-constructive) mathematics, it is ... (Update)
Similar documents (at the sentence level):
52.1%: Gröbner Bases in Type Theory - Coquand, Persson (1998) (Correct)
Active bibliography (related documents): More All
0.3: Symbolic Model Checking Using Algebraic Geometry - Avrunin (1996) (Correct)
0.3: An Application of the Constructive Spectrum of a Ring - Persson (Correct)
0.2: Integrated Development of Algebra in Type Theory - Coquand, Persson (1998) (Correct)
Similar documents based on text: More All
0.1: Valuations and Dedekind's Prague Theorem - Coquand, Persson (Correct)
0.1: A Proof-Theoretical Investigation of Zantema's Problem - Coquand, Persson (Correct)
0.1: Sampling in the Lexis Diagram - Lund (1997) (Correct)
BibTeX entry: (Update)
@misc{ persson-certified,
author = "Henrik Persson",
title = "Certified Computer Algebra",
url = "citeseer.ist.psu.edu/252854.html" }
Citations (may not include all citations):505 Implementing Mathematics with the NuPRL Proof Development Sy.. - Constable - 1986
167 Grobner bases: An algorithmic method in polynomial ideal the.. (context) - Buchberger - 1985
97 An Introduction to Inductive Definitions (context) - Aczel - 1977
69 Cayenne - a language with dependent types - Augustsson - 1998
53 Undergraduate Texts in Mathematics (context) - Cox, Little et al. - 1997
45 An Algorithm for Finding a Basis for the Residue Class Ring .. (context) - Buchberger - 1965
43 Finiteness of the odd perfect and primitive abundant numbers.. (context) - Dickson - 1913
11 Constructive topology and combinatorics - Coquand - 1992
10 Comparing integrated and external logics of functional progr.. (context) - Dybjer - 1990
6 Introduction to Grobner bases (context) - Buchberger - 1998
3 volume 141 of Graduate Texts in Mathematics (context) - Becker, Weispfenning - 1993
3 The homepage of the Agda type checker (context) - Coquand - 1998
1 An introduction to (context) - Froberg
Documents on the same site (http://www.cs.chalmers.se/~henrikp/): More
Valuations and Dedekind's Prague Theorem - Coquand, Persson (Correct)
Integrated Development of Algebra in Type Theory - Coquand, Persson (1998) (Correct)
Gröbner Bases in Type Theory - Coquand, Persson (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC