Typed \lambda-calculi with one binder

DOI10.1017/S095679680500554XMaRDI QIDQ5695119zbMATH OpenOpenAlexFDO

Authors Fairouz Kamareddine

Publication date 11 October 2005

Published in Journal of Functional Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Automath type inclusion in Barendregt's cube
• A unified approach to type theory through a refined -calculus
• scientific article; zbMATH DE number 512879
• On -conversion in the -cube and the combination with abbreviations
• Introduction to generalized type systems

Cited in

(4)

• A unified approach to type theory through a refined -calculus
• On functions and types: a tutorial
• Automath type inclusion in Barendregt's cube
• An extended type system with lambda-typed lambda-expressions

This page was built for publication: Typed $\lambda$-calculi with one binder

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