Sciweavers

3713 search results - page 110 / 743
» Constructing a Calculus of Programs
Sort
View
IFIP
2004
Springer
15 years 8 months ago
Ensuring Termination by Typability
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...
Yuxin Deng, Davide Sangiorgi
IFIP
2004
Springer
15 years 8 months ago
Effective Chemistry for Synchrony and Asynchrony
We study from an implementation viewpoint what constitutes a reasonable and effective notion of structural equivalence of terms in a calculus of concurrent processes and propose op...
Deepak Garg, Akash Lal, Sanjiva Prasad
ARTS
1997
Springer
15 years 7 months ago
PLC-Automata: A New Class of Implementable Real-Time Automata
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
Henning Dierks
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 3 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri
SIAMJO
2002
99views more  SIAMJO 2002»
15 years 2 months ago
On the Calmness of a Class of Multifunctions
The paper deals with the calmness of a class of multifunctions in finite dimensions. Its first part is devoted to various conditions for calmness, which are derived in terms of cod...
René Henrion, Abderrahim Jourani, Jir&iacut...