PPDP
2001
Springer
13 years 12 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we present a new type system for logic programs. Our system combines ideas of the classical polymorphic, but not very precise, system due to Mycroft and O'Keefe...
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
Ì × Ô Ô ÖÔÖÓÔÓ× × ØÖ Ò× ÓÖÑ Ø ÓÒ¹ × ÔÔÖÓ ØÓ ¹ × Ò ÓÒ×ØÖ Òع × Ò ÐÝ× × ÓÖ Â Ú Ø Ó Ö× Ö Ö ÒÙ¹ Ð Ö Øݺ ÁÒ Ø × Ô...
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus[13, 14, 15] as a modelling tool. A Type system using boolean annotations g...
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...