Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Type system

Known as: Type checking, Dynamically typed, Type-checker 
In programming languages, a type system is a collection of rules that assign a property called type to various constructs a computer program consists… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic… Expand
  • figure 1
  • table 1
  • figure 2
Highly Cited
2001
Highly Cited
2001
  • E. Fridman
  • Syst. Control. Lett.
  • 2001
  • Corpus ID: 43014013
Abstract A new (descriptor) model transformation and a corresponding Lyapunov–Krasovskii functional are introduced for stability… Expand
Highly Cited
1999
Highly Cited
1999
A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within… Expand
  • figure 3
  • figure 9
  • figure 10
  • figure 12
  • figure 13
Highly Cited
1996
Highly Cited
1996
Ensuring secure information flow within programs in the context of multiple sensitivity levels has been widely studied… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1996
Highly Cited
1996
From the Publisher: Written by the inventors of the technology, The Java(tm) Language Specification, Second Edition is the… Expand
  • table 4.1
  • table 5.1
  • table 5.2
  • table 15.1
  • table 15.2
Highly Cited
1996
Highly Cited
1996
From the Publisher: Procedural languages are generally well understood. Their foundations have been cast in calculi that prove… Expand
Highly Cited
1991
Highly Cited
1991
  • E. Moggi
  • Inf. Comput.
  • 1991
  • Corpus ID: 12767331
Abstract The λ-calculus is considered a useful mathematical tool in the study of programming languages, since programs can be… Expand
  • table 1
  • table 2
  • table 3
  • table 5
  • table 6
Highly Cited
1991
Highly Cited
1991
Programming languages often come with type systems. Some of these are simple, others are sophisticated. As a stylistic… Expand
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1985
Highly Cited
1985
  • H. Barendregt
  • Studies in logic and the foundations of…
  • 1985
  • Corpus ID: 58318238
Towards the Theory. Introduction. Conversion. Reduction. Theories. Models. Conversion. Classical Lambda Calculus. The Theory of… Expand
Highly Cited
1977
Highly Cited
1977
A program denotes computations in some universe of objects. Abstract interpretation of programs consists in using that denotation… Expand