We present a game model of the untyped-calculus, with equational theory equal to the B ohm tree-t... more We present a game model of the untyped-calculus, with equational theory equal to the B ohm tree-theory B, which is universal (i.e. every element of the model is deÿnable by some term). This answers a question of Di Gianantonio, Franco and Honsell. We build on our earlier work, which uses the methods of innocent game semantics to develop a universal model inducing the maximal consistent sensible theory H *. To our knowledge these are the ÿrst syntax-independent universal models of the untyped-calculus.
We present a game model of the untyped-calculus, with equational theory equal to the B ohm tree-t... more We present a game model of the untyped-calculus, with equational theory equal to the B ohm tree-theory B, which is universal (i.e. every element of the model is deÿnable by some term). This answers a question of Di Gianantonio, Franco and Honsell. We build on our earlier work, which uses the methods of innocent game semantics to develop a universal model inducing the maximal consistent sensible theory H *. To our knowledge these are the ÿrst syntax-independent universal models of the untyped-calculus.
Hereditarily sequential functionals: a game-theoretic approach to sequentiality
The aim of this thesis is to give a new understanding of sequential computations in higher types.... more The aim of this thesis is to give a new understanding of sequential computations in higher types. We present a new computation model for higher types based on a game describing the interaction between a functional and its arguments. The functionals which may be ...
Abstract In order to define models of simply typed functional programming languages being closer ... more Abstract In order to define models of simply typed functional programming languages being closer to the operational semantics of these languages, the notions'of sequentiality, stability and seriality were introduced. These works originated from the definability problem for PCF, posed in [ ...
We present a game model of the untyped-calculus, with equational theory equal to the B ohm tree-t... more We present a game model of the untyped-calculus, with equational theory equal to the B ohm tree-theory B, which is universal (i.e. every element of the model is deÿnable by some term). This answers a question of Di Gianantonio, Franco and Honsell. We build on our earlier work, which uses the methods of innocent game semantics to develop a universal model inducing the maximal consistent sensible theory H *. To our knowledge these are the ÿrst syntax-independent universal models of the untyped-calculus.
We present a game model of the untyped-calculus, with equational theory equal to the B ohm tree-t... more We present a game model of the untyped-calculus, with equational theory equal to the B ohm tree-theory B, which is universal (i.e. every element of the model is deÿnable by some term). This answers a question of Di Gianantonio, Franco and Honsell. We build on our earlier work, which uses the methods of innocent game semantics to develop a universal model inducing the maximal consistent sensible theory H *. To our knowledge these are the ÿrst syntax-independent universal models of the untyped-calculus.
Hereditarily sequential functionals: a game-theoretic approach to sequentiality
The aim of this thesis is to give a new understanding of sequential computations in higher types.... more The aim of this thesis is to give a new understanding of sequential computations in higher types. We present a new computation model for higher types based on a game describing the interaction between a functional and its arguments. The functionals which may be ...
Abstract In order to define models of simply typed functional programming languages being closer ... more Abstract In order to define models of simply typed functional programming languages being closer to the operational semantics of these languages, the notions'of sequentiality, stability and seriality were introduced. These works originated from the definability problem for PCF, posed in [ ...
Uploads
Papers by Hanno Nickau