3319 search results - page 263 / 664 » Type Theoretical Databases |
107
click to vote
TACS
1991
Springer
15 years 6 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
163
click to vote
SEBD
2003
15 years 4 months ago
2003
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
127
click to vote
AAECC
2007
Springer
15 years 3 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
111
click to vote
EOR
2008
15 years 3 months ago
2008
In Multi-Protocol Label Switching (MPLS) networks, traffic demands can be routed along tunnels called Label Switched Paths (LSPs). A tunnel is characterized by a path in the netwo...
111
click to vote
FSS
2008
15 years 3 months ago
2008
The algebra of truth values of type-2 fuzzy sets is the set of all functions from the unit interval into itself, with operations de ned in terms of certain convolutions of these f...