Ordered Models of the Lambda Calculus

نویسندگان

  • Alberto Carraro
  • Antonino Salibra
چکیده

: Answering a question by Honsell and Plotkin, we show that there are two equations between λ-terms, the so-called subtractive equations, consistent with λ-calculus but not simultaneously satisfied in any partially ordered model with bottom element. We also relate the subtractive equations to the open problem of the order-incompleteness of λ-calculus, by studying the connection between the notion of absolute unorderability in a specific point and a weaker notion of subtractivity (namely n-subtractivity) for partially ordered algebras. Finally we study the relation between n-subtractivity and relativized separation conditions in topological algebras, obtaining an incompleteness theorem for a general topological semantics of λ-calculus.

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

ثبت نام

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

منابع مشابه

Order-Incompleteness and Finite Lambda Models (Extended Abstract)

Many familiar models of the type-free lambda calculus are constructed by order theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory ofβorβη-conversion, the partial order is trivial on term denotations. Equivalently, the open and closed term algebras of the type-free la...

متن کامل

Order-incompleteness and finite lambda reduction models

Many familiar models of the untyped lambda calculus are constructed by order theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory of βor βη-conversion, the partial order is trivial on term denotations. Equivalently, the open and closed term algebras of the untyped lamb...

متن کامل

Towards Lambda Calculus Order-Incompleteness

After Scott, mathematical models of the type-free lambda calculus are constructed by order theoretic methods and classiied into semantics according to the nature of their representable functions. Selinger 47] asked if there is a lambda theory that is not induced by any non-trivially partially ordered model (order-incompleteness problem). In terms of Alexandroo topology (the strongest topology w...

متن کامل

Topological Incompleteness and Order Incompleteness of the Lambda Calculus

A model of the untyped lambda calculus induces a lambda theory, i.e., a congruence relation on -terms closed under and -conversion. A semantics (= class of models) of the lambda calculus is incomplete if there exists a lambda theory which is not induced by any model in the semantics. In this paper we introduce a new technique to prove the incompleteness of a wide range of lambda calculus semant...

متن کامل

A Continuum of Theories of Lambda Calculus without Semantics

In this paper we give a topological proof of the following result: There exist 2@0 lambda theories of the untyped lambda calculus without a model in any semantics based on Scott’s view of models as partially ordered sets and of functions as monotonic functions. As a consequence of this result, we positively solve the conjecture, stated by Bastonero-Gouy [6, 7] and by Berline [10], that the stro...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Logical Methods in Computer Science

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2013