Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (Q5747766): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
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
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (English)
0 references
14 September 2010
0 references
0 references