IFIP
2004
Springer
14 years 2 months ago
2004
Springer
We introduce an extension of the Parikh mapping called the Parikh ¢ -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represent...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
Dependent type systems are promising tools programmers can use to increase the reliability and security of their programs. Unfortunately, dependently-typed programming languages re...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we investigate extensions of the well-known Vickrey-Clarke-Groves (VCG) mechanisms to problems whose objective function is not utilitarian and whose agents’ utiliti...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
In global computing applications the availability of a mechanism for some form of committed choice can be useful, and sometimes necessary. It can conveniently handle, e.g., distrib...