Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
Logic in Computer Science
2011-11-02 v1 Programming Languages
Abstract
We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The resulting denotations are smaller and better-behaved, in ways we make precise, than functional valuation-based models. Using these new models, we then develop a generalisation of \lambda-term syntax enriching them with existential meta-variables, thus yielding a theory of incomplete functions. This incompleteness is orthogonal to the usual notion of incompleteness given by function abstraction and application, and corresponds to holes and incomplete objects.
Keywords
Cite
@article{arxiv.1111.0089,
title = {Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets},
author = {Murdoch J. Gabbay and Dominic P. Mulligan},
journal= {arXiv preprint arXiv:1111.0089},
year = {2011}
}
Comments
In Proceedings LFMTP 2011, arXiv:1110.6685