64 search results - page 1 / 13 » Linear Dependent Types and Relative Completeness |
CORR
2011
Springer
13 years 1 days ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
DEXA
2009
Springer
13 years 11 months ago
2009
Springer
In this article we define a new type of integrity constraint in XML, called an XML inclusion constraint (XIND), and show that it extends the semantics of a relational inclusion de...
CSL
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Girard’s Geometry of Interaction (GoI) develops a mathematical framework for modelling the dynamics of cut-elimination. We introduce a typed version of GoI, called Mult...
LPAR
2007
Springer
13 years 11 months ago
2007
Springer
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
ACS
2005
13 years 5 months ago
2005
There are several kinds of linear typed calculus in the literature, some with their associated notion of categorical model. Our aim in this paper is to systematise the relationshi...