A Logical Approach to Type Soundness: A logical approach to type soundness

Συγγραφείς: Amin Timany, Robbert Krebbers, Derek Dreyer, Lars Birkedal

Πηγή: 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/3676954

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Mathematics and the formal turn

Συγγραφείς: Avigad, Jeremy

Πηγή: Bulletin of the American Mathematical Society. 61:225-240

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2311.00007
https://zbmath.org/7826993
https://doi.org/10.1090/bull/1832

From type theory to setoids and back

Συγγραφείς: Erik Palmgren

Πηγή: Mathematical Structures in Computer Science. 32:1283-1312

Θεματικοί όροι: 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)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/1909.01414
https://zbmath.org/7676407
https://doi.org/10.1017/s0960129521000189

A Coq Formalization of Lebesgue Integration of Nonnegative Functions: A Coq formalization of Lebesgue integration of nonnegative functions

Συγγραφείς: Sylvie Boldo, Florian Faissole, François Clément, Micaela Mayero, Vincent Martin

Συνεισφορές: Clement, Francois, Formally Verified Programs, Certified Tools and Numerical Computations (TOCCATA), Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-Centre Inria de l'Université Paris-Saclay, Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria), Simulation for the Environment: Reliable and Efficient Numerical Algorithms (SERENA), Centre Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École nationale des ponts et chaussées (ENPC), Laboratoire de Mathématiques Appliquées de Compiègne (LMAC), Université de Technologie de Compiègne (UTC), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, This work was partly supported by the Paris Île-de-France Region (DIM RFSI MILC). This work was partly supported by Labex DigiCosme (project ANR-11-LABEX-0045-DIGICOSME) operated by ANR as part of the program 'Investissement d’Avenir' Idex Paris-Saclay (ANR-11-IDEX-0003-02). This work was partly supported by the European Research Council (ERC) under the EuropeanUnion’s Horizon 2020 Research and Innovation Programme – Grant Agreement n◦810367., ANR-11-LABX-0045,DIGICOSME,Mondes numériques: Données, programmes et architectures distribués(2011), ANR-11-IDEX-0003,IPS,Idex Paris-Saclay(2011), European Project: 810367,EMC2(2019)

Πηγή: Journal of Automated Reasoning. 66:175-213

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: 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

Partial Correctness of an Algorithm Computing Lucas Sequences: Partial correctness of an algorithm computing Lucas sequences

Συγγραφείς: Adrian Jaszczak

Πηγή: Formalized Mathematics. 28:279-288

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://repozytorium.uwb.edu.pl/jspui/bitstream/11320/10981/1/10.2478_forma-2020-0025.pdf
https://www.sciendo.com/article/10.2478/forma-2020-0025
https://repozytorium.uwb.edu.pl/jspui/handle/11320/10981

On the mechanization of the theory of equations

Συγγραφείς: Robinson, A.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/3337681