• PROVABILITY AND SATISFIABILITY, TRANSFORMATION (REDUCTION) OF PROOFS
• COMPACTNESS THEOREM FOR FIRST-ORDER LOGIC
• COMPLETENESS THEOREM FOR FIRST-ORDER LOGIC
• CUT-ELIMINATION THEOREM FOR FIRST-ORDER LOGIC

V. Michele Abrusci, Lorenzo Tortora de Falco: LOGICA Volume 1 Dimostrazioni e modelli al primo ordine. Springer, 2014

Complex numbers; complex differentiability and Cauchy-Riemann formula; the Riemann sphere; linear fractionary maps; the line integral; Cauchy's theorem and Cauchy's formula; Lioville's theorem; the fundamental theorem of algebra; the identity principle; the Euler product for the sine; the mean value property, the maximum principle and Schwarz's lemma; the Moebius maps are the automorphisms of the disc; the hyperbolic metric on the disc and its geodesics; the contractions of the hyperbolic metric; Laurent series; theorem of the removable singularity; poles and essential singularities; the Casorati-Weierstrass theorem; the residues theorem; the argument principle; the theorem of Ropuche'; normal families and quasi-uniform convergence; harmonic functions are the real part of holomorphic functions; uniqueness for the Dirichlet problem; Poisson's kernel; functions which have the mean value property are harmonic; the Schwarz refelction principle; the Riemann mapping theorem.

W. Rudin, Real and complex analysis, Tata McGraw Hill.

J. B. Conway, Functions of one complex variable, Springer.

Preliminaries
- Weak topologies and weak convergence, weak lower semi-continuity of the norm
- L^P spaces: reflexivity, separability, criteria for strong compactness.

Sobolev spaces and variational formulation of boundary value problems in dimension one
- Motivations
- The Sobolev space W^{1,p} (I)
- The space W^{1,p}_0 (I)
- Some examples of boundary value problems
- Maximum principle

Sobolev spaces and variational formulation of boundary value problems in dimension N
- Definition and basic properties of the Sobolev spaces W^{1,p} (Ω)
- Extension operators
- Sobolev inequalities
- The space W^{1,p}_0 (Ω)
- Variational formulation of some elliptic boundary value problems
- Existence of weak solutions
- Regularity of weak solutions
- Maximum principle

Analisi funzionale, H. Brézis, Liguori Editore

LAGRANGIAN AND HAMILTONIAN MECHANICS. VARIATIONAL PRINCIPLES. CONSTRAINTS. CYCLICI VARIABLES. CONSTANTS OF MOTION AND SYMMETRIES. HAMILTONIAN FLOWS. LIOUVILLE THEOREM AND POINCARE RECURRENCE THEOREM. CANONICAL TRANSFORMATIONS. GENERATING FUNCTIONS. HAMILTON-JACOBI METHOD AND ACTION-ANGLE VARIABLES. PERTURBATION THEORY. KAM THEOREM.

[1] G. GENTILE,INTRODUZIONE AI SISTEMI DINAMICI. 1.EQUAZIONI DIFFERENZIALI ORDINARIE, ANALISI QUALITATIVA E ALCUNE APPLICAZIONI.
AVAILABLE ON-LINE: http://www.mat.uniroma3.it/users/gentile/2016-2017/FM410/testo.html
[2] G. GENTILE,INTRODUZIONE AI SISTEMI DINAMICI. 2.FORMALISMO LAGRANGIANO E HAMILTONIANO.
AVAILABLE ON-LINE: http://www.mat.uniroma3.it/users/gentile/2016-2017/FM410/testo.html
[3] G. DELL'ANTONIO, ELEMENTI DI MECCANICA. LIGUORI EDITORE, (1996)
[4] V.I. ARNOLD, METODI MATEMATICI DELLA MECCANICA CLASSICA. EDITORI RIUNITI, (1979)
[5] G. GALLAVOTTI, MECCANICA ELEMENTARE. BOLLATI-BORINGHIERI, (1980)

Selected examples of partial differential equations
The weak form of boundary value problems
Galerkin method
The Finite Elements Method (FEM)
Convergence of MEF solutions
Data structure and FEM implementation
Numerical methods for the solution of algebraic systems

Mark S. Gockenbach,
Understanding and Implementing the Finite Elements Method,
SIAM 2006

LAGRANGIAN AND HAMILTONIAN MECHANICS. VARIATIONAL PRINCIPLES. CONSTRAINTS. CYCLICI VARIABLES. CONSTANTS OF MOTION AND SYMMETRIES. HAMILTONIAN FLOWS. LIOUVILLE THEOREM AND POINCARE RECURRENCE THEOREM. CANONICAL TRANSFORMATIONS. GENERATING FUNCTIONS. HAMILTON-JACOBI METHOD AND ACTION-ANGLE VARIABLES. PERTURBATION THEORY. KAM THEOREM.

[1] G. GENTILE,INTRODUZIONE AI SISTEMI DINAMICI. 1.EQUAZIONI DIFFERENZIALI ORDINARIE, ANALISI QUALITATIVA E ALCUNE APPLICAZIONI.
AVAILABLE ON-LINE: http://www.mat.uniroma3.it/users/gentile/2016-2017/FM410/testo.html
[2] G. GENTILE,INTRODUZIONE AI SISTEMI DINAMICI. 2.FORMALISMO LAGRANGIANO E HAMILTONIANO.
AVAILABLE ON-LINE:http://www.mat.uniroma3.it/users/gentile/2016-2017/FM410/testo.html
[3] G. DELL'ANTONIO, ELEMENTI DI MECCANICA. LIGUORI EDITORE, (1996).
[4] V.I. ARNOLD, METODI MATEMATICI DELLA MECCANICA CLASSICA. EDITORI RIUNITI, (1979).
[5] G. GALLAVOTTI, MECCANICA ELEMENTARE. BOLLATI-BORINGHIERI, (1980)

• PROVABILITY AND SATISFIABILITY, TRANSFORMATION (REDUCTION) OF PROOFS
• COMPACTNESS THEOREM FOR FIRST-ORDER LOGIC
• COMPLETENESS THEOREM FOR FIRST-ORDER LOGIC
• CUT-ELIMINATION THEOREM FOR FIRST-ORDER LOGIC

V. Michele Abrusci, Lorenzo Tortora de Falco: LOGICA Volume 1 Dimostrazioni e modelli al primo ordine. Springer, 2014

Introduction to modern cryptography: definition of security in encryption, Distinguisher, integrity, digital signature, authentication, abstract cryptographic primitives.

Basic concepts of the theory of numbers: MCD, modular arithmetic and basic algorithms, polynomials and rational polynomials, finite fields, solution of equations. Vector spaces and linear maps.

Algorithms: products of matrices in GF (2), products of dense arrays, Strassen algorithm, Gaussian elimination, matrix inversion, linear algebra on sparse matrices, iterative algorithms. Groebner bases: Buchberger algorithm.

Brute-force cryptanalysis: attacks by dictionaries, block ciphers, substitution-permutation networks, Feistel type systems, DES, brute force on DES, AES. Hash functions, the family of hash functions SHA, linear model for SHA-0, looking for collisions, brute force and parallelism, efficient brute force.

Birthday paradox: operating modes ECB, CBC, CBC-MAC, sorting algorithms, hash tables, binary trees, analysis of pseudo-random functions. Security of block ciphers. Time memory trade-off.

Walsh-Hadamard transform: linear cryptanalysis, differential cryptanalysis, the study of the S-box, Walsh transform, differential characteristics, normal algebraic form, generalization of the Walsh transform in the case of finite fields GF (p). Analysis of complexity.

Algebraic attacks, stream ciphers, the key stream generators based on LFSRs, correlation attacks, decoding methods, fast correlation attacks, algorithmic aspects of correlation based attacks.

[1] Antoine Joux, Algorithmic Cryptanalysis, (2010) CRC Press;

[2] Douglas Stinson, Cryptography: Theory and Practice, 3rd edition, (2006) Chapman and Hall/CRC.

Selected examples of partial differential equations
The weak form of boundary value problems
Galerkin method
The Finite Elements Method (FEM)
Convergence of MEF solutions
Data structure and FEM implementation
Numerical methods for the solution of algebraic systems

Mark S. Gockenbach,
Understanding and Implementing the Finite Elements Method,
SIAM 2006

Preliminaries
- Weak topologies and weak convergence, weak lower semi-continuity of the norm
- L^P spaces: reflexivity, separability, criteria for strong compactness.

Sobolev spaces and variational formulation of boundary value problems in dimension one
- Motivations
- The Sobolev space W^{1,p} (I)
- The space W^{1,p}_0 (I)
- Some examples of boundary value problems
- Maximum principle

Sobolev spaces and variational formulation of boundary value problems in dimension N
- Definition and basic properties of the Sobolev spaces W^{1,p} (Ω)
- Extension operators
- Sobolev inequalities
- The space W^{1,p}_0 (Ω)
- Variational formulation of some elliptic boundary value problems
- Existence of weak solutions
- Regularity of weak solutions
- Maximum principle

Analisi funzionale, H. Brézis, Liguori Editore

Definition of a sigma-algebra; measures on a sigma-algebra; definition of the integral; monotone and dominated convergence theorems; continuity and derivation under the integral sign; the L^p spaces; Holder and Minkowski inequalities; L^p is complete; the Borel sets and Lusin's theorem; the compactly supported, C^\infty functions are dense in L^p(R^n); convergence in measure and almost-uniform convergence; Egorov's theorem; Caratheodory's extension theorem and the construction of Lebesgue's measure; product measures; the theorems of Fubini and Tonelli; complex measures; the Radon=Nykodim theorem and differentiation of measures.

W. Rudin, Real and complex analysis, Tata-McGraw Hill.

H. L. Royden, Real analysis, China Machine Press.

R. L. Wheeden, A. Zygmund, Measure and integral, Dekker.

COMPLEXITY, COMPUTABILITY, REPRESENTABILITY: DECISION PROBLEMS, FINITE AUTOMATA AND ALGORITHMS. TURING-COMPUTABILITY. SPACE AND TIME COMPLEXITY OF ALGORITHMS. RAM MACHINES. COMPLEXITY FUNCTIONS. RECURSIVE FUNCTIONS. THE HALT PROBLEM FOR TURING MACHINES. FUNCTIONAL PROGRAMMING: LAMBDA CALCULUS. CHURCH-ROSSER THEOREM. STRATEGIES OF REDUCTION. SOLVABLE TERMS. BÖHM'S THEOREM. THEOREM FOR LAMBDA-DEFINABLE RECURSIVE FUNCTIONS. BETA-FUNCTIONAL MODELS OF LAMBDA-CALCULUS. OBJECT-ORIENTED PROGRAMMING: CLASSES, FUNCTIONAL CLASSES. CLASS INHERITANCE. ABSTRACT CLASS DECLARATION. PUBLIC AND PRIVATE METHODS. METHOD LATE-BINDING.

[1] DEHORNOY, P., COMPLEXITE' ET DECIDABILITE'. SPRINGER-VERLAG, (1993).
[2] KRIVINE, J.-L., LAMBDA CALCULUS: TYPES AND MODELS. ‪ELLIS HORWOOD, (1993).
[3] SIPSER,M., INTRODUCTION TO THE THEORY OF COMPUTATION.THOMSON COURSE TECHNOLOGY, (2006).
[4] GABBRIELLI, M., MARTINI, S., LINGUAGGI DI PROGRAMMAZIONE: PRINCIPI E PARADIGMI. MCGRAW-HILL, (2011).

FURTHER TEXTBOOKS:

