Canonical typing and Π-conversion in the Barendregt Cube (1996)

Cached

Download Links

by Fairouz Kamareddine , Rob Nederpelt
Citations:4 - 3 self

Active Bibliography

3 Canonical typing and Π-conversion – Fairouz Kamareddine, Rob Nederpelt - 1997
Term Reshuffling in the Barendregt Cube – Roel Bloo Fairouz, Fairouz Kamareddine, Rob Nederpelt
Redexes in Item Notation Classical Notation Item Notation – Fairouz Kamareddine, Λx. (λy. Λz. Zd)c)b)a →β - 2009
3 Reviewing the classical and the de Bruijn notation for λ-calculus and pure type systems – Fairouz Kamareddine - 2001
14 A unified approach to Type Theory through a refined λ-calculus – Fairouz Kamareddine, Rob Nederpelt - 1994
37 The Barendregt Cube with Definitions and Generalised Reduction – Roel Bloo, Fairouz Kamareddine, Rob Nederpelt - 1997
Beyond beta-Reduction in Church's ... – Roel Bloo, Fairouz Kamareddine, Rob Nederpelt - 1996
Refining Reduction in the lambda calculus – Fairouz Kamareddine, Rob Nederpelt - 1996
The Lambda-Cube With Classes Which Approximate Reductional Equivalence – Roel Bloo, Fairouz Kamareddine, Rob Nederpelt - 1995
1 A Useful λ-Notation – Fairouz Kamareddine, Rob Nederpelt - 1996
Russell’s 1903 – 1905 Anticipation of the Lambda Calculus – Kevin C. Klement - 2003
1 Belief Revision In Type Theory – Tijn Borghuis, Fairouz Kamareddine, Rob Nederpelt
3 A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems – Fairouz Kamareddine, Twan Laan - 2001
5 Equivalences between Logics and their Representing Type Theories – Philippa Gardner - 1992
18 Higher Order Logic – Daniel Leivant - 1994
Lambda-Calculus and Functional Programming – Jonathan P. Seldin
Irrelevance, Polymorphism, and Erasure in Type Theory – Richard Nathan Mishra-Linger - 2008
Abstraction-Based Genetic Programming By – Franck J. L. Binard
1 Proof Nets for Intuitionistic Logic – Matthias Horbach - 2006