43 search results - page 3 / 9 » Proving Consistency and Completeness of Model Classes Using ... |
ENTCS
2002
13 years 7 months ago
2002
We illustrate the use of intersection types as a semantic tool for proving easiness result on -terms. We single out the notion of simple easiness for -terms as a useful semantic p...
PODS
1994
ACM
13 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
ENTCS
2006
13 years 7 months ago
2006
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
TSP
2011
13 years 2 months ago
2011
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...
FASE
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...