TLCA
13 years 10 months ago
2001 Springer 
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
TLCA
13 years 10 months ago
2001 Springer 
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves...
TLCA
13 years 10 months ago
2001 Springer  TLCA
13 years 10 months ago
2001 Springer 
In this paper, we introduce a new type system, the Implicit Calculus of Constructions, which is a Curry-style variant of the Calculus of Constructions that we extend by adding an i...
TLCA
13 years 10 months ago
2001 Springer 
We extend the modal logic of ambients described in [7] to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions ...
|
Theoretical Computer Science