-
...we define a basic calculus for name management, which com- bines three ingredients: extensible records (in a simplified form), names (as in freshml), computational types (to allow computational eects, including generation of fresh names). the calculus supports the use of symbolic names for programming in-the-large, e...
-
...we define a basic calculus mln for manipulating symbolic names inspired by -calculi with extensible records. the resulting calculus supports the use of symbolic names for meta-programming and program- ming...
-
...show that the typed region calculus of tofte and talpin can be encoded in a typed π-calculus equipped with name groups
and a novel effect analysis. in the...and de-allocated according to a stack discipline, thus improving memory management. the idea of name
groups arose in the typed ambient calculus of cardelli, ghelli, and gordon...
-
...we introduce a monadic metalanguage which combines two previously proposed monadic metalan- guages: one for staging and the other for value recursion. the metalanguage includes also extensible records as a basic name management facility....
Published in 2004.
-
...we present the lambda context calculus. this simple lambda-calculus features variables ar- ranged in a hierarchy of strengths such that substitution of a strong variable does not avoid...rules extend the 'vanilla' lambda-calculus in a simple and modular way and preserve the look and feel of a stan- dard lambda-calculus with explicit substitutions. good properties...
-
...we introduce cows (calculus for orchestration of web services), a new foundational language for soc whose design has been...the de facto standard language for orchestration of web services. cows combines in an original way a number of ingredients borrowed from...
-
...we study the relationship between name creation and replication in a setting of infinite-state communicating automata. by
name creation we mean the capacity...prove that in this setting name creation and replication are equivalent, but only when a garbage collection
mechanism is added for idle threads. however, when simultaneously...
-
...an existing idea and introducing a key new idea. the existing idea is terms involving explicit substitutions of names for names, except that here we only...but also problems about the freshness of names for terms. there is a simple generalisation of the classical...
-
...side-conditions. nominal algebra is a logic of equality designed for specifications involving binding. we axiomatise the lambda-calculus using nominal algebra, demonstrate how...connects the nominal approach to names and binding with the view of variables as a syntactic convenience for describing functions. the axiomatisation is...
-
...we introduce the controlled gp-calculus, an extension of the gp-calculus with a notion of recovery of unused...collection and dead-process elimination for concurrent, communicating applications, and
provide a type-based technique for statically proving resource bounds. selected...