Programming Languages (CSC-302 99S)


Class 01: Introduction

On to A Brief History of Programming Languages.

Held Monday, January 25

Summary

Contents


Background

What is a programming language?

Why study programming languages?

How should we study programming languages

Course Organization

See the handouts in the course web.

Key Components of Programming Languages

Syntax and Semantics

A Casual Survey of Language Models

Sorting, in the various paradigms

This is a rough attempt to flesh out some of the differences between the paradigms by looking at how one might write a sorting algorithm in the different paradigms. Sorting is a fairly imperative process, so all will look somewhat imperative.

Imperative

Declarative

S is a sorted version of L if
  S is a permutation of L AND
  the elements of S are in order

Object-oriented

An object-oriented sorting algorithm would presumably ask objects to compare themselves to each other, rather than using an explicit comparison.

Functional

A functional sorting algorithm would probably take a compares function as an argument.

Parallel

Guess.


History


On to A Brief History of Programming Languages.


Disclaimer Often, these pages were created ``on the fly'' with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS302/99S/Outlines/outline.01.html

Source text last modified Fri Jan 29 10:11:13 1999.

This page generated on Fri Jan 29 10:20:09 1999 by SiteWeaver. Validate this page.

Contact our webmaster at rebelsky@math.grin.edu