41 search results - page 7 / 9 » On the Modularity of Deciding Call-by-Need |
DAGSTUHL
2007
13 years 10 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
ICFP
2006
ACM
14 years 8 months ago
2006
ACM
d abstract) Keiko Nakata1 Jacques Garrigue2 1 Kyoto University Research Institute for Mathematical Sciences 2 Graduate School of Mathematics, Nagoya University The ML module syste...
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
NDJFL
1998
13 years 8 months ago
1998
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...
FCT
1995
Springer
14 years 4 days ago
1995
Springer
The synchronization of two or more semi-traces describes the possible evaluation of a concurrent system, which consists of two or more concurrent subsystems in a modular way, where...