نتایج جستجو برای: convertibility
تعداد نتایج: 257 فیلتر نتایج به سال:
T he Argentine experiment with convertibility ended in collapse. There is no shortage of after-the-fact explanations of what went wrong, but the search for lessons presupposes that by studying the experience, analysts can gain some knowledge that was not available beforehand. Any analysis of a case like that of Argentina must address the issue of how and why agents behaved in such a way that pr...
BACKGROUND The infectious prion protein (PrPSc or prion) is derived from its cellular form (PrPC) through a conformational transition in animal and human prion diseases. Studies have shown that the interspecies conversion of PrPC to PrPSc is largely swayed by species barriers, which is mainly deciphered by the sequence and conformation of the proteins among species. However, the bank vole PrPC ...
We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusing existing compilers and runtime environments for stock functional languages, without peeking under the hood, for a fast yet cheap system in terms of implementation effort. Our focus is on performance of untyped normalization b...
Paratactic syntactic structures are notoriously difficult to represent in dependency formalisms. This has painful consequences such as high frequency of parsing errors related to coordination. In other words, coordination is a pending problem in dependency analysis of natural languages. This paper tries to shed some light on this area by bringing a systematizing view of various formal means dev...
In near future, there would be tremendous scarcity of sources of animal proteins and protein food requirement will be the top priority. The insects can solve the problem of protein food requirement of humans as most suitable food since insect diet increase the food convertibility and caloric and nutritive values. Simultaneously, it reduces the risk of cholesterol and heart fail. As human diet i...
In proof systems like Coq [15], proof-checking involves comparing types modulo β-conversion, which is potentially a time-consuming task. Significant speed-ups are achieved by compiling proof terms, see [8]. Since compilation erases some type information, we have to show that convertibility is preserved by type erasure. This article shows the equivalence of the Calculus of Inductive Construction...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید