632 search results - page 73 / 127 » Proving Invariants of Functional Programs |
112
click to vote
FPCA
1995
15 years 6 months ago
1995
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
203
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to eac...
TPHOL
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
120
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
114
click to vote
ICFP
2001
ACM
16 years 2 months ago
2001
ACM
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...