scientific article; zbMATH DE number 1531370

zbMATH Open0962.68036MaRDI QIDQ4513587FDOQ4513587

Authors: Karl-Heinz Niggl 

Publication date: 28 February 2001

Title of this publication is not available (Why is that?)

Recommendations

• Higher type recursion, ramification and polynomial time
• Linear types and non-size-increasing polynomial time computation.
• Polytime, combinatory logic and positive safe induction
• scientific article; zbMATH DE number 512786
• scientific article; zbMATH DE number 445159

zbMATH Keywords

polynomial time computable functionsKalmar-elementary functions

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (4)

• Title not available (Why is that?)
• The geometry of linear higher-order recursion
• Computer Science Logic
• Linear types and non-size-increasing polynomial time computation.

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 Q4513587)