Extensible Pattern Matching in an Extensible Language

Extensible Pattern Matching in an Extensible Language
复制标题

可扩展语言中的可扩展模式匹配

DOI:
--
复制
发表时间:
2011
期刊:
arXiv.org
影响因子:
--
通讯作者:
Sam Tobin
Sam Tobin
中科院分区:
--
文献类型:
--
作者:
Sam Tobin

文献摘要

被引文献

相似文献

模式匹配是函数式语言中广泛使用的技术,特别是在ML和Haskell传统中,它是语义的核心。相反,在Lisp传统语言中,模式匹配通常由用宏构建的库提供。我们提出match,一个复杂的模式匹配器,作为语言扩展实现。使用宏。该系统支持新颖且广泛使用的模式匹配表单,并且本身是可扩展的。match的可扩展性是通过创建可扩展语言扩展的通用技术实现的。
Pattern matching is a widely used technique in functional languages, especially those in the ML and Haskell traditions, where it is at the core of the semantics. In languages in the Lisp tradition, in contrast, pattern matching it typically provided by libraries built with macros. We present match, a sophisticated pattern matcher for Racket, implemented as language extension. using macros. The system supports novel and widely-useful pattern-matching forms, and is itself extensible. The extensibility of match is implemented via a general technique for creating extensible language extensions.