Combinatory Christology

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Collapsing Partial Combinatory Algebras

Partial combinatory algebras occur regularly in the literature as a framework for an abstract formulation of computation theory or re-cursion theory. In this paper we develop some general theory concerning homomorphic images (or collapses) of pca's, obtained by identiication of elements in a pca. We establish several facts concerning nal collapses (maximal identiication of elements). `En passan...

متن کامل

Parallel combinatory OFDM signaling

In this paper, A Parallel Combinatory-Orthogonal Frequency Division Multiplexing (PC-OFDM) system is proposed and analyzed. The proposed system selects at each symbol interval a subset of the available sub-carriers, and the selected sub-carriers are modulated by points from an M-PSK signal constellation. PC-OFDM systems can be designed to have lower Peak to Average Power Ratio (PAPR), higher ba...

متن کامل

Combinatory Logic Synthesizer

We present Combinatory Logic Synthesizer (CL)S, a typebased tool to automatically compose larger systems from repositories of components. We overview its underlying theory, combinatory logic with intersection types, and exemplify its application to synthesis. We describe features and architecture of the tool and our plans for its ongoing and future development. Finally, we present some use case...

متن کامل

Bounded Combinatory Logic

In combinatory logic one usually assumes a fixed set of basic combinators (axiom schemes), usually K and S. In this setting the set of provable formulas (inhabited types) is Pspacecomplete in simple types and undecidable in intersection types. When arbitrary sets of axiom schemes are considered, the inhabitation problem is undecidable even in simple types (this is known as Linial-Post theorem)....

متن کامل

Infinitary Combinatory Reduction Systems

We define infinitary combinatory reduction systems (iCRSs). This provides the first extension of infinitary rewriting to higher-order rewriting. We lift two well-known results from infinitary term rewriting systems and infinitary λ-calculus to iCRSs: 1. every reduction sequence in a fully-extended left-linear iCRS is compressible to a reduction sequence of length at most ω, and 2. every complet...

متن کامل

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


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

ژورنال

عنوان ژورنال: HTS Teologiese Studies / Theological Studies

سال: 2016

ISSN: 2072-8050,0259-9422

DOI: 10.4102/hts.v72i4.3482