ENTCS
2011
13 years 7 months ago
2011
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
IGPL
1998
14 years 3 days 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
2002
14 years 4 days 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...
IGPL
2000
14 years 8 days ago
2000
Abstract Neil Ghani Valeria de Paiva Eike Ritter The -calculus 1 adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implement...
ENTCS
2007
14 years 12 days 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...
FSTTCS
1999
Springer
14 years 4 months ago
1999
Springer
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
LPAR
2004
Springer
14 years 5 months 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...
CSL
2007
Springer
14 years 6 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
ICFP
2003
ACM
15 years 12 days ago
2003
ACM