DOC PREVIEW
UA CSC 520 - Lecture Notes

This preview shows page 1-2-21-22 out of 22 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 22 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Contact InformationCourse Outline (Subject to change)Course Outline (Subject to change)ldotsGrading (Subject to change)Grading (Subject to change)ldotsGradingldots Attendance Policyedtxt {Subject to Change} Policy Notification of Objectionable Materials Handicapped Accessibility Student Code of Academic Integrity Student Code of Academic Integrityldots Student Code of Academic Integrityldots Course MethodologyPrerequisites, Required Knowledge Learning LanguagesHandouts & Other MaterialHandouts & Other Materialldots Free Compilers and InterpretersInstalled TranslatorsNow What?520—Spring 2005—0CSc 520Principles of ProgrammingLanguages0: AdministriviaChristian [email protected] of Computer ScienceUniversity of ArizonaCopyrightc 2005 Christian Collberg[1]520—Spring 2005—0Contact InformationClass : 520 PRINCIPLES OF PROGRAMMING LANGUAGESLecturer :Christian CollbergEmail : [email protected] : http://www.cs.arizona.edu/∼collbergOffice : 758Office Hours : Open door policyPhone : 621-6612Lectures : 3:00–4:15, MW, GLD-S 701Book : Programming Language Pragmatics. Michael ScottTA :TBA[2]520—Spring 2005—0Course Outline (Subject to change)This course will define, analyze and evaluate importantconcepts found in current programming languages.Its goals are to build an ability to evaluate and compareprogramming languages.We will evaluate and compare languages both from theuser’s and implementor’s view.We will develop precise mechanisms for specifying thesemantics of programming languages.[3]520—Spring 2005—0Course Outline (Subject to change)...In particular, we will cover the following topics:1. scope of objects and time of binding2. module mechanisms (e.g., blocks, procedures,coroutines)3. data abstraction, datatypes4. control structures5. storage management and runtime support6. operational, denotational, and axiomatic semanticspecification; attribute grammars7. applicative and object-oriented languages[4]520—Spring 2005—0Grading (Subject to change)1. One final exam (50%), Wednesday, May 11,14:00–16:00.(a) The exam is closed book.(b) Without prior arrangement, missed exam⇒ grade ofzero.(c) Fail the exam⇒ you might fail the course.2.“Several” homework assignments (50%) . Homeworksmay require programming, theoretical work, or paperpresentations.[5]520—Spring 2005—0Grading (Subject to change)...If your graded score for an homework is g and you handedink days late, then your computed score for thisassignment will be(max(0, g(1 − 0.1k)) if k ≤ 50 otherwise[6]520—Spring 2005—0Grading...I reserve the right to scale final grades.Scaling can be both “up” and “down”, depending, forexample, on whether the final exam turned out to beparticularly easy or hard.You cannot make up an in-class test unless1. you have notified us in writing (email is fine) or byphone prior to the test that you will be absent, and2. you can produce a note from your doctor saying thatyou were incapable to take the test, and3. you receive permission from the instructor prior to thetest.[7]520—Spring 2005—0Attendance PolicyYou are not required to attend lectures, but...you cut class at your own risk.Anything covered in class or in any of the requiredreadings is fair game on tests and exams.[8]520—Spring 2005—0Subject to Change PolicyWe may add, drop, or change topics.We may change exam or homework dates, etc.Changes will be announced in class and on theclass web site!You are responsible for checking this site regularly.You should also check the course newsgroupcs.course520 for announcements.[9]520—Spring 2005—0Notification of Objectionable MaterialsSome of the material may be hard, boring, or both.The instructor is known to sometimes make jokes inclass whicha) are not funny, orb) may be slightly off-color.He apologizes in advance.Assignments and examples may touch on subjectswhich some may deem questionable, such as sex, war,and rock’n’roll.[10]520—Spring 2005—0Handicapped AccessibilityStudents with disabilities who require reasonableaccommodations to fully participate in course activities ormeet course requirements must register with the DisabilityResource Center. If you qualify for services through DRC,bring your letter of accommodations to me as soon aspossible. Seehttp://drc.arizona.edu.[11]520—Spring 2005—0Student Code of Academic IntegrityAssignments in this course require individual attentionand effort to be of any benefit. All work is expected tobe that of each student alone. You may not consult withothers, except in ways specifically authorized by thecourse instructor. You also may not plagiarize anotherperson’s work or copy another person’s code.[12]520—Spring 2005—0Student Code of Academic Integrity...Code of Academic Integrity. Students are responsiblefor understanding and complying with the University’sCode of Academic Integrity. A synopsis of the Code isattached; the full text is available from the Office of theDean of Students in Room 203 Old Main. Among otherprovisions, the Code demands that the work you submitis your own, and that graded papers and exams will notsubsequently be tampered with. Copying of anotherstudent’s programs or data, or writings is prohibitedwhen they are part of a published class assignment; itis immaterial whether the copying is by computer, xerox,pen or other means. Witting collaboration in allowingsuch copying is also a Code violation.[13]520—Spring 2005—0Student Code of Academic Integrity...Assignments in this course require individual attentionand effortViolations of the Code will, at minimum, result in loss ofcredit for a graded item. An egregious first violation orany second violation will minimally result in failure of theentire course.See alsohttp://info-center.ccit.arizona.edu/˜studpubs/policies/cacaint.htmthe University of Arizona Code of Academic Integrity.I take academic integrity seriously! I will report every violation![14]520—Spring 2005—0Course MethodologyI will lecture, you will learn.You will participate in class discussions.It is important in this class to allot significant timeoutside of class to programming in the new languageswe will study.You cannot pass this class by cramming before the final.Most of the languages we will study have freeimplementations. If you own your own computer it’s agood idea to download and install the interpreters sothat you can work at home.[15]520—Spring 2005—0Prerequisites, Required


View Full Document

UA CSC 520 - Lecture Notes

Documents in this Course
Handout

Handout

13 pages

Semantics

Semantics

15 pages

Haskell

Haskell

15 pages

Recursion

Recursion

18 pages

Semantics

Semantics

12 pages

Scheme

Scheme

32 pages

Syllabus

Syllabus

40 pages

Haskell

Haskell

17 pages

Scheme

Scheme

27 pages

Scheme

Scheme

9 pages

TypeS

TypeS

13 pages

Scheme

Scheme

27 pages

Syllabus

Syllabus

10 pages

Types

Types

16 pages

FORTRAN

FORTRAN

10 pages

Load more
Download Lecture Notes
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture Notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture Notes 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?