Programming Languages

Study online at https://quizlet.com/_capxoc

1. Type rule an inference rule that describes

how a type system assigns a type
to a syntactic construction. These
rules may be applied by the type
system to determine if a program
is well typed and what type expres-
sions have. A prototypical example
of the use of this is in defyning type
inference in the simply typed lamb-
da calculus, which is the internal
language of cartesian closed cate-
gories.

2. Static semantics defines which syntactically correct

programs are correct with respect
to statically checkable features;

3. Dynamic semantics defined only for statically correct

programs and describes the run
time aspects of the language.

4. Type Checking verifies that the type of a construct

matches that expected by its con-
text.

5. Type System is a logical system comprising a

set of rules that assigns a prop-
erty called a type to the vari-
ous constructs of a computer pro-
gram, such as variable, expres-
sions, functions or modules.

6. Main purpose of a type system is to reduce possibilities for bugs

in computer programs by defining
interfaces between different parts
of a computer program.

7. Polymorphism means "many forms', and it occurs

when we have many classes that

1/2
 Programming Languages
Study online at https://quizlet.com/_capxoc
are related to each other by inheri-
tance.

8. Inheritance lets us inherit attributes and meth-

ods from another class. Polymor-
phism uses those methods to per-
form different tasks. This allows us
to perform a single action in differ-
ent ways.

9. Overloading method where more than one

methods share the same name
with different parameters or signa-
ture and different return type. oc-
curs during compile time

10. Overriding method of super class by method of

child class, which is done by JVM.
occurs during run time.

11. Type inference is the automatic deduction of the

data types of specific expressions
in a programming language, usual-
ly done at compile time.

12. Full declaration of argument fun foo(x:int):int = x + 100;

val fun = fn : int -> int

13. Inference from the type of one fun foo(x) = x + 100;

operand: val foo = fn : int -> int

14. Type Systems informally, a type in a programming

language specifies a set of values
and operations that can be applied
on those values

15. Basic types, Type constructors, Type Type systems consists of.
inference, Type compatibility

2/2