Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (Q5747766): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ETPS / rank
 
Normal rank
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/978-3-642-14203-1_23 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1523149815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Termination Analysis for Programs with Second-Order Recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to mathematical logic and type theory: To truth through proof. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3894958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mechanical Proof of the Unsolvability of the Halting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Termination(T) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4823141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255517 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:42, 3 July 2024

scientific article; zbMATH DE number 5785454
Language Label Description Also known as
English
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
scientific article; zbMATH DE number 5785454

    Statements

    Identifiers