1226 search results - page 129 / 246 » Proofs, Programs and Abstract Complexity |
123
click to vote
ICTAC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
127
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
239
Voted
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
119
Voted
ESOP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of c...
146
Voted
EUROCRYPT
2004
Springer
15 years 9 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...