Automating Side Conditions in Formalized Partial Functions
From MaRDI portal
Publication:5505512
DOI10.1007/978-3-540-85110-3_26zbMath1166.68349OpenAlexW1516795788WikidataQ108482195 ScholiaQ108482195MaRDI QIDQ5505512
Publication date: 27 January 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85110-3_26
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- NIST digital library of mathematical functions
- First Order Logic with Domain Conditions
- Partial Recursive Functions in Higher-Order Logic
- Multiple-valued complex functions and computer algebra
- USING NONSTANDARD ANALYSIS TO ENSURE THE CORRECTNESS OF SYMBOLIC COMPUTATIONS
- Mathematical Knowledge Management
- Certified Computer Algebra on Top of an Interactive Theorem Prover
- Modelling general recursion in type theory
This page was built for publication: Automating Side Conditions in Formalized Partial Functions
