Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,516,001 papers from all fields of science
Search
Sign In
Create Free Account
Coq (software)
Known as:
Coq (proof assistant)
, COQ
, Coq proof assistant
Expand
In computer science, Coq is an interactive theorem prover. It allows the expression of mathematical assertions, mechanically checks proofs of these…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ALF (proof assistant)
Agda
Andrew Appel
Automated reasoning
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Natural Language Inference in Coq
S. Chatzikyriakidis
,
Zhaohui Luo
Journal of Logic, Language and Information
2014
Corpus ID: 16248499
In this paper we propose a way to deal with natural language inference (NLI) by implementing Modern Type Theoretical Semantics in…
Expand
Highly Cited
2013
Highly Cited
2013
Cycle-accurate information assurance by proof-carrying based signal sensitivity tracing
Yier Jin
,
Bo Yang
,
Y. Makris
IEEE International Symposium on Hardware Oriented…
2013
Corpus ID: 3185107
We propose a new information assurance model which can dynamically track the information flow in circuit designs and hence…
Expand
2009
2009
Practical Tactics for Separation Logic
Andrew McCreight
International Conference on Theorem Proving in…
2009
Corpus ID: 8988631
We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics…
Expand
Review
2008
Review
2008
Computerizing Mathematical Text with MathLang
Fairouz Kamareddine
,
J. Wells
Workshop on Logical and Semantic Frameworks with…
2008
Corpus ID: 7853863
2008
2008
Oracle semantics
A. Appel
,
Aquinas Hobor
2008
Corpus ID: 67289170
We define a Concurrent Separation Logic with first-class locks and threads for the C language, and prove its soundness in Coq…
Expand
2007
2007
The Java Memory Model: a Formal Explanation
M. Huisman
,
G. Petri
2007
Corpus ID: 18567458
This paper discusses the new Java Memory Model (JMM), introduced for Java 1.5. The JMM specifies the allowed executions of…
Expand
2007
2007
Simple Types in Type Theory: Deep and Shallow Encodings
François Garillot
,
Benjamin Werner
International Conference on Theorem Proving in…
2007
Corpus ID: 17205984
We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is…
Expand
2003
2003
Implementing Modules in the Coq System
J. Chrzaszcz
International Conference on Theorem Proving in…
2003
Corpus ID: 206582081
The paper describes the implementation of interactive ML-style modules in the recent version 7.4 of Coq proof assistant. Modules…
Expand
2001
2001
Calculational Reasoning Revisited (An Isabelle/Isar Experience)
G. Bauer
,
M. Wenzel
International Conference on Theorem Proving in…
2001
Corpus ID: 3126656
We discuss the general concept of calculational reasoning within Isabelle/Isar, which provides a framework for high-level natural…
Expand
Review
1997
Review
1997
Metalanguages and Applications
E. Moggi
,
A. Pitts
,
P. Dybjer
1997
Corpus ID: 62904196
The aim of these notes is to describe the monadic and incremental approaches to the de-notational semantics of programming…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE