Name
Abstract | ||
|---|---|---|
We propose an extension with name variables of a calculus for incremental rebinding of code introduced in previous work. Names, which can be either constants or variables, are used as interface of fragments of code with free variables. Open code can be dynamically rebound by applying a rebinding, which is an association from names to terms. Rebinding is incremental, since rebindings can contain free variables as well, and can be manipulated by operators such as overriding and renaming. By using name variables, it is possible to write terms which are parametric in their nominal interface and/or in the way it is adapted, greatly enhancing expressivity. The type system is correspondingly extended by constrained name-polymorphic types, where simple inequality constraints prevent conflicts among parametric name interfaces. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.entcs.2016.03.003 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
open code,incremental rebinding,name polymorphism,metaprogramming | Metaprogramming,Computer science,Free variables and bound variables,Theoretical computer science,Parametric statistics,Operator (computer programming),Expressivity | Journal |
Volume | Issue | ISSN |
322 | C | 1571-0661 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Davide Ancona | 1 | 727 | 69.43 |
| Paola Giannini | 2 | 449 | 50.00 |
| Elena Zucca | 3 | 497 | 101.25 |