Výsledky vyhledávání - "Formalization of mathematics in connection with theorem provers"
-
1
Autoři: a další
Zdroj: Journal of the Association for Computing Machinery, 71, 6, pp. 1-75
Timany, A, Krebbers, R, Dreyer, D & Birkedal, L 2024, 'A Logical Approach to Type Soundness', Journal of the ACM, vol. 71, no. 6, 40. https://doi.org/10.1145/3676954Témata: Logic in computer science, Type soundness, Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.), Theory of programming languages, Semantics in the theory of computing, Iris, type soundness, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, logical relations, Formalization of mathematics in connection with theorem provers, Software Science, data abstraction, 0202 electrical engineering, electronic engineering, information engineering, Coq, step-indexing, concurrent separation logic
Popis souboru: application/xml
Přístupová URL adresa: https://zbmath.org/8030807
https://doi.org/10.1145/3676954
https://hdl.handle.net/https://repository.ubn.ru.nl/handle/2066/312783
https://doi.org/10.1145/3676954
https://hdl.handle.net/2066/312783
https://repository.ubn.ru.nl//bitstream/handle/2066/312783/312783.pdf
https://pure.au.dk/portal/en/publications/6c1d3054-690e-429f-8d9e-527c436f14b6
http://www.scopus.com/inward/record.url?scp=85212245880&partnerID=8YFLogxK
https://doi.org/10.1145/3676954 -
2
Autoři: Avigad, Jeremy
Zdroj: Bulletin of the American Mathematical Society. 61:225-240
Témata: Presentation and content markup for mathematics, Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.), Mathematics - History and Overview, History and Overview (math.HO), History of computer science, Mathematics - Logic, 02 engineering and technology, lean proof assistant, 01 natural sciences, formalised mathematics, 03B35, 68V20 (Primary) 68Q60, 68V15, 68V25, 68V35, 68T01, 97U50 (Secondary), Mechanization of proofs and logical operations, Formalization of mathematics in connection with theorem provers, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Digital mathematics libraries and repositories, 0101 mathematics, Logic (math.LO), interactive theorem provers
Popis souboru: application/xml
Přístupová URL adresa: http://arxiv.org/abs/2311.00007
https://zbmath.org/7826993
https://doi.org/10.1090/bull/1832 -
3
Autoři: Erik Palmgren
Zdroj: Mathematical Structures in Computer Science. 32:1283-1312
Témata: Type theory, constructive set theory, Mathematics - Logic, 0102 computer and information sciences, Other constructive mathematics, setoids, 01 natural sciences, Martin-Löf type theory, 03B15, 03B35, 03E70, 03F50, Formalization of mathematics in connection with theorem provers, FOS: Mathematics, 0101 mathematics, extensionality, Logic (math.LO)
Popis souboru: application/xml
-
4
Autoři: a další
Přispěvatelé: a další
Zdroj: Journal of Automated Reasoning. 66:175-213
Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Lebesgue integration, [MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], 02 engineering and technology, [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA], Integrals of Riemann, Stieltjes and Lebesgue type, [MATH.MATH-CA] Mathematics [math]/Classical Analysis and ODEs [math.CA], 01 natural sciences, Logic in Computer Science (cs.LO), Functional Analysis (math.FA), Mathematics - Functional Analysis, measure theory, Formalization of mathematics in connection with theorem provers, formal proof, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Coq, 0101 mathematics
Popis souboru: application/xml; application/pdf
Přístupová URL adresa: http://arxiv.org/pdf/2104.05256
http://arxiv.org/abs/2104.05256
https://link.springer.com/content/pdf/10.1007/s10817-021-09612-0.pdf
https://arxiv.org/abs/2104.05256
https://hal.inria.fr/hal-03194113/document
https://hal.inria.fr/hal-03194113
https://dblp.uni-trier.de/db/journals/corr/corr2104.html#abs-2104-05256 -
5
Autoři: Adrian Jaszczak
Zdroj: Formalized Mathematics. 28:279-288
Témata: program verification, Lucas sequences, Logic in computer science, Specification and verification (program logics, model checking, etc.), nominative data, Formalization of mathematics in connection with theorem provers, 0202 electrical engineering, electronic engineering, information engineering, Fibonacci and Lucas numbers and polynomials and generalizations, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Number-theoretic algorithms, complexity
Popis souboru: application/xml
-
6
Autoři: Robinson, A.
Témata: Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.), Formalization of mathematics in connection with theorem provers, elementary theory of equations, semantically complete calculus
Popis souboru: application/xml
Přístupová URL adresa: https://zbmath.org/3337681
Full Text Finder
Nájsť tento článok vo Web of Science