CSc 520. Course Outline (Subject to change) Course Outline (Subject to change)... Principles of Programming Languages. Christian Collberg

Transcription

1 Slide 0 2 Course Outline (Subject to change) This course will define, analyze and evaluate important concepts found in current programming languages. Its goals are to build an ability to evaluate and compare programming languages, both from the user s and implementor s view, and to develop precise mechanisms for specifying the semantics of programming languages. Copyright c 2003 C. Collberg Administrivia Christian Collberg January 15, 2003 CSc 520 Principles of Programming Languages University of Arizona Course Outline (Subject to change)... In particular, we will cover the following topics: Class : 520 PRINCIPLES OF PROGRAM- MING LANGUAGES Slide scope of objects and time of binding 2. module mechanisms (e.g., blocks, procedures, coroutines) 3. data abstraction, datatypes 4. control structures 5. storage management and runtime support Slide 0 1 Lecturer : Christian Collberg collberg@cs.arizona.edu WWW : collberg Office : 758 Office Hours : Open door policy Phone : Lectures : 10:30-11:45, MW, GLD-S operational, denotational, and axiomatic semantic specification; attribute grammars 7. applicative and object-oriented languages Book : Programming Language Pragmatics. Michael Scott TA : TBA,

2 Slide 0 6 Final Project Project topics should be finalized by Monday, March 1. Hand in a one-page synopsis of the project prepared using the L A TEX typesetting system. All topics must be OK:ed by the instructor. The synopsis is worth 5% of your final grade. Final project reports are due Tuesday, April 29. Reports must be prepared using the L A TEX typesetting system. They should be 10 pages long. The report is worth 10% of your final grade. Projects will be presented Wednesday, April 30 through Wedesday, May 7 (last day of classes). Presentations should be no more than 10 minutes long. The presentation is worth 5% of your final grade. Slide 0 4 Grading (Subject to change) 1. One final exam (40%), Friday, May 9, 11:00 13:00. (a) The exam is closed book. (b) Without prior arrangement, missed exam grade of zero. (c) Fail the exam you might fail the course. 2. Several homework assignments (40%). Homeworks will require programming and/or theoretical work. 3. One final project (20%). The project should be done in teams of two. Final Project... Grading (Subject to change)... Typical project topics might include: If your graded score for an homework is g and you handed in k Slide 0 7 Study some language that was not covered in class. Evaluate it using the ideas presented in class. Compare and contrast to similar languages. Write a program or two in the language to show what the language is good or bad at. Slide 0 5 days late, then your computed score for this assignment will be max(0, g(1 0.1k)) if k 5 0 otherwise Study a class of languages that was not covered in class. Study a programming paradigm that was not covered in class. Late project reports/synopsis will not be accepted!

3 Suggested Final Project Topics... Final Project... Slide 0 10 Other languages: Forth, APL/J, SETL. Parallel programming languages: Occam, Linda. Obfuscated languages: Brainf*ck, Befunge, Intercal. Scripting languages: Perl, Python, Tcl, Ruby, SNOBOL, JavaScript. Semantic description languages: Action semantics, Z. Slide 0 8 Read 2-3 theoretical programming language papers on a topic that interests you. Summarize and critique the papers. Study how some language feature not covered in class has been realized in a few programming languages. Write programs in each language to show how the feature impacts real programs. Compare, contrast, and critique. Slide 0 11 Suggested Final Project Topics... Novel paradigms: visual programming languages, multiparadigm programming languages (Leda), constraint programming languages, literate programming languages, mobile programming languages, aspect-oriented programming languages (AspectJ), dataflow programming languages, functional-logic programming. Language features: macros (Scheme), futures, module systems (ML), persistence (Napier88), input/output facilities. Implementation techniques: runtime code generation. Theory: Typed assembly language, proof-carrying code. Slide 0 9 Suggested Final Project Topics OO languages: Cecil, BETA, Eiffel, Obliq, Pizza, Sather, Simula, C#, Objective-C, Smalltalk. FP languages: Erlang, Hope, Sisal. LP languages: Mercury. Special purpose languages: compiler construction (Gentle), symbolic mathematics (Macsyma, Matlab, Mathematica), web programming (WebL, PHP), database programming (SQL, Mumps, RPG, COBOL), linking languages (Mesa), teaching languages (Pascal, Turing, Logo, ABC), typesetting languages (TEX/L A TEX, Postscript, PDF), architecture description languages (VHDL), computer gaming languages, robotic control languages.

4 3. A study of programming language constructs: Names and scope. Expressions. Course Organization (Subject to Change) Control structures (loops, iterators, short-circuit evaluation). Slide 0 14 Data types (type equivalence and inference, records, arrays, strings, pointers). Runtime organization (calling sequences, exceptions, nested procedures, coroutines, parameter passing, garbage collection). Slide Introduction: Language design goals. Language translation systems. Object-oriented programming (single/multiple inheritance, dynamic dispatch, run-time typechecking). To study each feature you will write small interpreters (in Prolog) and/or small test-programs in several languages. 4. Formal description of programming languages: Lexical/syntactic specification (regular expressions, context free grammars, EBNF). 2. A survey of important programming languages and paradigms: Functional programming: Scheme and Gofer/Haskell. Concrete vs. abstract syntax. Logic programming: Prolog. Lambda calculus. Procedural programming: Pascal, Modula-2, Ada. Slide 0 15 Semantic specification (denotational, axiomatic, and operational specification, attribute grammars). Slide 0 13 Object-Oriented programming: Modula-3 and C++. String programming: Icon. I will lecture on each language. You will be responsible for You will write formal specifications of small languages. reading up on the details of the languages. This will involve getting out books from the library, searching the web for relevant tutorials, etc. There will be one small programming assignment for each language.

5 Handouts & Other Material You will not Academic Integrity 1. turn in another student s work as your own. Slide I always make copies of my transparencies available to students. Note that I do this to relieve you of having to take notes during lectures, they are not substitutes for reading the textbook, their primary purpose is to remind you of what you need to study for the exam. Slide use material from the web, textbooks, journals, etc. without giving the appropriate attribution. 3. accept solutions from other students. 4. give solutions to other students. 5. tamper with graded papers or exams. 6. collaborate with students outside your own team. Sanctions typically include: grade reduction, course failure, suspension, expulsion. I take this stuff seriously. Handouts & Other Material... Academic Integrity... Students who violate the Code are also subject to possible sanctions imposed by the Dean of Students office. Slide Various manuals and papers will be handed out during class. Extra copies can be picked up from the boxes outside my office. 3. Various information regarding the course (including postscript files of the handouts) can be found on the info-bahn: Teaching/520/2003/index.html Slide 0 17 Submitted solutions will be compared with each other, as well as with solutions from previous semesters. All students involved in collusion are equally culpable: 1. Do not give another student access to your account. 2. Do not leave printouts in the recycling bin. 3. Pick up your printouts promptly. 4. Do not leave your workstation unattended. If you suspect that your work has been compromised notify me immediately.

6 Free Compilers and Interpreters Ada: ftp://wuarchive.wustl.edu/languages/ada/compiler/ gnat/distrib/3.14p Slide 0 20 Scheme: Modula-2: gaius/web/gnumodula2.html Modula-3: Gofer: ftp://ftp.dcs.gla.ac.uk/pub/haskell/gofer. Also see Slide 0 21 Installed Translators Compilers and interpreters available on lectura: Pascal: gpc Scheme: scheme and scheme48. C,C++,Objective-C: gcc. ML: sml. Icon: icont. Prolog: prolog. Compilers and interpreters available on linux: Gofer: /home/cs520/2003/bin/linux/gofer