A survey of rewriting strategies in program transformation systems

E Visser - Electronic Notes in Theoretical Computer Science, 2001 - Elsevier
Program transformation is used in a wide range of applications including compiler
construction, optimization, program synthesis, refactoring, software renovation, and reverse …

[图书][B] Stylish academic writing

H Sword - 2011 - degruyter.com
For many academics,“stylish academic writing” is at best an oxymoron and at worst a risky
business. Why, they ask, should we accessorize our research with gratuitous stylistic …

A history of Haskell: being lazy with class

P Hudak, J Hughes, S Peyton Jones… - Proceedings of the third …, 2007 - dl.acm.org
A history of Haskell Page 1 A History of Haskell: Being Lazy With Class Paul Hudak Yale
University paul.hudak@yale.edu John Hughes Chalmers University rjmh@cs.chalmers.se …

Stratego/XT 0.17. A language and toolset for program transformation

M Bravenboer, KT Kalleberg, R Vermaas… - Science of computer …, 2008 - Elsevier
Stratego/XT is a language and toolset for program transformation. The Stratego language
provides rewrite rules for expressing basic transformations, programmable rewriting …

Vice versa: The decoupling of content and topic heterogeneity in collusion research

WB Schmal - Journal of Economic Surveys, 2023 - Wiley Online Library
Collusive practices continue to be a significant threat to competition and consumer welfare. It
should be of utmost importance for academic research to provide the theoretical and …

Safer smart contract programming with Scilla

I Sergey, V Nagaraj, J Johannsen, A Kumar… - Proceedings of the …, 2019 - dl.acm.org
The rise of programmable open distributed consensus platforms based on the blockchain
technology has aroused a lot of interest in replicated stateful computations, aka smart …

MontiCore: a framework for compositional development of domain specific languages

H Krahn, B Rumpe, S Völkel - International journal on software tools for …, 2010 - Springer
Abstract Domain specific languages (DSLs) are increasingly used today. Coping with
complex language definitions, evolving them in a structured way, and ensuring their error …

[PDF][PDF] First-class phantom types

J Cheney, R Hinze - 2003 - ecommons.cornell.edu
Classical phantom types are datatypes in which type constraints are expressed using type
variables that do not appear in the datatype cases themselves. They can be used to embed …

Giving Haskell a promotion

BA Yorgey, S Weirich, J Cretin… - Proceedings of the 8th …, 2012 - dl.acm.org
Static type systems strive to be richly expressive while still being simple enough for
programmers to use. We describe an experiment that enriches Haskell's kind system with …

Practical type inference for arbitrary-rank types

SP Jones, D Vytiniotis, S Weirich… - Journal of functional …, 2007 - cambridge.org
Haskell's popularity has driven the need for ever more expressive type system features, most
of which threaten the decidability and practicality of Damas-Milner type inference. One such …