Filters








2,249 Hits in 2.5 sec

Comparative Study of DSL Tools

Naveneetha Vasudevan, Laurence Tratt
2011 Electronical Notes in Theoretical Computer Science  
In Stratego, however, term rewriting can be extended with dynamic rules to perform type checking.  ...  We focus our attention on the crucial stage of the transformation pipeline-the transformation program. A transformation program is implemented using a set of term-rewrite rules and strategies.  ... 
doi:10.1016/j.entcs.2011.06.007 fatcat:vy6q6vx2uffnpixk73xke6lzqy

An embedding of Ruby in Isabelle [chapter]

Ole Rasmussen
1996 Lecture Notes in Computer Science  
A small subset of Ruby, called Pure Ruby, is embedded as a conservative extension of ZF and many useful structures used in connection with VLSI design are de ned in terms of Pure Ruby.  ...  The inductive package of Isabelle is used to characterise the Pure Ruby subset to allow proofs to be performed by structural induction over the Pure Ruby elements.  ...  Acknowledgements Thanks to Robin Sharp for inspiring cooperation with the development of the T-Ruby design system and to Larry Paulson for being very helpful answering my Isabelle/ZF questions.  ... 
doi:10.1007/3-540-61511-3_80 fatcat:aetihd2akzhbjas5tx6vycsppi

Comment on "Failure of the Work-Hamiltonian Connection for Free-Energy Calculations"

Luca Peliti
2008 Physical Review Letters  
I point out that the arguments raised by Vilar and Rubi against the work-Hamiltonian connection in free-energy calculations imply, if correct, the failure of the statistical mechanical expression of the  ...  According to Vilar and Rubi [1] , this expression for ∆G "is not thermodynamically valid when changes of the Hamiltonian cannot be associated with the work performed on the system".  ...  A(x) e −βH(x,λ) /Z λ is the canonical average with the hamiltonian H(x, λ).  ... 
doi:10.1103/physrevlett.101.098903 pmid:18851667 fatcat:v2cj5tiezbaf7ildwhghssavja

A Short Historical Survey of Functional Hardware Languages

Gang Chen
2012 ISRN Electronics  
Sharp and Rasmussen also wrote a transformational rewriting system [42, 43] . The derivation of functional programs from Ruby was investigated by Hutton [37, 44, 45] .  ...  ., Ruby); other methods include induction (e.g., Daisy), term rewriting (e.g., Bluespec), combination of theorem proving, and model checking (e.g., reFL ect ).  ... 
doi:10.5402/2012/271836 fatcat:n2iml6tnnzhzbcjyuslsmdpy64

Girls are not "ordinary". Some priorities of contemporary fictional autobiographies of girlhood

Margarida Morgado
2003 Tessera  
rewriting our autobiographies, we often 'rewrite culture' as we rewrite our lives, privileging different conventional turning points such as adolescence or retirement" (40).  ...  cultural hegemonies of rewriting the self.  ... 
doi:10.25071/1923-9408.25515 fatcat:spjnpbnknrfglg5hhmyxg2xxvm

Widening the representation bottleneck

Dave Cattrall, Colin Runciman
1993 Proceedings of the conference on Functional programming languages and computer architecture - FPCA '93  
However a complex implementation, using a combination of polymorphic type inference and automatic program transformation to select appropriate representations, is needed to support this language.  ...  Ruby is associated with a collection of transformation rules based on algebraic laws over relational expressions.  ...  We use a number of methods for rewriting expressions. Each method combines rewrite rules to transform some class of expression.  ... 
doi:10.1145/165180.165206 dblp:conf/fpca/CattrallR93 fatcat:bgwasa2nl5belbnu55zjnnzaay

High-performance cross-language interoperability in a multi-language runtime

Matthias Grimmer, Chris Seaton, Roland Schatz, Thomas Würthinger, Hanspeter Mössenböck
2015 Proceedings of the 11th Symposium on Dynamic Languages - DLS 2015  
This paper presents an implementation of our ideas based on the Truffle system and its guest language implementations JavaScript, Ruby, and C.  ...  Language implementations use language-independent messages that the runtime resolves at their first execution by transforming them to efficient foreign-language-specific operations.  ...  Rewriting capability: LIs need a rewriting capability that allows them to replace IR snippets with different IR snippets at run time.  ... 
doi:10.1145/2816707.2816714 dblp:conf/dls/GrimmerSSWM15 fatcat:tvyuybn5wjgpxeboccb53rlpym

Profile-guided static typing for dynamic scripting languages

Michael Furr, Jong-hoon (David) An, Jeffrey S. Foster
2009 SIGPLAN notices  
PRuby augments DRuby with a novel dynamic analysis and transformation that allows us to precisely type uses of highly dynamic constructs. PRuby's analysis proceeds in three steps.  ...  Finally, we run DRuby's static type inference on the transformed code to enforce type safety. We used PRuby to gather profiles for a benchmark suite of sample Ruby programs.  ...  The relation e → e rewrites the expression e, inserting · where needed. We give three example rewrite rules.  ... 
doi:10.1145/1639949.1640110 fatcat:4a2zkyt2urgt3kathszjgye5y4

