Sciweavers

479 search results - page 49 / 96
» Sound and Complete Type Inference for a Systems Programming ...
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
13 years 7 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
ICFP
2010
ACM
13 years 8 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
ICDT
2010
ACM
149views Database» more  ICDT 2010»
14 years 17 days ago
Mapping Polymorphism
We examine schema mappings from a type-theoretic perspective and aim to facilitate and formalize the reuse of mappings. Starting with the mapping language of Clio, we present a ty...
Ryan Wisnesky, Mauricio Hernandez, Lucian Popa
ICALP
2011
Springer
12 years 11 months ago
On the Semantics of Markov Automata
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
Yuxin Deng, Matthew Hennessy
SIGSOFT
2009
ACM
14 years 8 months ago
Learning from examples to improve code completion systems
The suggestions made by current IDE's code completion features are based exclusively on static type system of the programming language. As a result, often proposals are made ...
Marcel Bruch, Martin Monperrus, Mira Mezini