Finitely stratified polymorphism

DOI10.1016/0890-5401(91)90053-5zbMath0799.68041OpenAlexW2034083013MaRDI QIDQ1175334

Daniel Leivant

Publication date: 25 June 1992

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90053-5

zbMATH Keywords

\(\lambda\)-calculuscomputations in finite fields

Mathematics Subject Classification ID

Theory of programming languages (68N15) Computational number theory (11Y99) Combinatory logic and lambda calculus (03B40)

Related Items (13)

Unnamed Item ⋮ Existential type systems between Church and Curry style (type-free style) ⋮ The calculus of dependent lambda eliminations ⋮ Graded modal dependent type theory ⋮ The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types ⋮ Predicative logic and formal arithmetic ⋮ 1998–99 Annual Meeting of the Association for Symbolic Logic ⋮ Tiering as a Recursion Technique ⋮ Induction and inductive definitions in fragments of second order arithmetic ⋮ Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity ⋮ Typability and type checking in System F are equivalent and undecidable ⋮ Alpha-conversion and typability ⋮ The naturality of natural deduction. II: on atomic polymorphism and generalized propositional connectives

Cites Work

• The typed lambda-calculus is not elementary recursive
• The Expressiveness of Simple and Second-Order Type Structures
• La prédicativité
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• The formalization of mathematics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finitely stratified polymorphism