37 search results - page 1 / 8 » Toward a general theory of names: binding and scope |
ICFP
2005
ACM
16 years 10 days 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...
115
Voted
IANDC
2007
15 years 10 days 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...
131
Voted
CORR
2008
Springer
15 years 14 days ago
2008
Springer
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
TGC
2005
Springer
15 years 5 months ago
2005
Springer
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
134
Voted
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...