Usability: formalising (un)definedness in typed lambda calculus
In this paper we discuss usability, and propose to take that notion as a formalisation of (un)definedness in typed lambda calculus, especially in calculi based on PCF. We discuss some important properties that make usability attractive as a formalisation of (un)definedness. There is a remarkable difference between usability and solvability: in the untyped lambda calculus the solvable terms are precisely the terms with a head normal form, whereas in typed lambda calculus the usable terms are “between” the terms with a normal form and the terms with a (weak) head normal form.
Unable to display preview. Download preview PDF.
- Abramsky, S. (1990), The Lazy Lambda Calculus, in: Turner, D.A. (Editor), Research Topics in Functional Programming Languages, Addison-Wesley, Reading, Massachusetts.Google Scholar
- Barendregt, H.P. (1971), Some extensional term models for combinatory logics and lambda calculi, Ph.D. Thesis, Utrecht.Google Scholar
- Barendregt, H.P. (1975), Solvability in lambda calculi, Colloque International de Logique, Clermont Ferrand, 209–219.Google Scholar
- Barendregt, H.P. (1984), The Lambda Calculus — Its Syntax and Semantics (revised edition), North-Holland, Amsterdam.Google Scholar
- Berry, G., P.-L. Curien, J.-J. Lévy (1985), Full abstraction for sequential languages: state of the art, in: Nivat, M. and J.C. Reynolds (Editors), Algebraic Methods in Semantics, Cambridge University Press, Cambridge, 89–132.Google Scholar
- Kuper, J. (1994), Partiality in Logic and Computation — Aspects of Undefinedness, Ph.D.Thesis, Enschede.Google Scholar
- Ong, C.-H.L. (1988), The Lazy Lambda Calculus: an Investigation into the Foundations of Functional Programming, Ph.D. Thesis, Imperial College, London.Google Scholar