921 search results - page 9 / 185 » Expressing Computational Complexity in Constructive Type The... |
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
POPL
1998
ACM
13 years 12 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
MMMACNS
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
ENTCS
2006
13 years 7 months ago
2006
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...