Automating Side Conditions in Formalized Partial Functions (Q5505512): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-valued complex functions and computer algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: USING NONSTANDARD ANALYSIS TO ENSURE THE CORRECTNESS OF SYMBOLIC COMPUTATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling general recursion in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Knowledge Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Computer Algebra on Top of an Interactive Theorem Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Recursive Functions in Higher-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: NIST digital library of mathematical functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: First Order Logic with Domain Conditions / rank
 
Normal rank

Latest revision as of 00:50, 29 June 2024

scientific article; zbMATH DE number 5498236
Language Label Description Also known as
English
Automating Side Conditions in Formalized Partial Functions
scientific article; zbMATH DE number 5498236

    Statements