نتایج جستجو برای: convertibility

تعداد نتایج: 257  

2004
Claudio Sacerdoti Coen

In this paper we analyse the modifications on logical operations — as proof checking, type inference, reduction and convertibility — that are required for the identification of a proof assistant environment with a distributed mathematical library, focusing on proof assistants based on the Curry-Howard isomorphism. This identification is aimed at the integration of Mathematical Knowledge Managem...

2015
Alexander Meduna

This paper explains the gist underlying regulated grammars and automata as well as the main purpose of their investigation. This investigation is classified into four major topics—the study of their power, properties, reduction, and mutual convertibility. The paper illustrates this investigation by a case study in terms of one-sided random-context grammars. Most importantly, it points out that ...

Journal: :Vestnik Tomskogo gosudarstvennogo universiteta. Èkonomika 2023

The object of the study is international flow capital, with a focus on capital account management in world and China. aims to identify trends directions development Methods comparative analysis, synthesis, generalization are used. author proposes an evolution model cross-border management, amalyzes problems current macro-prudential China, makes suggestions for its improvement. concludes that fu...

1999
Tristan Crolard

We derive a confluent λ-calculus with a catch/throw mechanism (called λct-calculus) from M. Parigot’s λμ-calculus. We also present several translations from one calculus into the other which are morphisms for the reduction. We use them to show that the λct-calculus is a retract of λμ-calculus (these calculi are isomorphic if we consider only convertibility). As a by-product, we obtain the subje...

2006
Adam Koprowski

In this paper we present a formalization of the simply typed lambda calculus with constants and with typing à la Church. It has been accomplished using the theorem prover Coq. The formalization includes, among other results, definitions of typed terms over arbitrary many-sorted signature, a substitution operating on typing judgements, an equivalence relation generalizing the concept of α-conver...

2001
Márcio G. P. Garcia Tatiana Didier

We compute and estimate the two risks that keep Brazilian interest rates extremely high: the currency and country risks. The Brazil risk is directly measured from fixed income instruments and derivatives, while the currency risk is estimated via Kalman Filter. Results identify a few important components of the Brazil risk, as the convertibility risk and the international financial markets condi...

2001
Haibin Zhu

This paper proposes a model in which bank runs are closely related to the state of the business cycle. The benchmark model shows that, in a market economy, there are welfare losses due to the existence of bank runs. Extensions of the model explore the welfare effects of various government policies. The results suggest that an interest-cap deposit insurance scheme is an efficient policy to preve...

2011
LUMINITA POPA

The paper argues that Reconfigurable Manufacturing Systems (RMS) and Environmentally Benign Manufacturing (EBM) could play a very important role in the context of Green Revolution. The paper analyzes RMS as a machining system which can be created by incorporating basic process modules both hardware and software that can be interchangeable, rearranged or replaced quickly and reliably. The author...

2006
Philip Turner

The first annual meeting of Deputy Governors from the emerging markets took place at the BIS in February 1995. It had as its central focus the challenge to central banks (and supervisors) as countries moved towards a more liberal banking system in the context of wider capital account convertibility. There was at that meeting a common sense of unease about short-term capital flows, a good deal o...

1994
Corrado Böhm Adolfo Piperno Stefano Guerrini

Lambda-calculus is extended in order to represent a rather large class of recursive equation systems, implicitly characterizing function(al)s or mappings of some algebraic domain into arbitrary sets. Algebraic equality will then be represented by λβδ-convertibility (or even reducibility). It is then proved, under very weak assumptions on the structure of the equations, that there always exist s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید