921 search results - page 10 / 185 » Expressing Computational Complexity in Constructive Type The... |
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
EGC
2005
Springer
14 years 1 months ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...