Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
In this paper we consider updates that are specified as rules and consider simple knowledge bases consisting of ground atoms. We present a translation of the rule based update spe...
ogramming are evaluated along three different guidelines: the programming abstractions the calculus suggests; the underlying programming model; the security mechanisms provided. Th...
Gian Luigi Ferrari, Rosario Pugliese, Emilio Tuost...
Abstract. This paper describes a very flexible way to synthesize functions matching a given predicate. This can be used to find general recursive functions or -terms obeying an inp...