| |
15-317 Constructive Logic
| Fall 2009 |
| Frank Pfenning and Ron Garcia |
| TuTh 12:00-1:20 |
| GHC 4102 |
| Recitation Sec A, Wed 12:30-1:20, WeH 8427 |
| 9 units |
This multidisciplinary junior/senior-level course is designed to provide a
thorough introduction to modern constructive logic, its roots in philosophy,
its numerous applications in computer science, and its mathematical
properties. Some of the topics to be covered are intuitionistic logic,
inductive definitions, functional programming, type theory,
connections between classical and constructive logic, logic programming,
linear logic, lax logic.
What's New?
- (11/20) Assignment 10
on Bottom Up Logic Programming is out
(Starter test code)
- (11/12) Assignment 9
on Proving Metatheorems in Twelf is out
(Starter code,
LaTeX source)
- (11/10) Solutions are also available for
Assignment 8
- (11/10) Solutions are now available for
Midterm 2
- (11/03) Solutions are now available for Assignment 7
(Written,
Prolog)
- (11/02) Last year's Midterm 2 is
now in Handouts, for reference while you
study.
- (10/29) Assignment 8
on Representing Proofs in Twelf is out
(Starter code)
- (10/27) Solutions are now available for Assignment 6
(Written,
Prolog)
- (10/22) Assignment 7
on Programming in Prolog is out
(Starter code,
LaTeX source)
- (10/17) Solutions are now available for Assignment 5
(Written,
Code)
- (10/15) Assignment 6
on Logic Programming and Inversion is out
(LaTeX source)
- (10/15) Notes for Lecture
14: Prolog are now
available.
- (10/13) Notes for Lecture
13: Logic Programming are now
available.
- (10/09) Notes for Lecture 12: Propositional
Theorem Proving are now available.
- (10/08) Assignment 5
on Sequent Calculus for Proof Search is out
(Starter code,
Test harness,
LaTeX source)
- (10/7) Solutions are now available for
Midterm 1
- (10/6) Solutions are now available for Assignment 4
(Written,
Tutch)
- (9/29) Solutions are now available for Assignment 3
(Written,
Tutch)
- (9/27) Notes for Lecture 9: Sequent Calculus are now available.
- (9/27) Last year's Midterm 1 is
now in Handouts, for reference while you
study.
- (9/25) Notes for Lecture 8: Classical Computation
are now available.
- (9/24) Assignment 4
on Classical and Intuitionistic Logic is out
(Tutch requirements,
LaTeX source)
- (9/20) Notes for Lecture 7: Classical Logic are now available.
- (9/18) Solutions are now available for Assignment 2
(Written,
Tutch)
- (9/17) Reminder There will be no class on Tuesday, 9/22.
- (9/17) Assignment 3
on Natural Numbers and Classical Reasoning is out
(Tutch requirements,
LaTeX source)
Due Thu Sep 24 before class.
- (9/10) Assignment 2
on Quantifiers and Proof Terms is out
(Tutch requirements,
LaTeX source)
Due Thu Sep 17 before class.
- (9/3) Assignment 1 on
Natural Deduction is out, including a
requirements file for the Tutch
proofs and LaTeX source (plus
proof.sty) in case you would like
to typeset your solutions.
Due Thu Sep 10 before class.
- (9/1) Notes for Lecture 1: Overview,
Lecture 2: Natural Deduction, and
Lecture 3: Harmony are now available.
- (8/22) Website created.
- See Constructive Logic, Fall 2008
for information on a prior version of this course.
Class Material
| Schedule |
Lecture schedule, readings, and code |
| Assignments |
Assignments, due dates, and policies |
| Handouts |
Course handouts |
| Software |
Proof checkers, language implementations, model-checkers |
Course Information
| Lectures |
TuTh 12:00-1:20, GHC 4102, Frank Pfenning and Ron Garcia |
| Recitations |
Section A, Wed 12:30-1:20, WeH 8427, William Lovas
|
| Textbook |
There is no textbook.
Notes will be handed out throughout the class.
|
| Credit |
9 units |
| Grading |
40% Homework and Tests, 15% Midterm I, 15% Midterm II, 30% Final |
| Homework |
Weekly homework is assigned each Thursday and due the following Thursday.
3 late days can be used throughout the semester.
(Each late day beyond the 3 free ones will deduct 20% from an
assignment's total possible score.)
Homework assignments are worth a total of 400 points.
|
| Midterm I |
Thu Oct 1, in class, 150 points.
Closed book, one two-sided sheet of notes permitted.
|
| Midterm II |
Thu Nov 5, in class, 150 points.
Closed book, one two-sided sheet of notes permitted.
|
| Final |
Date and time TBA, 300 points.
Open book.
|
| Topics |
Intuitionistic Logic, Inductive Definitions,
Functional Programming, Type Theory,
Logic Programming,
Classical Logic, Linear Logic, Lax Logic
|
| Home |
http://www.cs.cmu.edu/~fp/courses/15317-f09/ |
| Newsgroup |
academic.cs.15-317 |
| Directory |
/afs/andrew.cmu.edu/scs/cs/15-317/ |
Teaching Staff
| |
|
Office |
Office Hours |
Phone |
Email |
| Lecturer |
Frank Pfenning |
GHC 9101 |
Wed 11:00-12:00 |
x8-6343 |
fp@cs |
| Lecturer |
Ron Garcia |
GHC 9004 |
Tue 3:00-4:00 |
x8-9873 |
rxg@cs |
| Section A |
William Lovas |
GHC 9110 |
Tue 3:00-4:00 |
x8-8184 |
wlovas@cs |
[ Home
| Schedule
| Assignments
| Handouts
| Software
]
fp@cs
Frank Pfenning
|