Type rule

Known as: Type rules, Typing rule 
In type theory, a type rule is an inference rule that describes how a type system assigns a type to a syntactic construction. These rules may be… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
We describe the key principles of a flexible dependent type system for low-level imperative languages. Two major contributions… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this paper two sets of tuning rules for fractional PIDs are presented. These rules are quadratic and require the same plant… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2006
2006
Some type systems are first described formally, to be sometimes followed by an implementation. Other type systems are first… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 8
  • figure 10
Is this relevant?
Highly Cited
2004
Highly Cited
2004
While dynamic linking has become an integral part of the run-time execution of modern programming languages, there is increasing… (More)
  • figure 1
  • figure 1
Is this relevant?
2004
2004
Relying on Clive Granger’s many and varied contributions to econometric analysis, this paper considers some of the key… (More)
  • figure 1
  • figure 1
  • figure 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper, we analyze quantitative measures associated with if-then type rules. Basic quantities are identified and many… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional… (More)
Is this relevant?
1999
1999
The article investigates trapezoid type rules and obtains explicit bounds through the use of a Peano kernel approach and the… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions… (More)
Is this relevant?