Canonical typing and Π-conversion (1997)

Cached

Download Links

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

Active Bibliography

14 A unified approach to Type Theory through a refined λ-calculus – Fairouz Kamareddine, Rob Nederpelt - 1994
41 On Stepwise Explicit Substitution – Fairouz Kamareddine, Rob Nederpelt - 1993
4 Canonical typing and Π-conversion in the Barendregt Cube – Fairouz Kamareddine, Rob Nederpelt - 1996
Term Reshuffling in the Barendregt Cube – Roel Bloo Fairouz, Fairouz Kamareddine, Rob Nederpelt
1 Are Types needed for Natural Language? – Fairouz Kamareddine - 1996
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
Redexes in Item Notation Classical Notation Item Notation – Fairouz Kamareddine, Λx. (λy. Λz. Zd)c)b)a →β - 2009
Refining Reduction in the lambda calculus – Fairouz Kamareddine, Rob Nederpelt - 1996
2 A System At the Cross-Roads of Functional and Logic Programming – Fairouz Kamareddine - 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
2 The Soundness of Explicit Substitution with Nameless Variables – Fairouz Kamareddine - 1995
Postponement, Conservation and Preservation of Strong Normalisation for Generalised Reduction – Fairouz Kamareddine
3 Reviewing the classical and the de Bruijn notation for λ-calculus and pure type systems – Fairouz Kamareddine - 2001
2 Set Theory and Nominalisation, Part I – Fairouz Kamareddine - 1996
2 Set Theory and Nominalisation, Part II – Fairouz Kamareddine - 1992
Theoretical Foundations for Practical ‘Totally Functional Programming’ – Colin Kemp - 2007
Lessons from Thérèse's Work – Fairouz Kamareddine - 2010