Author:
Kamareddine Fairouz,Nederpelt Rob
Abstract
AbstractIn this article, we extend the Barendregt Cube with ∏-conversion (which is the analogue of β-conversion, on product type level) and study its properties. We use this extension to separate the problem of whether a term is typable from the problem of what is the type of a term.
Publisher
Cambridge University Press (CUP)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Formal System for the Universal Quantification of Schematic Variables;ACM Transactions on Computational Logic;2022-01-31
2. Automath Type Inclusion in Barendregt’s Cube;Lecture Notes in Computer Science;2015
3. The formal system λδ;ACM Transactions on Computational Logic;2009-10
4. Typed $\lambda$-calculi with one binder;Journal of Functional Programming;2005-06-08
5. Revisiting the notion of function;The Journal of Logic and Algebraic Programming;2003-01