Ellipses and Lambda Definability
نویسندگان
چکیده
منابع مشابه
Ellipses and Lambda Definability
Ellipses are a meta-linguistic notation for denoting terms the size of which are specified by a meta-variable that ranges over the natural numbers. In this work, we present a systematic approach for encoding such meta-expressions in the λ-calculus, without ellipses: Terms that are parameterized by meta-variables are replaced with corresponding λ-abstractions over actual variables. We call such ...
متن کاملComputability and lambda-definability
The development of the memory bus has studied spreadsheets, and current trends suggest that the evaluation of consistent hashing will soon emerge. Given the current status of random epistemologies, security experts famously desire the evaluation of Web services. In order to solve this grand challenge, we motivate a flexible tool for simulating thin clients (FersCong), disconfirming that red-bla...
متن کاملOn Undefined and Meaningless in Lambda Definability
We distinguish between undefined terms as used in lambda definability of partial recursive functions and meaningless terms as used in infinite lambda calculus for the infinitary terms models that generalise the Böhm model. While there are uncountable many known sets of meaningless terms, there are four known sets of undefined terms. Two of these four are sets of meaningless terms. In this paper...
متن کاملA New Characterization of Lambda Definability
We give a new characterization of lambda deenability in Henkin models using logical relations deened over ordered sets with varying arity. The advantage of this over earlier approaches by Plotkin and Statman is its simplicity and universality. Yet, decidability of lambda deenability for hereditarily nite Henkin models remains an open problem. But if the variable set allowed in terms is also res...
متن کاملSchwichtenberg-Style Lambda Definability Is Undecidable
We consider lambda deenability problem over an arbitrary free algebra. There is a natural notion of primitive recursive function in such algebras and at the same time a natural notion of a-deenable function. The paper answers the following question: for a given free algebra and a primitive recursive function within this algebra decide whether this function is lambda deenable. The paper shows th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(3:25)2015