3713 search results - page 372 / 743 » Constructing a Calculus of Programs |
147
click to vote
POPL
1998
ACM
15 years 9 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
146
click to vote
CIKM
2007
Springer
15 years 11 months ago
2007
Springer
Topological information plays a fundamental role in the human perception of spatial configurations and is thereby one of the most prominent geographical features in natural langu...
140
click to vote
CSL
2007
Springer
15 years 11 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
122
click to vote
ECOWS
2007
Springer
15 years 11 months ago
2007
Springer
Service composition and service statefulness are key concepts in Web Service system programming. In this paper we present JOLIE, which is the full implementation of our formal cal...
122
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
The semantics of process calculi has traditionally been specified by labelled transition systems (LTS), but with the development of name calculi it turned out that reaction rules...