Working Paper
Refine
Year of publication
- 2008 (137) (remove)
Document Type
- Working Paper (137) (remove)
Is part of the Bibliography
- no (137)
Keywords
- USA (7)
- Deutschland (6)
- Bank (5)
- Geldpolitik (5)
- Lambda-Kalkül (5)
- Operationale Semantik (5)
- Programmiersprache (5)
- Haushalt (4)
- Liquidität (4)
- Aging (3)
Institute
Sur initiative du Professeur Paul Krüger Andersen, Danemark, et de l’auteur du présent article1, les 27 et 28 septembre 2007 a eu lieu au Danemark la première réunion d’une commission qui s’est fixé comme objectif la conception d’un European Model Company Law Act (EMCLA). Le projet sera décrit dans ce qui suit. Il ne vise ni l’harmonisation impérative des droits des sociétés nationaux ni la création d’une forme supplémentaire de société européenne. Le but est d’élaborer des normes modèles pour les sociétés de capitaux, dans un premier temps pour la société anonyme, qui pourraient être reprises tout ou en partie par les législateurs nationaux. Le projet doit donc être conçu comme une alternative ou un complément aux instruments existants d’harmonisation légale au niveau communautaire (II.). Il convient par la suite de décrire l’expérience américaine avec de telles « lois modèles » en matière de droit des sociétés (III.). Enfin une ébauche des problèmes spécifiques auxquels se heurtera le EMCLA sera faite tandis que seront exposés la composition et le plan de travail de la commission (IV.).
We present a higher-order call-by-need lambda calculus enriched with constructors, case-expressions, recursive letrec-expressions, a seq-operator for sequential evaluation and a non-deterministic operator amb that is locally bottom-avoiding. We use a small-step operational semantics in form of a single-step rewriting system that defines a (nondeterministic) normal order reduction. This strategy can be made fair by adding resources for bookkeeping. As equational theory we use contextual equivalence, i.e. terms are equal if plugged into any program context their termination behaviour is the same, where we use a combination of may- as well as must-convergence, which is appropriate for non-deterministic computations. We show that we can drop the fairness condition for equational reasoning, since the valid equations w.r.t. normal order reduction are the same as for fair normal order reduction. We evolve different proof tools for proving correctness of program transformations, in particular, a context lemma for may- as well as mustconvergence is proved, which restricts the number of contexts that need to be examined for proving contextual equivalence. In combination with so-called complete sets of commuting and forking diagrams we show that all the deterministic reduction rules and also some additional transformations preserve contextual equivalence.We also prove a standardisation theorem for fair normal order reduction. The structure of the ordering <=c a is also analysed: Ω is not a least element, and <=c already implies contextual equivalence w.r.t. may-convergence.
This paper considers a trading game in which sequentially arriving liquidity traders either opt for a market order or for a limit order. One class of traders is considered to have an extended trading horizon, implying their impatience is linked to their trading orientation. More specifically, sellers are considered to have a trading horizon of two periods, whereas buyers only have a single-period trading scope (the extended buyer-horizon case is completely symmetric). Clearly, as the life span of their submitted limit orders is longer, this setting implies sellers are granted a natural advantage in supplying liquidity. This benefit is hampered, however, by the direct competition arising between consecutively arriving sellers. Closed-form characterizations for the order submission strategies are obtained when solving for the equilibrium of this dynamic game. These allow to examine how these forces affect traders´ order placement decisions. Further, the analysis yields insight into the dynamic process of price formation and into the market clearing process of a non-intermediated, order driven market.
The paper proposes a variation of simulation for checking and proving contextual equivalence in a non-deterministic call-by-need lambda-calculus with constructors, case, seq, and a letrec with cyclic dependencies. It also proposes a novel method to prove its correctness. The calculus' semantics is based on a small-step rewrite semantics and on may-convergence. The cyclic nature of letrec bindings, as well as non-determinism, makes known approaches to prove that simulation implies contextual equivalence, such as Howe's proof technique, inapplicable in this setting. The basic technique for the simulation as well as the correctness proof is called pre-evaluation, which computes a set of answers for every closed expression. If simulation succeeds in finite computation depth, then it is guaranteed to show contextual preorder of expressions.
In this paper we consider the dynamics of spot and futures prices in the presence of arbitrage. We propose a partially linear error correction model where the adjustment coefficient is allowed to depend non-linearly on the lagged price difference. We estimate our model using data on the DAX index and the DAX futures contract. We find that the adjustment is indeed nonlinear. The linear alternative is rejected. The speed of price adjustment is increasing almost monotonically with the magnitude of the price difference.
We investigate methods and tools for analyzing translations between programming languages with respect to observational semantics. The behavior of programs is observed in terms of may- and mustconvergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental correctness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This technique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extensions.
We investigate methods and tools for analysing translations between programming languages with respect to observational semantics. The behaviour of programs is observed in terms of may- and mustconvergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental correctness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This technique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extensions.
We investigate methods and tools for analysing translations between programming languages with respect to observational semantics. The behaviour of programs is observed in terms of may- and mustconvergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental correctness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This technique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extensions.
We investigate methods and tools for analysing translations between programming languages with respect to observational semantics. The behaviour of programs is observed in terms of may- and must-convergence in arbitrary contexts, and adequacy of translations, i.e., the reflection of program equivalence, is taken to be the fundamental correctness condition. For compositional translations we propose a notion of convergence equivalence as a means for proving adequacy. This technique avoids explicit reasoning about contexts, and is able to deal with the subtle role of typing in implementations of language extension.
Inhalt: 1. Gesellschaftsrecht als neues Rechtgebiet für die Rechtsordnungen der GUS: 1 2. Besonderheiten der AG in den Staaten der GUS 4 3. Ausgewählte Probleme des Aktienrechts 6 a. Corporate Governance 6 b. Haftung der Organe 7 c. Aktionärsrechte, vor allem Auskunftsrechte 9 d. Große Geschäfte – krupnie sdelki 10 e. Verträge mit Interessiertheit 12 4. Reform des Aktienrechts 13 a. Entscheidung der interparlamentarischen Versammlung 13 b. Grundlagen des neuen Konzeptes zu einem Modell-Aktiengesetz 14 c. Vorschläge des Konzeptes zu oben erwähnten Problemen 17 Zusammenfassung 19 Zusammenfassung: Allein die kurze Schilderung der Entwicklung des Gesellschaftsrechts in den GUS-Staaten zeigt die Notwendigkeit der Reformen auf diesem Gebiet. Wichtig ist, dass die Länder, die traditionell zur kontinental-europäischen Rechtsfamilie gehören, im Rahmen dieser Familie bleiben. Die kritiklose und bedingungslose Übernahme der Institute der Common-Law-Tradition hat für zahlreiche Irritationen und Verwirrungen gesorgt. Die Korrektur dieser Missentwicklungen kann als große Herausforderung der Reform des Aktienrechts der Staaten der GUS bezeichnet werden.