Sciweavers

ASIAN
1998
Springer
133views Algorithms» more  ASIAN 1998»
13 years 8 months ago
Type Inference for First-Class Messages with Feature Constraints
Abstract. We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of...
Martin Müller, Susumu Nishimura
ASIAN
1998
Springer
105views Algorithms» more  ASIAN 1998»
13 years 8 months ago
Two Flavors of Offline Partial Evaluation
Abstract. Type-directed partial evaluation is a new approach to program specialization for functional programming languages. Its merits with respect to the traditional offline part...
Simon Helsen, Peter Thiemann
ASIAN
1998
Springer
111views Algorithms» more  ASIAN 1998»
13 years 8 months ago
A Comparison of Petri Net Semantics under the Collective Token Philosophy
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
Roberto Bruni, José Meseguer, Ugo Montanari...
ASIAN
1998
Springer
101views Algorithms» more  ASIAN 1998»
13 years 8 months ago
The Rewriting Calculus as a Semantics of ELAN
call it, provides abstraction through the rewriting arrow and explicit rule application. It also embeds the notion of sets of results to deal with non-deterministic computations. F...
Horatiu Cirstea, Claude Kirchner
ASIAN
1998
Springer
83views Algorithms» more  ASIAN 1998»
13 years 8 months ago
Rigid Reachability
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...
Harald Ganzinger, Florent Jacquemard, Margus Veane...
ASIAN
1998
Springer
118views Algorithms» more  ASIAN 1998»
13 years 8 months ago
Bisimulation Lattice of Chi Processes
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
Yuxi Fu
ASIAN
1998
Springer
99views Algorithms» more  ASIAN 1998»
13 years 8 months ago
Eventuality in LOTOS with a Disjunction Operator
LOTOS is a formal specification language, designed for the precise description of open distributed systems and protocols. Our purpose is to introduce the operators of logics (for e...
Yoshinao Isobe, Yutaka Sato, Kazuhito Ohmaki