659 search results - page 2 / 132 » Binding as sets of scopes |
ICFP
2001
ACM
14 years 5 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...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
IFL
2005
Springer
13 years 11 months ago
2005
Springer
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
AIMS
2007
Springer
13 years 11 months ago
2007
Springer
Promise theory defines a method by which static service bindings are made in a network, but little work has been done on handling the dynamic case in which bindings must change ov...
IANDC
2007
13 years 5 months ago
2007
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names...