Lazy techniques for fully expansive theorem proving (Q1309245): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formulation of the simple theory of types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A higher-order implementation of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with proof plans for induction / rank
 
Normal rank

Latest revision as of 11:58, 22 May 2024

scientific article
Language Label Description Also known as
English
Lazy techniques for fully expansive theorem proving
scientific article

    Statements

    Lazy techniques for fully expansive theorem proving (English)
    0 references
    0 references
    0 references
    20 April 1994
    0 references
    0 references
    HOL theorem prover
    0 references
    delayed computation
    0 references
    lazy theorem
    0 references
    lazy conversion
    0 references
    optimization
    0 references
    primitive inference
    0 references
    0 references
    0 references
    0 references
    0 references