scientific article; zbMATH DE number 432705

MaRDI QIDQ3138832zbMATH OpenFDO

Authors Solomon Feferman

Publication date 18 November 1993

zbMATH Keywords

functional programmingimplicit polymorphismprimitive recursive arithmetic

Mathematics Subject Classification ID

Logic in computer science (03B70) First-order arithmetic and fragments (03F30) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 65743
• scientific article; zbMATH DE number 194511
• scientific article; zbMATH DE number 1722646
• On the proof theory of type two functionals based on primitive recursive operations
• Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion

Cited in

(15)

• Formalizing non-termination of recursive programs
• Theories with self-application and computational complexity.
• Axioms for strict and lazy functional programs
• Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
• A note on the \(\Pi_ 2^ 0\)-induction rule
• A flexible type system for the small Veblen ordinal
• scientific article; zbMATH DE number 1722646 (Why is no real title available?)
• scientific article; zbMATH DE number 65743 (Why is no real title available?)
• Proof-theoretic notions for software maintenance
• Tiered arithmetics
• On the proof theory of type two functionals based on primitive recursive operations
• Explicit mathematics: power types and overloading
• scientific article; zbMATH DE number 6606377 (Why is no real title available?)
• Intrinsic reasoning about functional programs. I: First order theories
• Term rewriting theory for the primitive recursive functions

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