652 search results - page 2 / 131 » Linear Explicit Substitutions |
IGPL
1998
13 years 7 months ago
1998
Calculi of explicit substitutions have almost always been presented using de Bruijn indices with the aim of avoiding -conversion and being as close to machines as possible. De Bru...
ENTCS
2011
13 years 2 months ago
2011
SUBSEXPL is a system originally developed to visualise reductions, simpliļ¬cations and normalisations in three important calculi of explicit substitutions and has been applied to...
LPAR
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
ENTCS
2007
13 years 7 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...
ENTCS
2002
13 years 7 months ago
2002
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...