[4] AHO, HOPCROFT, ULLMAN, DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS. ADDISON-WESLEY PUB. CO., (1974).
[5] AUSIELLO, G., GAMBOSI, G., D'AMORE F., LINGUAGGI, MODELLI, COMPLESSITA'. FRANCO ANGELI (2003).
[6] A. BERNASCONI, B. CODENOTTI, INTRODUZIONE ALLA COMPLESSITA' COMPUTAZIONALE. SPRINGER-VERLAG, (1998).
[7] SETHI, R., PROGRAMMING LANGUAGES: CONCEPTS AND CONSTRUCTS. ADDISON-WESLEY (ED. ITALIANA ZANICHELLI), (1996).
[8] HERMES, H., ENUMERABILITY, DECIDABILITY, COMPUTABILITY. DIE GRUNDLEHREN DER MATHEMATICHENWISSENSHAFTEN IN EINZELDARSTELLUNGEN, N. 127, SPRINGER-VERLAG, (1969).
[9] DARNELL, P. A. AND MARGOLIS, P. E., C A SOFTWARE ENGINEREEING APPROACH. SPRINGER-VERLAG, (1996).

CONGRUENCES AND POLYNOMIALS. LINEAR DIOPHANTINE EQUATIONS. SYSTEMS OF LINEAR CONGRUENCES. POLYNOMIAL CONGRUENCES. POLYNOMIAL CONGRUENCES MOD p: LAGRANGES’S THEOREM. p-ADIC APPROXIMATION. THE EXISTENCE OF PRIMITIVE ROOTS MOD p. QUADRATIC CONGRUENCES. QUADRATIC RESIDUES. THE LEGENDRE SYMBOL. GAUSS’S LEMMA AND THE LAW OF QUADRATIC RECIPROCITY.THE JACOBI SYMBOL. SUMS OF TWO, THREE, FOUR SQUARES. MULTIPLICATIVE FUNCTIONS. THE MÖBIUS INVERSION FORMULA. SOME NONLINEAR DIOPHANTINE EQUATIONS. CONTINUED FRACTIONS.

M. FONTANA, APPUNTIDEL CORSO TN1 (ARGOMENTI DELLA TEORIA CLASSICA DEI NUMERI), HTTP://WWW.MAT.UNIROMA3.IT/USERS/FONTANA/DIDATTICA/FONTANA_DIDATTICA.HTML DISPENSE.
D.M. BURTON: ELEMENTARY NUMBER THEORY, MCGRAW-HILLINTERNATIONAL EDITION, 6TH EDITION (2007), 434 PP.
G.A. JONES AND J.M. JONES, ELEMENTARY NUMBER THEORY, SPRINGER, 1ST EDITION (1998), 200 PP.
H. DAVENPORT, ARITMETICA SUPERIORE.UN?INTRODUZIONE ALLA TEORIA DEI NUMERI, ZANICHELLI, (1994), 199 PP.
G.H. HARDY AND E.M. WRIGHT, AN INTRODUCTION TO THE THEORY OH NUMBERS, THE CLARENDON PRESS, OXFORD UNIVERSITY, 5TH EDITION (1979), XVI+426 PP.
W.J. LEVEQUE, FUNDAMENTALS OF NUMBER THEORY, DOVER PUBLICATIONS, (1996)
K.H. ROSEN. ELEMENTARY NUMBER THEORY AND ITS APPLICATIONS, ADDISON-WESLEY, 6TH EDITION (2011), XV+752 PP.

