A list-machine benchmark for mechanized metatheory (Q1945921): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2088975898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very modal model of a modern, major, general type system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Purely Functional Contents from Logical Inductive Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coinductive big-step operational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack-based typed assembly language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactic approach to type soundness / rank
 
Normal rank

Latest revision as of 08:36, 6 July 2024

scientific article
Language Label Description Also known as
English
A list-machine benchmark for mechanized metatheory
scientific article

    Statements

    A list-machine benchmark for mechanized metatheory (English)
    0 references
    0 references
    0 references
    0 references
    17 April 2013
    0 references
    theorem proving
    0 references
    proof assistants
    0 references
    program proof
    0 references
    compiler verification
    0 references
    typed machine language
    0 references
    metatheory
    0 references
    \texttt{Coq}
    0 references
    \texttt{Twelf}
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers