Remora中的秩多态程序设计简介(草稿)
Introduction to Rank-polymorphic Programming in Remora (Draft)
摘要:
Remora是一种高阶的、等级多态的数组处理程序设计语言,与APL和J属于同一类语言。我们提供了一个例子驱动的语言介绍,和它的一般计算模型,最初由艾弗森开发的APL。我们从Dynamic Remora开始,它是一种具有动态类型系统的语言变体(如Scheme或Lisp),介绍了该语言的基本计算机制,然后转移到Explained Typed Remora,它是一种具有静态依赖类型系统的语言变体,允许在编译时捕获正在计算的数组的形状。本文可以被认为是对秩多态数组处理计算模型的一般主题的介绍,超出了Remora语言的具体细节。我们不解决Remora中的类型推断的细节,也就是说,将显式类型分配给没有这种注释的程序;这是正在进行的研究。
英文摘要:
Remora is a higher-order, rank-polymorphic array-processing programming language, in the same general class of languages as APL and J. It is intended for writing programs to be executed on parallel hardware. We provide an example-driven introduction to the language, and its general computational model, originally developed by Iverson for APL. We begin with Dynamic Remora, a variant of the language with a dynamic type system (as in Scheme or Lisp), to introduce the fundamental computational mechanisms of the language, then shift to Explicitly Typed Remora, a variant of the language with a static, dependent type system that permits the shape of the arrays being computed to be captured at compile time. This article can be considered an introduction to the general topic of the rank-polymorphic array-processing computational model, above and beyond the specific details of the Remora language. We do not address the details of type inference in Remora, that is, the assignment of explicit types to programs written without such annotations; this is ongoing research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。