Results 1 
9 of
9
Dynamic Rebinding for Marshalling and Update, with DestructTime λ
 IN PROC. ICFP
, 2003
"... Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various guises, for example when a marshalled value is received from the network, containing identifiers that must be rebound to ..."
Abstract

Cited by 36 (15 self)
 Add to MetaCart
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various guises, for example when a marshalled value is received from the network, containing identifiers that must be rebound to local resources. Typically it is provided only by adhoc mechanisms that lack clean semantics. In this
Confluent Equational Reasoning for Linking with FirstClass Primitive Modules
 In ESOP 2000  European Symposium on Programming 2000, number 1782 in Lecture Notes in Computer Science
, 1999
"... Modules and linking are usually formalized by encodings which use the lambda calculus, records (possibly dependent), and possibly some construct for recursion. In contrast, we present the mcalculus, a calculus where the primitive constructs are modules, linking, and the selection and hiding of modu ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Modules and linking are usually formalized by encodings which use the lambda calculus, records (possibly dependent), and possibly some construct for recursion. In contrast, we present the mcalculus, a calculus where the primitive constructs are modules, linking, and the selection and hiding of module components. In addition to supporting equational reasoning about modules and linking, the mcalculus allows smooth encodings of software structuring tools such as the lambda calculus, mutually recursive definitions, records (including operations like extension and concatenation), and objects. The mcalculus is extremely well behaved  we show not only that the mcalculus is confluent but also that it satisfies the strong finite developments property.
A Study on Mobile Language Systems
, 1999
"... The mobile form of distributed computation, called mobile computation, is investigated from the viewpoints of computational model, programming language and implementation. The emphasis of this thesis compared with the related work is on analyzing existing mobile language systems from a rather implem ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The mobile form of distributed computation, called mobile computation, is investigated from the viewpoints of computational model, programming language and implementation. The emphasis of this thesis compared with the related work is on analyzing existing mobile language systems from a rather implementational point of view. The contribution of this thesis is threefold. (1) We present a computational model in which dynamic transference of code, data and execution state can be represented. Several mobility mechanisms in existing mobile language systems are analyzed in the model. (2) Based on the analysis, a programming language for mobile computation is designed. The distinctive feature of the language is the facility to control the transparency of migration. (3) An implementation of the mobile programming language is presented. The language is implemented as an extension of the Java language. The implementation is so portable that the program runs on any standard Java inte...
Dynamic Lambda Calculus
 FIFTH MEETING ON MATHEMATICS OF LANGUAGE  MOL5, GERAMANY
, 1997
"... In this paper, we introduce a lambda calculus DLC that is intended as a metalogic for compositional discourse logics, and we investigate its metatheory. We present a brief reconstruction of application languages for natural language semantics and programming language semantics. DLC extends simply ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper, we introduce a lambda calculus DLC that is intended as a metalogic for compositional discourse logics, and we investigate its metatheory. We present a brief reconstruction of application languages for natural language semantics and programming language semantics. DLC extends simply typed calculus with an operator for the declaration of referents. In contrast in classical abstraction, the scope of declaration is not a lexical one but may extend to its context: This allows declaration to capture referents, which breaks a taboo in traditional calculi. DLC provides an expressive type system which allows to encode information about the scope of declaration in terms of socalled modalities. Since dierent linguistic theories may need to employ dierent notions of scope, the modalities are made signature dependent, while their interaction behaviour is captured in the type system.
Mixin modules, modules and extended value binding in a callbyvalue setting
, 2003
"... Mixin modules, modules and extended value binding ..."
FirstClass Contexts in ML
, 1998
"... This paper develops an MLstyle programming language with rstclass contexts i.e. expressions with holes. The crucial operation for contexts is holelling. Filling a hole with an expression has the eect of dynamic binding or macro expansion which provides the advanced feature of manipulating open pr ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper develops an MLstyle programming language with rstclass contexts i.e. expressions with holes. The crucial operation for contexts is holelling. Filling a hole with an expression has the eect of dynamic binding or macro expansion which provides the advanced feature of manipulating open program fragments. Such mechanisms are useful in many systems including distributed/mobile programming and program modules. If we can treat a context as a rstclass citizen in a programming language, then we can manipulate open program fragments in a exible and seamless manner. A possibility of such a programming language was shown by the theory of simply typed context calculus developed by Hashimoto and Ohori. This paper extends the simply typed system of the context calculus to an MLstyle polymorphic type system, and gives an operational semantics and a sound and complete type inference algorithm. Keywords: Context, ML, dynamic binding, macro. 1 Introduction In recent years, programm...
The context calculus λc (Extended Abstract)
, 1999
"... Mirna Bognar Roel de Vrijer Abstract The calculus c serves as a general framework for representing contexts. Essential features are control over variable capturing and the freedom to manipulate contexts before or after hole filling, by a mechanism of delayed substitution. The context calculus ..."
Abstract
 Add to MetaCart
Mirna Bognar Roel de Vrijer Abstract The calculus c serves as a general framework for representing contexts. Essential features are control over variable capturing and the freedom to manipulate contexts before or after hole filling, by a mechanism of delayed substitution. The context calculus c is given in the form of an extension of the lambda calculus. Many notions of context can be represented within the framework; a particular variation can be obtained by the choice of a socalled pretyping. By way of an example we treat the contexts of Hashimoto & Ohori. 1 Introduction The central notion in this paper is that of context, i.e. an expression with special places, called holes, where other expressions can be placed. For example, in the lambda calculus, (x:2)z, where 2 denotes a hole, is a context. In formal systems with bound variables, such as calculus, a distinctive feature of placing an arbitrary expression into a hole of a context is variable capturing: some free varia...
Firstclass substitutions in contextual type theory
"... In this paper, we revisit the theory of firstclass substitution in notion of substitution variables. This forms the basis for extending Beluga, a dependently typed proof and programming language which already supports firstclass contexts and contextual objects, with firstclass substitutions. To i ..."
Abstract
 Add to MetaCart
In this paper, we revisit the theory of firstclass substitution in notion of substitution variables. This forms the basis for extending Beluga, a dependently typed proof and programming language which already supports firstclass contexts and contextual objects, with firstclass substitutions. To illustrate the elegance and power of firstclass substitution variables, we describe the implementation of a weak normalization proof for the simplytyped lambdacalculus in Beluga. 1.