827 search results - page 130 / 166 » Proof-Theoretic Soundness and Completeness |
ICFP
1999
ACM
15 years 2 months ago
1999
ACM
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
LICS
1999
IEEE
15 years 2 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
VLDB
1999
ACM
15 years 2 months ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
AMAST
1998
Springer
15 years 2 months ago
1998
Springer
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
POPL
1998
ACM
15 years 2 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...