Definition of algebraic K3 surfaces. Review of projective smooth surfaces: intersection theory, Hirzerbruch-Riemann-Roch, Serre duality, algebraic and numerical Neron-Severi group. Invariants of algebraic K3 surfaces: Riemann-Roch, Picard group and Neron-Severi group, Hodge numbers, Chern numbers.
Examples of K3 surfaces: complete intersections, double planes, Kummer surfaces, complete intersections in Fano manifolds of coindex three.Review of compact complex manifolds: cohomology (Poincare duality, De Rham cohomology, Dolbeaut cohomology, Frolicher spectral sequence, Hodge decomposition), correspondence between Moishezon (resp. projective) manifolds and complex smooth proper (resp. projective) algebraic spaces, GAGA theorems, criteria of projectivity of Kodaira and Moishezon. Review of compact complex surfaces: Moishezon is equivalent to projective, Kahler is equivalent to the eveness of the first Betti number, Hodge theory for non Kahler surfaces, the lattice on the second integral cohomology group (unimodularity, topological index theorem, Wu's formulas for the parity), the lattice on the Neron-Severi group (Lefschetz (1,1)-theorem, signature).
Complex K3 surfaces: examples (non projective Kummer), Hodge numbers and Chern classes, singular cohomology, the Picard number, the structure of the lattice on the second integral cohomology group, topology of K3 (deformation equivalence, diffeomorphism and homeomorphism class of K3 surfaces). Curves on algebraic K3 surfaces: adjunction, dimension of the associated complete linear system. Criteria for a line bundle to be ample or nef.
Line bundles on algebraic K3 surfaces: the classification of mobile line bundles, fixed divisors, nef and big line bundles have vanishing higher cohomology groups, the classification of nef line bundles.
Projective models of algebraic K3 surfaces: hyperelliptic and non hyperelliptic linear systems. The ample cone of algebraic K3 surfaces: walls and chamber decomposition of the positive cone, the Weyl group acts simply transitively on the set of chambers.
(Pseudo)Effective cone of algebraic K3 surfaces: the fundamental tricothomy of Kovacs, circularity vs locally finitely generatedness, extremal rays (-2 curves and indecomposable elliptic classes), necessary (and sufficient) restrictions on the Picard number.
Cone theorem for K3 surfaces (without proof). Characterization of K3 surfaces that are Mori dream spaces (without proof). The Hilbert scheme of K3 surfaces.
Smoothness of the Hilbert scheme of K3 surfaces. The moduli stack of primitively polarized K3 surfaces is a separated DM stack of finite type, smooth away from bad characteristics.
The coarse moduli space of primitively polarized K3 surfaces is a separated algebraic space of finite type, which has finite quotient singularities away from bad characteristics. Period domains associated to lattices with at least 2 positive indices.
Variation of Hodge structures associated to a family of complex K3 surfaces and local/global period maps. The period map from the universal deformation space to the period domain is a local isomorphism (local Torelli theorem). The moduli space of marked K3 surfaces and its connected components. Properties of the period map from the moduli space of marked K3 surfaces to the period domain (without proof): surjectivity of the period map and global Torelli theorem. Weak and strong Hodge-theoretic Torelli theorem.
Reformulation of the global and Hodge-theoretic Torelli theorems in terms of the group of Hodge isometries. Variation of Hodge structures associated to a family of complex K3 primitively polarized surfaces and period maps. The moduli space of marked primitively polarized K3 surfaces. Properties of the polarized period map: it is an open embedding (without proof), description of the image. The coarse moduli space of primitively polarized complex K3 surfaces is a quotient of the moduli space of marked primitively polarized K3 surfaces and it is quasi-projective and irreducible.
Coherent shaves on arbitrary schemes (torsion filtration, duality, pure and reflexive sheaves). Semistability: reduced Hilbert polynomial, Harder-Narashiman filtration, Jordan-Holder filtration, S-equivalence and polystable sheaves. (d,d')-semistability: the abelian category of (d,d')-coherent sheaves, (d,d')-semistability, slope semistability, Langton-Maruyama completeness result. The moduli space of (semi)stable sheaves on an arbitrary polarized projective scheme: method of construction using the Quot scheme and GIT.

D. Huybrechts: Lectures on K3 surfaces. Cambridge University Press, 2016.

The course consists of a set of single-issue lessons that will address the following topics:

1. From the computer to the information system: evolution of IT systems and information systems
2. Introduction to Enterprise Information Systems
3. Operative Systems
4. Networks
5. Relational Database
6. Data warehouse
7. Web based applications
8. Information Systems security
9. Software Engineering foundations elements

1. M. Pighin, A. Marzona, Sistemi Informativi Aziendali - Struttura e applicazioni, second edition, Pearson, 2011
2. Lecture notes published by the teacher on the course website (http://www.mat.uniroma3.it/users/liverani/IN530)

Introduction to cryptography. Historical background. Definition of cryptosystem.
Classical ciphers. Introduction to cryptoanalysis.
Introduction to public key cryptography.
Computational complexity. The knapsack problem. The Merkle-Hellman cryptosystem.
The RSA cryptosystem. Primality testing. Factorization algorithms.
Some RSA attacks. the Rabin cipher.
The discrete logarithm problem. Diffie-Hellman key exchange.
Elgamal cryptosystem.
Digital signature. Signature schemes. The RSA scheme. The Elgamal scheme.
Notes on some cryptographic protocols.

Stinson - Cryptography, theory and practice. Chapman and Hall.
Baldoni, Ciliberto, Piacentini-Cattaneo - Aritmetica, crittografia e codici. Springer.

LAGRANGIAN AND HAMILTONIAN MECHANICS. VARIATIONAL PRINCIPLES. CONSTRAINTS. CYCLICI VARIABLES. CONSTANTS OF MOTION AND SYMMETRIES. HAMILTONIAN FLOWS. LIOUVILLE THEOREM AND POINCARE RECURRENCE THEOREM. CANONICAL TRANSFORMATIONS. GENERATING FUNCTIONS. HAMILTON-JACOBI METHOD AND ACTION-ANGLE VARIABLES. PERTURBATION THEORY. KAM THEOREM.

[1] G. GENTILE,INTRODUZIONE AI SISTEMI DINAMICI. 1.EQUAZIONI DIFFERENZIALI ORDINARIE, ANALISI QUALITATIVA E ALCUNE APPLICAZIONI.
AVAILABLE ON-LINE: http://www.mat.uniroma3.it/users/gentile/2016-2017/FM410/testo.html
[2] G. GENTILE,INTRODUZIONE AI SISTEMI DINAMICI. 2.FORMALISMO LAGRANGIANO E HAMILTONIANO.
AVAILABLE ON-LINE: http://www.mat.uniroma3.it/users/gentile/2016-2017/FM410/testo.html
[3] G. DELL'ANTONIO, ELEMENTI DI MECCANICA. LIGUORI EDITORE, (1996)
[4] V.I. ARNOLD, METODI MATEMATICI DELLA MECCANICA CLASSICA. EDITORI RIUNITI, (1979)
[5] G. GALLAVOTTI, MECCANICA ELEMENTARE. BOLLATI-BORINGHIERI, (1980)

LAGRANGIAN AND HAMILTONIAN MECHANICS. VARIATIONAL PRINCIPLES. CONSTRAINTS. CYCLICI VARIABLES. CONSTANTS OF MOTION AND SYMMETRIES. HAMILTONIAN FLOWS. LIOUVILLE THEOREM AND POINCARE RECURRENCE THEOREM. CANONICAL TRANSFORMATIONS. GENERATING FUNCTIONS. HAMILTON-JACOBI METHOD AND ACTION-ANGLE VARIABLES. PERTURBATION THEORY. KAM THEOREM.

[1] G. GENTILE,INTRODUZIONE AI SISTEMI DINAMICI. 1.EQUAZIONI DIFFERENZIALI ORDINARIE, ANALISI QUALITATIVA E ALCUNE APPLICAZIONI.
AVAILABLE ON-LINE: http://www.mat.uniroma3.it/users/gentile/2016-2017/FM410/testo.html
[2] G. GENTILE,INTRODUZIONE AI SISTEMI DINAMICI. 2.FORMALISMO LAGRANGIANO E HAMILTONIANO.
AVAILABLE ON-LINE:http://www.mat.uniroma3.it/users/gentile/2016-2017/FM410/testo.html
[3] G. DELL'ANTONIO, ELEMENTI DI MECCANICA. LIGUORI EDITORE, (1996).
[4] V.I. ARNOLD, METODI MATEMATICI DELLA MECCANICA CLASSICA. EDITORI RIUNITI, (1979).
[5] G. GALLAVOTTI, MECCANICA ELEMENTARE. BOLLATI-BORINGHIERI, (1980)

Definition of a sigma-algebra; measures on a sigma-algebra; definition of the integral; monotone and dominated convergence theorems; continuity and derivation under the integral sign; the L^p spaces; Holder and Minkowski inequalities; L^p is complete; the Borel sets and Lusin's theorem; the compactly supported, C^\infty functions are dense in L^p(R^n); convergence in measure and almost-uniform convergence; Egorov's theorem; Caratheodory's extension theorem and the construction of Lebesgue's measure; product measures; the theorems of Fubini and Tonelli; complex measures; the Radon=Nykodim theorem and differentiation of measures.

W. Rudin, Real and complex analysis, Tata-McGraw Hill.

H. L. Royden, Real analysis, China Machine Press.

R. L. Wheeden, A. Zygmund, Measure and integral, Dekker.

COMPLEXITY, COMPUTABILITY, REPRESENTABILITY: DECISION PROBLEMS, FINITE AUTOMATA AND ALGORITHMS. TURING-COMPUTABILITY. SPACE AND TIME COMPLEXITY OF ALGORITHMS. RAM MACHINES. COMPLEXITY FUNCTIONS. RECURSIVE FUNCTIONS. THE HALT PROBLEM FOR TURING MACHINES. FUNCTIONAL PROGRAMMING: LAMBDA CALCULUS. CHURCH-ROSSER THEOREM. STRATEGIES OF REDUCTION. SOLVABLE TERMS. BÖHM'S THEOREM. THEOREM FOR LAMBDA-DEFINABLE RECURSIVE FUNCTIONS. BETA-FUNCTIONAL MODELS OF LAMBDA-CALCULUS. OBJECT-ORIENTED PROGRAMMING: CLASSES, FUNCTIONAL CLASSES. CLASS INHERITANCE. ABSTRACT CLASS DECLARATION. PUBLIC AND PRIVATE METHODS. METHOD LATE-BINDING.

[1] DEHORNOY, P., COMPLEXITE' ET DECIDABILITE'. SPRINGER-VERLAG, (1993).
[2] KRIVINE, J.-L., LAMBDA CALCULUS: TYPES AND MODELS. ‪ELLIS HORWOOD, (1993).
[3] SIPSER,M., INTRODUCTION TO THE THEORY OF COMPUTATION.THOMSON COURSE TECHNOLOGY, (2006).
[4] GABBRIELLI, M., MARTINI, S., LINGUAGGI DI PROGRAMMAZIONE: PRINCIPI E PARADIGMI. MCGRAW-HILL, (2011).

FURTHER TEXTBOOKS:

[4] AHO, HOPCROFT, ULLMAN, DESIGN AND ANALYSIS OF COMPUTER ALGORITHMS. ADDISON-WESLEY PUB. CO., (1974).
[5] AUSIELLO, G., GAMBOSI, G., D'AMORE F., LINGUAGGI, MODELLI, COMPLESSITA'. FRANCO ANGELI (2003).
[6] A. BERNASCONI, B. CODENOTTI, INTRODUZIONE ALLA COMPLESSITA' COMPUTAZIONALE. SPRINGER-VERLAG, (1998).
[7] SETHI, R., PROGRAMMING LANGUAGES: CONCEPTS AND CONSTRUCTS. ADDISON-WESLEY (ED. ITALIANA ZANICHELLI), (1996).
[8] HERMES, H., ENUMERABILITY, DECIDABILITY, COMPUTABILITY. DIE GRUNDLEHREN DER MATHEMATICHENWISSENSHAFTEN IN EINZELDARSTELLUNGEN, N. 127, SPRINGER-VERLAG, (1969).
[9] DARNELL, P. A. AND MARGOLIS, P. E., C A SOFTWARE ENGINEREEING APPROACH. SPRINGER-VERLAG, (1996).