A survey of deep learning for mathematical reasoning

P Lu, L Qiu, W Yu, S Welleck, KW Chang - arXiv preprint arXiv:2212.10535, 2022 - arxiv.org
Mathematical reasoning is a fundamental aspect of human intelligence and is applicable in
various fields, including science, engineering, finance, and everyday life. The development …

A survey of advanced information fusion system: From model-driven to knowledge-enabled

D Zhu, H Yin, Y Xu, J Wu, B Zhang, Y Cheng… - Data Science and …, 2023 - Springer
Advanced knowledge engineering (KE), represented by knowledge graph (KG), drives the
development of various fields and engineering technologies and provides various …

[图书][B] Semantics of types for mutable state

AJ Ahmed - 2004 - search.proquest.com
Proof-carrying code (PCC) is a framework for mechanically verifying the safety of machine
language programs. A program that is successfully verified by a PCC system is guaranteed …

A very modal model of a modern, major, general type system

AW Appel, PA Mellies, CD Richards… - Proceedings of the 34th …, 2007 - dl.acm.org
We present a model of recursive and impredicatively quantified types with mutable
references. We interpret in this model all of the type constructors needed for typed …

Int: An inequality benchmark for evaluating generalization in theorem proving

Y Wu, AQ Jiang, J Ba, R Grosse - arXiv preprint arXiv:2007.02924, 2020 - arxiv.org
In learning-assisted theorem proving, one of the most critical challenges is to generalize to
theorems unlike those seen at training time. In this paper, we introduce INT, an INequality …

A machine-checked theory of floating point arithmetic

J Harrison - International Conference on Theorem Proving in …, 1999 - Springer
Intel is applying formal verification to various pieces of mathematical software used in
Merced, the first implementation of the new IA-64 architecture. This paper discusses the …

Multilingual mathematical autoformalization

AQ Jiang, W Li, M Jamnik - arXiv preprint arXiv:2311.03755, 2023 - arxiv.org
Autoformalization is the task of translating natural language materials into machine-
verifiable formalisations. Progress in autoformalization research is hindered by the lack of a …

AutoVerus: Automated proof generation for Rust code

C Yang, X Li, MRH Misu, J Yao, W Cui, Y Gong… - arXiv preprint arXiv …, 2024 - arxiv.org
Generative AI has shown its values for many software engineering tasks. Still in its infancy,
large language model (LLM)-based proof generation lags behind LLM-based code …

A predicative analysis of structural recursion

A Abel, T Altenkirch - Journal of functional programming, 2002 - cambridge.org
We introduce a language based upon lambda calculus with products, coproducts and strictly
positive inductive types that allows the definition of recursive terms. We present the …

A full formalisation of π-calculus theory in the calculus of constructions

D Hirschkoff - International Conference on Theorem Proving in …, 1997 - Springer
A formalisation of π-calculus in the Coq system is presented. Based on a de Bruijn notation
for names, our implementation exploits the mechanisation of some proof techniques …