SFP
2000
13 years 6 months ago
2000
: We describe an algorithm approximatingthe following question: Given two types t1 and t2, are there instances (t1) and (t2) denoting a common element? By answering this question w...
SFP
2000
13 years 6 months ago
2000
Abstract: Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms...
SFP
2001
13 years 6 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
SFP
2001
13 years 6 months ago
2001
: It is well known that type constructors of incomplete trees (trees with variables) carry the structure of a monad with substitution as the extension operation. Less known are the...
SFP
2001
13 years 6 months ago
2001
We describe the design and implementation of a Standard ML of New Jersey library for the interactive pretty-printing of possibly infinite syntax trees. The library handles elision ...
SFP
2001
13 years 6 months ago
2001
: Eden is a parallel functional language which extends Haskell with new expressions to de