10 search results - page 1 / 2 » Tagless staged interpreters for typed languages |
ICFP
2002
ACM
14 years 4 months ago
2002
ACM
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
APLAS
2007
ACM
13 years 8 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
ICFP
2001
ACM
14 years 4 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
IFL
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
GTTSE
2007
Springer
15 years 2 months ago
2007
Springer
As domain-specific languages (DSLs) permeate into mainstream software engineering, there is a need for economic methods for implementing languages. Following up on a paper with a s...