Abstract

Record calculi have recently been a very active field of research, but its reciprocal, i.e. the use of keywords in functions, is still ignored. Selective -calculus is a conservative extension of lambda calculus which, by labeling abstractions and applications, enables some form of commutation between arguments. It is an enhancement for both clarity, thanks to labels, and power with the possibility to commute. We propose here a simply typed version of this calculus, and show that it extends to second order and polymorphic typing. For this last one there exists a most generic type, and we give the algorithm to find it. This, combined with the fact selective -calculus extends naturally lambda calculus, giving numeric labels their intuitive meaning, provides us with a keyword extension for polymorphically typed languages like ML, compatible with the original syntax, where unlabeled abstractions and applications can be seen as labeled by 1. 1 Introduction The idea of introducing labels in ...

Citations