This paper describes the construction of categorical models for the nu-calculus, a language that combines higher-order functions with dynamically created names. Names are created with local scope, they can be compared with each other and passed around through function application, but that is all. The intent behind this language is to examine one aspect of the imperative character of Standard ML: the use of local state by dynamic creation of references. The nu-calculus is equivalent to a certain fragment of ML, omitting side effects, exceptions, datatypes and recursion. Even without all these features, the interaction of name creation with higher-order functions can be complex and subtle; it is particularly difficult to characterise the obs...
AbstractThis paper lifts earlier category-theoretic results on datatypes to the level of an abstract...
ABSTRACT: Nominal techniques concern the study of names using mathematical semantics. Whereas in muc...
AbstractThe problem of defining fully abstract operational models of name passing calculi has been g...
Many functional programming languages rely on the elimination of 'impure' features: assignment to va...
The nu-calculus of Pitts and Stark is a typed lambda-calculus, extended with state in the form of dy...
The research reported in this paper is concerned with the problem of reasoning about properties of h...
Pitts and Stark's $\nu$-calculus is a paradigmatic total language forstudying the problem of context...
The nu-calculus of Pitts and Stark is a typed lambda-calculus, extended with statein the form of dyn...
Pitts and Stark's nu-calculus is a paradigmatic total language for studying the problem of contextua...
Abstract. Pitts and Stark’s ν-calculus is a paradigmatic total language for studying the problem of ...
Abstract. The research reported in this paper is concerned with the prob-lem of reasoning about prop...
Game Semantics arguably stands for one of the most successful techniques in denotational semantics, ...
We examine the denotational semantics of a language extending the nu-calculus of Pitts and Stark by ...
The nu-calculus of Pitts and Stark was introduced as a paradigmatic functional language with a very ...
AbstractWe describe a fully abstract semantics for a simple functional language with locally declare...
AbstractThis paper lifts earlier category-theoretic results on datatypes to the level of an abstract...
ABSTRACT: Nominal techniques concern the study of names using mathematical semantics. Whereas in muc...
AbstractThe problem of defining fully abstract operational models of name passing calculi has been g...
Many functional programming languages rely on the elimination of 'impure' features: assignment to va...
The nu-calculus of Pitts and Stark is a typed lambda-calculus, extended with state in the form of dy...
The research reported in this paper is concerned with the problem of reasoning about properties of h...
Pitts and Stark's $\nu$-calculus is a paradigmatic total language forstudying the problem of context...
The nu-calculus of Pitts and Stark is a typed lambda-calculus, extended with statein the form of dyn...
Pitts and Stark's nu-calculus is a paradigmatic total language for studying the problem of contextua...
Abstract. Pitts and Stark’s ν-calculus is a paradigmatic total language for studying the problem of ...
Abstract. The research reported in this paper is concerned with the prob-lem of reasoning about prop...
Game Semantics arguably stands for one of the most successful techniques in denotational semantics, ...
We examine the denotational semantics of a language extending the nu-calculus of Pitts and Stark by ...
The nu-calculus of Pitts and Stark was introduced as a paradigmatic functional language with a very ...
AbstractWe describe a fully abstract semantics for a simple functional language with locally declare...
AbstractThis paper lifts earlier category-theoretic results on datatypes to the level of an abstract...
ABSTRACT: Nominal techniques concern the study of names using mathematical semantics. Whereas in muc...
AbstractThe problem of defining fully abstract operational models of name passing calculi has been g...