ENTCS
2000
13 years 4 months ago
2000
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
ENTCS
2000
13 years 4 months ago
2000
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...
ENTCS
2000
13 years 4 months ago
2000
ENTCS
2000
13 years 4 months ago
2000
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
ENTCS
2000
13 years 4 months ago
2000
We lift Cardelli, Ghelli and Gordon's secrecy group creation operator [1] to a relative of the spicalculus that supports symmetric key cryptography, and show a natural extens...
ENTCS
2000
13 years 4 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
ENTCS
2000
13 years 4 months ago
2000
ENTCS
2000
13 years 4 months ago
2000
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
ENTCS
2000
13 years 4 months ago
2000
ENTCS
2000
13 years 4 months ago
2000
Haskell currently lacks a standard operational semantics. We argue that such a semantics should be provided to enable reasoning about operational properties of programs, to ensure...