-
Proposition: Fully parenthesized proposition.
Evaluation of constant propositions, Evaluation of proposition in a
state Precedence rules for operators, Tautologies, propositions a set
of states and Transforming English to prepositional form.
-
Reasoning Using Equivalence Transformations: The
laws of equivalence, rules of substitution of transitivity, formal
system of axioms and inference rules.
-
Natural Deduction System: Introduction to
deductive proofs, inference rules, proofs and sub proofs, adding
flexibility to the natural deduction system and developing natural
deduction system proofs.
-
Predicates: Extending the range of a state,
Quantification, Free and bound identifies Textual substitution,
Quantification over other ranges and some theorems about textual
substitution and states.
-
Logic Programming: Introduction to prepositional
and predicate calculus. First Order Predicate calculus, Formal Logical
systems, prolog programming – Facts, rules and queries,
implementations, Applications, Strengths and Weaknesses.
-
Functional Programming: Introduction to lambada
calculus-syntax and semantics, Computability and correctness, Features
of Functional Languages – composition of Functions, Functions as
first class Objects, no side effects and clean semantics, LISP
Programming Data types and structures, Scheme dialect, primitive
functions, functions for constructing functions and functional forms.
Applications of functional languages and comparison of functional and
imperative languages.
Recommended Books:
-
Appleby – Programming Languages, Tata Mc-Graw Hill.
-
Sebesta – Concept of Programming Languages, Pearson
Education.
-
David Gries – The Science of Programming, Narosa
Publication House.
|