Sciweavers

432 search results - page 54 / 87
» Type Inference for COBOL Systems
Sort
View
LREC
2010
150views Education» more  LREC 2010»
13 years 9 months ago
Evaluation of HMM-based Models for the Annotation of Unsegmented Dialogue Turns
Corpus-based dialogue systems rely on statistical models, whose parameters are inferred from annotated dialogues. The dialogues are usually annotated using Dialogue Acts (DA), and...
Carlos D. Martínez-Hinarejos, Vicent Tamari...
PPOPP
2010
ACM
14 years 5 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
FSEN
2007
Springer
14 years 1 months ago
Regulating Data Exchange in Service Oriented Applications
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
DLS
2007
159views Languages» more  DLS 2007»
13 years 11 months ago
Relationally-parametric polymorphic contracts
The analogy between types and contracts raises the question of how many features of static type systems can be expressed as dynamic contracts. An important feature missing in prio...
Arjun Guha, Jacob Matthews, Robert Bruce Findler, ...
CADE
2001
Springer
14 years 8 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther