128 search results - page 1 / 26 » Ensuring Termination by Typability |
81
Voted
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
PEPM
2007
ACM
15 years 3 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
BPM
2003
Springer
15 years 1 months ago
2003
Springer
Abstract. We address cross-organizational workflows, such as document workflows, which consist of multiple workflow modules each of which can interact with others by sending and re...
68
Voted
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
78
Voted
APLAS
2009
ACM
15 years 1 months ago
2009
ACM
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable ...