Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,066,377 papers from all fields of science
Search
Sign In
Create Free Account
Type system
Known as:
Type checking
, Dynamically typed
, Type-checker
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ACM Computing Surveys
ALGOL W
Abstract data type
Bounds checking
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
A type and effect system for atomicity
C. Flanagan
,
S. Qadeer
ACM-SIGPLAN Symposium on Programming Language…
2003
Corpus ID: 416117
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic…
Expand
Highly Cited
1999
Highly Cited
1999
JFlow: practical mostly-static information flow control
A. Myers
ACM-SIGACT Symposium on Principles of Programming…
1999
Corpus ID: 5683963
A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within…
Expand
Highly Cited
1996
Highly Cited
1996
A Sound Type System for Secure Flow Analysis
D. Volpano
,
C. Irvine
,
Geoffrey Smith
Journal of computing and security
1996
Corpus ID: 1256259
Ensuring secure information flow within programs in the context of multiple sensitivity levels has been widely studied…
Expand
Highly Cited
1996
Highly Cited
1996
The Java Language Specification
James Gosling
,
W. Joy
,
G. Steele
1996
Corpus ID: 5445732
From the Publisher: Written by the inventors of the technology, The Java(tm) Language Specification, Second Edition is the…
Expand
Highly Cited
1996
Highly Cited
1996
A Theory of Objects
M. Abadi
,
L. Cardelli
Monographs in Computer Science
1996
Corpus ID: 20902009
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
Notions of Computation and Monads
E. Moggi
Information and Computation
1991
Corpus ID: 12767331
Highly Cited
1987
Highly Cited
1987
Information-based syntax and semantics
C. Pollard
,
I. Sag
1987
Corpus ID: 62081394
A long-standing, near-universal, and erroneous practice of teaching syntax in a void exists, as if the communicative function of…
Expand
Highly Cited
1985
Highly Cited
1985
The lambda calculus - its syntax and semantics
H. Barendregt
Studies in Logic and the Foundations of…
1985
Corpus ID: 58318238
Highly Cited
1977
Highly Cited
1977
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
P. Cousot
,
R. Cousot
ACM-SIGACT Symposium on Principles of Programming…
1977
Corpus ID: 207614632
A program denotes computations in some universe of objects. Abstract interpretation of programs consists in using that denotation…
Expand
Highly Cited
1974
Highly Cited
1974
Towards a theory of type structure
J. C. Reynolds
Symposium on Programming
1974
Corpus ID: 30450751
7)(D) = B[w][71t]#D] and delta is a functor from Funct(C, C) into C. Even before defining the functors arrow and delta, it can be…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE