Extensible and Efficient Automation Through Reflective Tactics (Q2802496): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-49498-1_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2478126725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program Logics for Certified Compilers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Object-Oriented Programs with Higher-Order Separation Logic in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Charge! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Reflexive Arithmetic Tactics the Linear Case and Beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular SMT Proofs for Fast Reflexive Checking Inside Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tactics for Reasoning Modulo AC in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type Theory Should Eat Itself / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular development of certified program verifiers with a proof assistant, / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed syntactic meta-programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-Producing Reflection for HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Types in Type Theory: Deep and Shallow Encodings / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to make ad hoc proof automation less ad hoc / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compiled implementation of strong reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Importing HOL Light into Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Auto in Agda / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal certification of a compiler back-end or / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional Computational Reflection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a verified relational database management system / rank
 
Normal rank
Property / cites work
 
Property / cites work: VeriML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mtac / rank
 
Normal rank

Latest revision as of 20:28, 11 July 2024

scientific article
Language Label Description Also known as
English
Extensible and Efficient Automation Through Reflective Tactics
scientific article

    Statements

    Extensible and Efficient Automation Through Reflective Tactics (English)
    0 references
    0 references
    0 references
    26 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers