Pedagogical second-order \(\lambda \)-calculus

DOI10.1016/j.tcs.2009.04.020zbMath1191.03011OpenAlexW2076878483MaRDI QIDQ732007

Loïc Colson, David Michel

Publication date: 9 October 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.04.020

zbMATH Keywords

constructive mathematicsnatural deductiontyped \(\lambda \)-calculusnegationless mathematics

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intuitionism. An introduction
• Deductive capabilities of negationless intuitionistic arithmetic
• A complete negationless system
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• A negationless interpretation of intuitionistic theories. I
• A negationless interpretation of intuitionistic theories. II
• Pedagogical Second-order Propositional Calculi
• Non-null implication