Disciplined Meta-Programming

严格的元编程

• 批准号: 262084-2012
• 负责人: Carette, Jacques
• 金额: $ 1.6万
• 依托单位: McMaster University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2012
• 资助国家: 加拿大
• 起止时间: 2012-01-01 至 2013-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=508106
• 关键词: Disciplined; Meta; Programming

Computer scientists have been writing programs which manipulate programs (such as compilers) for a very long time. Software engineers, on the other hand, have been much slower to use this particular technique, mostly because standard design methodologies do not embrace such techniques. This has recently started to change, and there are a variety of reasons for this, amongst which: 1. the increasing popularity of Domain Specific Languages, 2. the fact that writing parallel software by hand is difficult and error-prone, and 3. that current programming languages offer poor "higher-level" abstraction mechanisms. Unfortunately, few meta-programs (as programs which manipulate programs are called) encountered "in the wild" are as well-structured as "regular" programs. In other words, there does not seem to be good development models for writing such programs. This is rather unfortunate, as meta-programs allow standard software engineering concepts (such as design choices) to become first-class software artifacts. Furthermore, in the case of mature domains (like scientific computation), higher-order structure can be effectively captured and leveraged to both drastically shorten source programs as well as to generate more efficient run-time programs. Our objective is to rectify this situation, in the context of statically-typed, purely functional meta-programming. We will continue our successful work on finding and inventing the techniques necessary for writing disciplined and modular meta-programs. One very successful approach has been to take program families, and engineer non ad hoc abstractions which appropriately capture the design choices of those families. These abstractions form the core of generators for the family members. Through writing larger generative libraries of reusable components (for scientific computation and for games), we will leverage our ongoing foundational work on mechanized mathematics (the MathScheme project), as well as our expertise in advanced meta-programming techniques, to distill our experience-driven design knowledge into an effective development methodology which can appropriately encompass the design of principled meta-programs.

计算机科学家编写操纵程序（如编译器）的程序已经有很长时间了。 另一方面，软件工程师使用这种特殊技术的速度要慢得多，主要是因为标准的设计方法不包含这种技术。 这种情况最近开始改变，原因有很多，其中包括：1。领域特定语言的日益普及，2。用手工编写并行软件是困难的并且容易出错的事实，以及3.当前的编程语言提供了很差的“高级”抽象机制。 不幸的是，很少有“野外”遇到的元程序（操纵程序的程序）像“常规”程序一样结构良好。 换句话说，似乎没有好的开发模型来编写这样的程序。 这是相当不幸的，因为元程序允许标准的软件工程概念（如设计选择）成为一流的软件工件。 此外，在成熟领域（如科学计算）的情况下，高阶结构可以有效地捕获和利用，以大大缩短源程序以及生成更有效的运行时程序。 我们的目标是在静态类型的纯函数元编程的上下文中纠正这种情况。 我们将继续我们的成功工作，寻找和发明必要的技术，编写纪律和模块化的元程序。 一个非常成功的方法是采用程序族，并设计适当捕获这些族的设计选择的非特定抽象。这些抽象构成了家族成员生成器的核心。 通过编写更大的可重用组件生成库（用于科学计算和游戏），我们将利用我们正在进行的机械化数学基础工作（MathScheme项目），以及我们在高级元编程技术方面的专业知识，将我们的经验驱动的设计知识提炼成有效的开发方法，可以适当地包含原则性元程序的设计。