General Information
| Instructor(s) | Pascal Amsili |
| Place, time | Wednesdays, 9:30-12:30 am. Starting Sept. 21. Site Saints-Pères, salle SCFC1 (8th floor). |
| Code | LING 102 |
| Credits | 4 ECTS |
| Major | Linguistics |
| Prerequisites | Introduction to linguistics (but talk with the instructor(s)) |
| Course taught in | English |
| Teaching format | On-site teaching. Students who need to follow the class off-site should contact the instructor asap. See below for detailed course policies. |
| Links | Moodle link / Cogmaster, Linguistic Major, syllabus, schedule |
| Previous classes |
2021-2022
2020-2021 2019-2020 |
Contrôles (assessment)
| Modalités | There will be Homeworks can be handed in in class (paper) or on moodle (pdf format). On moodle the deadline is 23:59. |
| Homework #1 (10-05) | automata (due October, 19); answers (new version) |
| Homework #2 (11-09) | grammars (NEW VERSION!) (due November 30); answers |
| Homework #3 (11-30) | predicate logic (due December 14); + answers |
| Homework #4 (12-14) | Cancelled |
| Final exam | The final exam will take place during the last class (January, 19) and last 3 hours. It will be in the form of a time-limited assignment, with no documents allowed, and will comprise 3 different parts. One part (approximately one-quarter of the time) will bear on finite state automata, one part (same weight) will bear on context-free grammars, and the last part (approximately one half of the total time) will bear on Montague's program (use of λ-calulus to compute compositionaly semantic representations). The first two phases will consist of short exercises similar to the ones given for homeworks, while the third one will be more like a progressive (guided) elaboration of a fragment similar to the ones built up in class. |
| Exam: preparation | In addition to documents and sites listed in the "pointers" section, you may also want to have a look at some of my previous exams, most of them available on my material web page (in French). In particular, you may find useful the exercises with answers here, here, here, and many others. |
| Results | marks (instructions) |
| Exam: answer | Here is a detailed correction of the exam given on January, 18. |
Schedule (tentative)
| 2022-09-21 | Formal Language Theory (FLT) 1. Formal Languages |
slides |
| 2022-09-28 | FLT: 2. Regular Languages |
slides
exercice sheet + answers |
| 2022-10-05 | FLT: 2. Regular Languages (pumping lemma and other properties) | slides |
| 2022-10-12 | FLT: 3. Formal Grammars | slides (temporary version)
a hand-out (in French) on regular languages and algorithms. |
| 2022-10-19 | FLT: 3. Formal Grammars | Exercises: first page of last year's exercise sheet + answers |
| 2022-10-26 | FLT: 4. Formal Complexity of NL | slides |
| 2022-11-02 | No class (semester break) | |
| 2022-11-09 | First Order Logic (FOL) Propositional Logic | slides (preliminary version) ; exercises (prop. logic)
Last years hand-outs: prop. logic, pred. logic |
| 2022-11-16 | FOL: Predicate Logic | slides (final version) ; exercises (pred. logic) |
| 2022-11-23 | No class (PSL Week) | |
| 2022-11-30 | FOL: Predicate Logic, exercises | |
| 2022-12-07 | No class (Job prospects day) | |
| 2022-12-14 | FOL: about quantification and compositionality
Compositionality & λ-Calculus (CLC): Pure lambda-calculus |
slides on quantification exercises (pure language) |
| 2022-12-21 | No class (winter break) | |
| 2022-12-28 | No class (winter break) | |
| 2023-01-04 | CLC: Typed language | slides (pure and types language, fragment);
answer to exercises (pure language) |
| 2023-01-11 | CLC: Montagovian programme | slides (fragment) |
| 2023-01-18 | Exam | |
Pointers (references, bibliography, online resources)
- About First Order Logic, a 28p. hand-out (in French) that may be useful.
- About regular languages and automata, a 30p. hand-out (in French) that may be useful (covers additional material and algorithms).
- Barbara Partee, Alice ter Meulen & Robert E. Wall, Mathematical Methods in Linguistics, Kluwer Academic Publishers, 1993.
- Gamut, L. T. F. (1991). Logic, Language, and Meaning, volume 1: Introduction to Logic; volume 2: Intensional Logic and Logical Grammar. University of Chicago Press.
- About the complexity of natural language, a relatively recent survey can be found here: António Branco, 2018: Computational Complexity of Natural Languages: A Reasoned Overview.
- For those interested in pure untyped lambda-calculus : The Interactive Lambda-calculus Tracer: TILC aims to be a friendly visual tool for teaching/studying main basic pure untyped lambda-calculus concepts.
- More directly relevant to the fragment construction process we've been practicing: the lambda-calculator (formerly the Penn Lambda Calculator).
- More about λ-calculus: very useful lecture notes from this class:
CS 152, Programming Languages (Harvard, 2016):
- Pure language,
- Combinators,
- Typed language (the last one is less relevant for us).
Course policies
Some course policies are general to all Cogmaster courses. These common policies are:- Attendance is mandatory and verified. More than 2 justified absences means that students can no longer validate a course for credit (ECTS).
- Final grades below 6/20 are eliminatory (i.e. the credits cannot count towards the 30 ECTS necessary to validate a semester).
- There is no second session (“rattrapage”).
- The minimal penalty for plagiarism is the removal of the ECTS from the student’s course contract.
- Courses are indivisible; students cannot follow and validate only part of a course for partial credit.