632 search results - page 4 / 127 » Explicit Substitutions and Programming Languages |
ESOP
2000
Springer
13 years 11 months ago
2000
Springer
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
FOSSACS
2004
Springer
14 years 26 days ago
2004
Springer
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...
FASE
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing ...
JMLC
2000
Springer
13 years 11 months ago
2000
Springer
A namespace is a mapping from labels to values. Most programming languages support different forms of namespaces, such as records, dictionaries, objects, environments, packages and...