PICARD: Parsing incrementally for constrained auto-regressive decoding from language models
Large pre-trained language models for textual data have an unconstrained output space; at
each decoding step, they can produce any of 10,000 s of sub-word tokens. When fine-tuned …
each decoding step, they can produce any of 10,000 s of sub-word tokens. When fine-tuned …
Type directed compilation of row-typed algebraic effects
D Leijen - Proceedings of the 44th ACM SIGPLAN Symposium on …, 2017 - dl.acm.org
Algebraic effect handlers, introduced by Plotkin and Power in 2002, are recently gaining in
popularity as a purely functional approach to modeling effects. In this article, we give a full …
popularity as a purely functional approach to modeling effects. In this article, we give a full …
The Heterogeneous Tool Set, Hets
T Mossakowski, C Maeder, K Lüttich - … on Tools and Algorithms for the …, 2007 - Springer
Heterogeneous specification becomes more and more important because complex systems
are often specified using multiple viewpoints, involving multiple formalisms (see Fig. 1) …
are often specified using multiple viewpoints, involving multiple formalisms (see Fig. 1) …
Pipeline combinators for gradual automl
Automated machine learning (AutoML) can make data scientists more productive. But if
machine learning is totally automated, that leaves no room for data scientists to apply their …
machine learning is totally automated, that leaves no room for data scientists to apply their …
Helium, for learning Haskell
B Heeren, D Leijen, A Van IJzendoorn - Proceedings of the 2003 ACM …, 2003 - dl.acm.org
Helium is a user-friendly compiler designed especially for learning the functional
programming language Haskell. The quality of the error messages has been the main …
programming language Haskell. The quality of the error messages has been the main …
Total parser combinators
NA Danielsson - Proceedings of the 15th ACM SIGPLAN international …, 2010 - dl.acm.org
A monadic parser combinator library which guarantees termination of parsing, while still
allowing many forms of left recursion, is described. The library's interface is similar to those …
allowing many forms of left recursion, is described. The library's interface is similar to those …
Lightweight multi-language syntax transformation with parser parser combinators
Automatically transforming programs is hard, yet critical for automated program refactoring,
rewriting, and repair. Multi-language syntax transformation is especially hard due to …
rewriting, and repair. Multi-language syntax transformation is especially hard due to …
Nail: A practical tool for parsing and generating data formats
Nail is a tool that greatly reduces the programmer effort for safely parsing and generating
data formats defined by a grammar. Nail introduces several key ideas to achieve its goal …
data formats defined by a grammar. Nail introduces several key ideas to achieve its goal …
Reflecting on random generation
Expert users of property-based testing often labor to craft random generators that encode
detailed knowledge about what it means for a test input to be valid and interesting …
detailed knowledge about what it means for a test input to be valid and interesting …
Generics of a higher kind
With Java 5 and C# 2.0, first-order parametric polymorphism was introduced in mainstream
object-oriented programming languages under the name of generics. Although the first …
object-oriented programming languages under the name of generics. Although the first …