Sciweavers

SFP
2000
14 years 23 days ago
Detecting common elements of types
: 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...
Manfred Widera, Christoph Beierle
SFP
2000
14 years 23 days ago
Parallel heuristic search in Haskell
Abstract: Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms...
Michelle Cope, Ian P. Gent, Kevin Hammond
SFP
2001
14 years 24 days ago
Function Types in Complete Type Inference
: 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...
Manfred Widera, Christoph Beierle
SFP
2001
14 years 24 days ago
The Dual of Substitution is Redecoration
: 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...
Tarmo Uustalu, Varmo Vene
SFP
2001
14 years 24 days ago
Infinite Pretty-printing in eXene
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 ...
Allen Stoughton
SFP
2001
14 years 24 days ago
Deriving Non-Hierarchical Process Topologies
: Eden is a parallel functional language which extends Haskell with new expressions to de
Ricardo Pena, Fernando Rubio, Clara Segura