Sciweavers

877 search results - page 89 / 176
» Annotated Revision Programs
Sort
View
CONCUR
2000
Springer
14 years 1 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
LREC
2010
176views Education» more  LREC 2010»
13 years 10 months ago
LAF/GrAF-grounded Representation of Dependency Structures
This paper shows that a LAF/GrAF-based annotation schema can be used for the adequate representation of syntactic dependency structures in many languages. We first argue that ther...
Yoshihiko Hayashi, Thierry Declerck, Chiharu Naraw...
HLPPP
1991
14 years 17 days ago
The Chemical Reaction Model
Gamma was originally proposed in 1986 as a formalism for the de nition of programs without arti cial sequentiality. The basic idea underlying the formalism is to describe computati...
Daniel Le Métayer
ESWS
2007
Springer
14 years 3 months ago
A Reasoning Framework for Rule-Based WSML
WSML is an ontology language specifically tailored to annotate Web Services, and part of its semantics adheres to the rule-based knowledge representation paradigm of logic program...
Stephan Grimm, Uwe Keller, Holger Lausen, Gá...
IEEEPACT
2007
IEEE
14 years 3 months ago
The OpenTM Transactional Application Programming Interface
Transactional Memory (TM) simplifies parallel programming by supporting atomic and isolated execution of user-identified tasks. To date, TM programming has required the use of l...
Woongki Baek, Chi Cao Minh, Martin Trautmann, Chri...