scientific article; zbMATH DE number 785053
From MaRDI portal
Publication:4842542
zbMATH Open0827.03032MaRDI QIDQ4842542
Publication date: 13 December 1995
Title of this publication is not available (Why is that?)
cut eliminationprogram transformationrecursive programstermination proofsproof transformationlogical costrecursive-to-tail-recursive transformation
Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) General topics in the theory of software (68N01) Complexity of proofs (03F20)
Related Items (7)
An almost machine-independent theory of program-length complexity, sophistication, and induction ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ The treewidth of proofs ⋮ Title not available (Why is that?) ⋮ Proof complexity of monotone branching programs ⋮ Recursive proof composition from accumulation schemes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4842542)
