51 search results - page 6 / 11 » A Term Calculus for Intuitionistic Linear Logic |
IANDC
2010
14 years 10 months ago
2010
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
ENTCS
2002
14 years 11 months ago
2002
We present a variant of the linear logical framework LLF that avoids the restriction l-typed terms be in pre-canonical form and adds -abstraction at the level of families. We aban...
JSYML
2007
14 years 11 months ago
2007
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...
LOPSTR
2004
Springer
15 years 5 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
TCS
2008
14 years 11 months ago
2008
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...