Profile-guided static typing for dynamic scripting languages

Michael Furr, Jong-hoon (David) An, Jeffrey S. Foster
2009 Proceeding of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications - OOPSLA 09  
PRuby augments DRuby with a novel dynamic analysis and transformation that allows us to precisely type uses of highly dynamic constructs. PRuby's analysis proceeds in three steps.  ...  Finally, we run DRuby's static type inference on the transformed code to enforce type safety. We used PRuby to gather profiles for a benchmark suite of sample Ruby programs.  ...  The relation e → e rewrites the expression e, inserting · where needed. We give three example rewrite rules.  ... 
doi:10.1145/1640089.1640110 dblp:conf/oopsla/FurrAF09 fatcat:xm6yrwho4namnkackzl4mbbrg4

Formal synthesis in circuit design — A classification and survey [chapter]

Ramayya Kumar, Christian Blumenröhr, Dirk Eisenbiegler, Detlef Schmid
1996 Lecture Notes in Computer Science  
The typical derivation of an implementation in Ruby involves the use of term-rewriting using equivalences or conditional equivalences.  ...  The systems RLEXT, RUBY and DDD are not based on theorem provers. However, due to the use of an algebraic foundation, RUBY and DDD do not have a large number of basic transformations.  ... 
doi:10.1007/bfb0031817 fatcat:bz6cob6jd5bo3izawypciavotq

nfn2dlp and nfnsolve: Normal Form Nested Programs Compiler and Solver [chapter]

Annamaria Bria, Wolfgang Faber, Nicola Leone
2009 Lecture Notes in Computer Science  
The answer sets of the original NFN program can be obtained from the answer sets of the transformed program (which in turn can be obtained by using a DLP system) by a simple transformation.  ...  The system has been implemented using the object-oriented programming language Ruby and Treetop, a language for Parsing Expression Grammars (PEGs).  ...  The algorithm transforms one rule at a time.  ... 
doi:10.1007/978-3-642-04238-6_45 fatcat:qlqelpriz5bv5fb2vdbqhd2uzy

Optimizing Cursor Loops in Relational Databases [article]

Surabhi Gupta, Sanket Purandare, Karthik Ramachandra
2020 arXiv   pre-print
Thereby, Aggify completely eliminates the loop by rewriting the query to use this generated aggregate.  ...  Such loops, known as cursor loops, come with huge trade-offs and overheads w.r.t. performance, resource consumption and concurrency.  ...  For the purpose of detailed performance evaluation, we have considered the RUBiS benchmark [11] and two other examples and manually transformed them using Algorithm 1.  ... 
arXiv:2004.05378v3 fatcat:rsklsxopifdwha6sd6krvi6r3a

Static Typing for Ruby on Rails

Jong-hoon An, Avik Chaudhuri, Jeffrey S. Foster
2009 2009 IEEE/ACM International Conference on Automated Software Engineering  
Ruby on Rails (or just "Rails") is a popular web application framework built on top of Ruby, an objectoriented scripting language.  ...  DRails works by translating Rails programs into pure Ruby code in which Rails's numerous implicit conventions are made explicit.  ...  The major steps include parsing a Ruby file containing the database schema; transforming HTML files with embedded Ruby into pure Ruby code that renders the same web page; using a dynamic "load-time" analysis  ... 
doi:10.1109/ase.2009.80 dblp:conf/kbse/AnCF09 fatcat:yqixgm4jcvc3lc2dgviaik5zxe

Programming by a sample

Björn Hartmann, Leslie Wu, Kevin Collins, Scott R. Klemmer
2007 Proceedings of the 20th annual ACM symposium on User interface software and technology - UIST '07  
An initial study with eight participants found d.mix to enable rapid experimentation, and suggested avenues for improving its annotation mechanism.  ...  With d.mix, users browse annotated web sites and select elements to sample. d.mix's sampling mechanism generates the underlying service calls that yield those elements.  ...  ACKNOWLEDGMENTS We thank Leith Abdulla and Michael Krieger for programming and video production help; whytheluckystiff for Ruby support; and Wendy Ju for comments.  ... 
doi:10.1145/1294211.1294254 dblp:conf/uist/HartmannWCK07 fatcat:jri556zdtfao5dihk6zpmfylte

Programming by a sample [chapter]

Björn Hartmann, Leslie Wu, Kevin Collins, Scott R. Klemmer
2010 No Code Required  
An initial study with eight participants found d.mix to enable rapid experimentation, and suggested avenues for improving its annotation mechanism.  ...  With d.mix, users browse annotated web sites and select elements to sample. d.mix's sampling mechanism generates the underlying service calls that yield those elements.  ...  ACKNOWLEDGMENTS We thank Leith Abdulla and Michael Krieger for programming and video production help; whytheluckystiff for Ruby support; and Wendy Ju for comments.  ... 
doi:10.1016/b978-0-12-381541-5.00010-9 fatcat:qx4cdhmqsbdmtecksfx7uzdy4q
« Previous Showing results 1 — 15 out of 2,249 results