Verifying termination and reduction properties about higher-order logic programs (Q850496): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-005-6534-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031835656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A predicative analysis of structural recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination properties of prolog programs: A semantic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: HiLog: A foundation for higher-order logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantic basis for the termination analysis of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular termination proofs for rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for defining logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-change principle for program termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification under a mixed prefix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural deduction as higher-order resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination proofs for logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Coverage Checking Algorithm for LF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proving the termination of algorithms by machine / rank
 
Normal rank

Latest revision as of 22:40, 24 June 2024

scientific article
Language Label Description Also known as
English
Verifying termination and reduction properties about higher-order logic programs
scientific article

    Statements

    Verifying termination and reduction properties about higher-order logic programs (English)
    0 references
    0 references
    3 November 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Logical frameworks
    0 references
    termination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references