Game semantics for untyped λβη-calculus

نویسنده

  • Pietro Di Gianantonio
چکیده

We study extensional models of the untyped lambda calculus in the setting of the game semantics introduced by Abramsky, Hyland et alii. In particular we show that, somewhat unexpectedly and contrary to what happens in ordinary categories of domains, all reflexive objects in a standard category of games, induce the same λ-theory. This is H∗, the maximal theory induced already by the classical C.P.O. model D∞, introduced by Scott in 1969. This results indicates that the current notion of game carries a very specific bias towards head reduction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Models and theories of λ-calculus

In this paper we briefly summarize the contents of Manzonetto’s PhD thesis [35] which concerns denotational semantics and equational/order theories of the pure untyped λ-calculus. The main research achievements include: (i) a general construction of λ-models from reflexive objects in (possibly non-well-pointed) categories; (ii) a Stonestyle representation theorem for combinatory algebras; (iii)...

متن کامل

Models and theories of lambda calculus

In this paper we briefly summarize the contents of Manzonetto’s PhD thesis [35] which concerns denotational semantics and equational/order theories of the pure untyped λ-calculus. The main research achievements include: (i) a general construction of λ-models from reflexive objects in (possibly non-well-pointed) categories; (ii) a Stonestyle representation theorem for combinatory algebras; (iii)...

متن کامل

Effective λ-models versus recursively enumerable λ-theories

A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...

متن کامل

Effective lambda-models vs recursively enumerable lambda-theories

A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...

متن کامل

Lambda Theories of Effective Lambda Models

A longstanding open problem is whether there exists a nonsyntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ. In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which covers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998