Barendregt, H. P. (1993). Lambda calculi with types,Handbook of logic in computer science (vol. 2): background: computational structures.Edited by S. Abramsky, D.M. Gabbay and T.S.E. Maibaum. Oxford University
These calculi may be proved useful in encoding commutations of...Bono V., Venneri B., and Bettini L., A Typed Lambda Calculus with Intersection Types, Theo- retical Computer Science 398, pp. 95-113, Elsevier, 2008.Bono, V., Venneri, B., Bettini, L.: A typed lambda calculus with...
It is worth pointing out that although typed λ-calculi are considered the quintessential proof structure for intuitionistic logic, Church, as the father of the λ-calculus, has shown little interest in intuitionistic logic himself: in particular, his development of STT was based on classical logic...
Baillot, P., Terui, K.: Light types for polynomial time computation in lambda-calculus. In:Proceedings of LICS’04, 266–275 (2004) Barendregt, H.P.:Lambda calculi with types. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.), Handbook of Logic in Computer Science, ...
M. Pitts. A fully abstract translation between a lambda-calculus with reference types and Standard ML. In M. Dezani-Ciancaglini and G. D. Plotkin, ... E Ritter,AM Pitts - International Conference on Typed Lambda Calculi & Applications 被引量: 60发表: 1995年 [Lecture Notes in Computer Sc...
Types depending on terms, or dependent types. Imposing only this property yields λΠ, a type system closely related to LF. All eight calculi include the most basic form of abstraction, terms depending on terms, ordinary functions as in the simply-typed lambda calculus. The richest calculus in...
Lambdacalculi with dependenttypesare the base of intuitionistictypetheory, thecalculusof constructions and the logical framework (LF), a purelambda calculuswith dependenttypes. 有依赖类型的lambda演算是直觉类型论、构造演算和逻辑框架(LF)的基础,它是带有依赖类型的纯lambda演算。
C. Hankin, Lambda Calculi, A Guide for Computer Scientists, OUP Graduate Texts in Computer Science...
Levy Labels and Recursive Types Chapter © 2016 Extensions of Lambek Calculi Chapter © 2021 The Lambek Calculus Extended with Intuitionistic Propositional Logic Article 12 March 2016 References Church, A. 1936 Mathematical logic, Department of Mathematics, Princeton University, mimeographed notes ...
The intrinsic treatment of binding in the lambda calculus makes it an ideal data structure for representing syntactic objects with binding such as formulas, proofs, types, and programs. Supporting such a data structure in an implementation is made difficult by the complexity of the substitution ...