Sciweavers

JFP
2000
91views more  JFP 2000»
13 years 11 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
JFP
2000
95views more  JFP 2000»
13 years 11 months ago
A modular module system
A simple implementation of an SML-like module system is presented as a module parameterized by a base language and its type-checker. This implementation is useful both as a detail...
Xavier Leroy
JFP
2000
75views more  JFP 2000»
13 years 11 months ago
Do we need dependent types?
Daniel Fridlender, Mia Indrika
JFP
2000
163views more  JFP 2000»
13 years 11 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini