COMBINATORY LOGIC AND $ lambda $-CALCULUS FOR CLASSICAL LOGIC
نویسندگان
چکیده
منابع مشابه
Combinatory Logic and - Calculus for Classical Logic
Since Gri n's work in 1990, classical logic has been an attractive target for extracting computational contents. However, the classical principle used in Gri n's type system is the double-negation-elimination rule, which prevents one to analyze the intuitionistic part and the purely classical part separately. By formulating a calculus with J (for the elimination rule of falsehood) and P (for Pe...
متن کاملHistory of Lambda-calculus and Combinatory Logic
8 Types 23 8.1 The general development of type theories . . . . . . . . . . . . . . . 23 8.1.1 Types as grammatical categories . . . . . . . . . . . . . . . . 24 8.1.2 Types as sets . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 8.1.3 Types as objects . . . . . . . . . . . . . . . . . . . . . . . . . 26 8.1.4 Types as propositions . . . . . . . . . . . . . . . . . . . . . . 30 8.2 Ear...
متن کاملBinary Lambda Calculus and Combinatory Logic
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-interpreters for these binary languages. Along the way we also present new results on list representations, bracket abstraction, and fixpoint combinators. In the second part we review Algorithmic Information Theory, for whi...
متن کاملCall-by-Value Combinatory Logic and the Lambda-Value Calculus
Since it is unsound to reason about call-by-value languages using call-by name equational theories, we present two by-value combinatory logics and translations from the-value (v) calculus to the logics. The rst by-value logic is constructed in a manner similar to the v-calculus: it is based on the by-name combinatory logic, but the combinators are strict. The translation is non-standard to acco...
متن کاملClassical Combinatory Logic
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original combinatory calculus corresponds to minimal implicative logic written in a system “à la Hilbert”. We present in this paper a combinatory logic which corresponds to pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 2000
ISSN: 0286-522X
DOI: 10.5109/13496