Stratified polymorphism and primitive recursion

DOI10.1017/S0960129599002868zbMATH Open0935.03024OpenAlexW1977616074WikidataQ127632351 ScholiaQ127632351MaRDI QIDQ4704766

Daniel M. Leivant, Norman Danner

Publication date: 4 May 2000

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129599002868

zbMATH Keywords

primitive recursive functionssecond-order lambda calculustype abstractionGrzegorczyk hierarchynumeric functions

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Programming Languages and Systems ⋮ Taming Modal Impredicativity: Superlazy Reduction

Recommendations

• Subtyping recursion and parametric polymorphism in kernel Fun 👍 👎
• On Polymorphic Recursion, Type Systems, and Abstract Interpretation 👍 👎
• Primitive recursion in the abstract 👍 👎
• Programming Languages and Systems 👍 👎
• Primitive recursion for higher-order abstract syntax 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Stratified polymorphism and primitive recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4704766)