A Derived Reasonable Abstract Machine for Strong Call by Value

2021 ◽  
Author(s):  
Malgorzata Biernacka ◽  
Witold Charatonik ◽  
Tomasz Drab
Keyword(s):  
2017 ◽  
Vol 11 (3) ◽  
pp. 429-456
Author(s):  
Melissa Adler

Guided by Deleuze's taxonomic theory and practice and his concepts concerning the body, literature, territory and assemblage, this article examines library classification as a technique of discipline and bibliographic control. Locating books written by and about Deleuze reveals processes of discipline formation and the circulation of knowledge, and it troubles the principles upon which the classification is based. A Deleuzian critique presents the Library of Congress Classification as an abstract machine that diagrams knowledge in many academic libraries around the world.


1991 ◽  
Vol 25 (Special Issue) ◽  
pp. 164-175
Author(s):  
David E. Culler ◽  
Anurag Sah ◽  
Klaus E. Schauser ◽  
Thorsten von Eicken ◽  
John Wawrzynek

Author(s):  
Riyad Al-Shalabi ◽  
Ghassan Kanaan ◽  
Huda Al-Sarhan ◽  
Alaa Drabsh ◽  
Islam Al-Husban

Abstract—Machine translation (MT) allows direct communication between two persons without the need for the third party or via dictionary in your pocket, which could bring significant and per formative improvement. Since most traditional translational way is a word-sensitive, it is very important to consider the word order in addition to word selection in the evaluation of any machine translation. To evaluate the MT performance, it is necessary to dynamically observe the translation in the machine translator tool according to word order, and word selection and furthermore the sentence length. However, applying a good evaluation with respect to all previous points is a very challenging issue. In this paper, we first summarize various approaches to evaluate machine translation. We propose a practical solution by selecting an appropriate powerful tool called iBLEU to evaluate the accuracy degree of famous MT tools (i.e. Google, Bing, Systranet and Babylon). Based on the solution structure, we further discuss the performance order for these tools in both directions Arabic to English and English to Arabic. After extensive testing, we can decide that any direction gives more accurate results in translation based on the selected machine translations MTs. Finally, we proved the choosing of Google as best system performance and Systranet as the worst one.  Index Terms: Machine Translation, MTs, Evaluation for Machine Translation, Google, Bing, Systranet and Babylon, Machine Translation tools, BLEU, iBLEU.


2003 ◽  
Vol 10 (25) ◽  
Author(s):  
Dariusz Biernacki ◽  
Olivier Danvy

Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lambda-calculus. The key transformation here is Reynolds's defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a transition system, i.e., an abstract machine. Similar denotational and operational semantics were studied by de Bruin and de Vink in previous work (their article at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations.<br /><br />Superseded by BRICS-RS-04-5.


2002 ◽  
Vol 66 (3) ◽  
pp. 145-169 ◽  
Author(s):  
Florence Germain ◽  
Marc Lacoste ◽  
Jean-Bernard Stefani

Sign in / Sign up

Export Citation Format

Share Document