295 search results - page 2 / 59 » Typed transformations of typed abstract syntax |
TLCA
2009
Springer
14 years 22 hour ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
GPCE
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such ...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
ENTCS
2007
13 years 5 months ago
2007
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
APLAS
2007
ACM
13 years 9 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...