C311 Lisp Introduction

PDF

C311 Fun and Useful Information

C311 Fun and Useful Information Will Byrd September 1 2004 (Revised2) 1 Lisp (Scheme) Testimonials Scheme is a dialect of Lisp which stands for “List Processing” Lisp is a programmable programming language1 John Foderaro CACM September 1991 Lisp isn’t a language it’s a building material Alan Kay

PDF

COMMON LISP: A Gentle Introduction to Symbolic Computation

the Common Lisp programming environment that have made the language such a productive tool for rapid prototyping and AI programming This current volume of the ‘‘gentle introduction’’ uses Common Lisp throughout Lisp has been changing continuously since its invention 30 years ago In the past not only were the Lisp dialects on

PDF

Common-lisp Lecture Notes

In this handout I will present the basic ideas and concepts necessary for programmingin LISP I'll start by introducing the basic data types then I'll discuss functions list processing logical operators and com-parators control structure and recursion Finally I'll discuss the remaining elements you will need to write programs: I/O operators

PDF

Introduction Programming in Lisp

Introduction to Programming in Lisp Supplementary handout for 4th Year AI lectures D W Murray Hilary 1991 1 Background There are two widely used languages for AI viz Lisp and Prolog The latter is the language for Logic Programming but much of the remainder of the work is programmed in Lisp

PDF	Introduction to LISP

What data type does Lisp use?
By convention, Lisp programmers reserve NOT for logical operations: changing true to false and false to true. They use NULL when they want to test whether a list is empty. This chapter introduced the most versatile data type in Lisp: lists. Lists have both a printed and an internal representation.
What is a lisp evaluation function?
The heart of Lisp: EVAL is a function that evaluates a Lisp expression according to a set of evaluation rules, and returns the result. A way to write Lisp expressions as lists. The first element of a list specifies a function, and the remaining elements specify arguments to be evaluated before the function is called.
When was Lisp first used?
The Lisp 1.5 Programmer’s Manual by McCarthy et al. appeared in 1962. By 1964 Lisp was running on several types of computers, including an IBM 7094 under MIT’s Compatible Timesharing System; it was thus one of the first interactive programming languages. Digital Equipment Corporation (DEC) also played a prominent role in Lisp’s history.
Where can I find a good introduction to Common Lisp?
For advanced undergraduates, Guy L. Steele Jr.’s Common Lisp: The Language (published by Digital Press) would be a useful companion to the introduction provided here. For beginners, Common Lisp: The Reference, by Franz, Inc. (published by Addison-Wesley) is a more suitable reference work.

January 28, 1992

In this handout, I will present the basic ideas and concepts necessary for programmingin LISP. I'll start by introducing the basic data types, then I'll discuss functions, list processing, logical operators and com-parators, control structure, and recursion. Finally, I'll discuss the remaining elements you will need to write programs: I/O operators

1 Data Types

Here is a desrciption of the basic data types in LISP. Numbers come in many different forms in LISP: in-tegers, with a virtually unlimitedrange; floating-point numbers; fractions, which are stored as ex-act ratios instead offloating-point numbers with rounding errors; and complex numbers. Characters includethe standard ascii character set, plus a f

There is one other special type ofargument: &rest. The &rest argument enables a function to have an

unlimited number of arguments. All arguments spec- ified after the ferest are collected into a list and as-signed to the variable after the &rest. A function which returns a list of all but its first argument would look like this: (defun last-args (first ftrest rest) rest) stacks.stanford.edu

3 Lists

A list is a data structure with a car and a cdr. The car is the head of the list (i.e. the first item on the list) and the cdr is the tail of the list (i.e. everything other than the first item). stacks.stanford.edu

If they all return a non-nil value, then and re-

turns t, otherwise it returns nil. (or valuel value 2 . . . ) or returns the logical or ofall its arguments. That is, it evaluates it's argu-ments in order until one of them returns t. If they all return a nil value, then or returns nil, otherwise it returns t. (let ((var value)

5 Control Structure

LISP provides a variety ofspecial structures for orga-nizing programs. Conditionals and iteration macros control the flow of programs. There are mechanisms to create local and global variables, and mechanisms to assign values to variables. (case expr (keylist actions)

5.1 Variables

(defvar varname value) defvar creates a global variable named varname and initializes its value to value. A function which tries to evaluate var-name will look first at the context of the caller for a local variable varname. If it cannot find that variable in the caller's environment, it will use the global variable's value. (setq varname value) se

6 Recursion

Recursion is one of the most important concepts in LISP. However, if you have never seen it before, it will be difficult to do it justice in these brief lecture notes. Recursion is a technique of calling a function from within its own definition. This is commonly used in LISP programs. Recursion is very useful in list pro-cessing because frequently

7 Writing Programs

The main goal of these notes is to get you to a point where you can write LISP programs. There are some topics which are not crucial to your knowledge of the art ofLISP programming, but which are necessary to allowyou to do your homework assignments. stacks.stanford.edu

7.1 Input and Output

The functions for input and output are necessary for any program you might want to write. While there are many things I would like to tell you about I/O in LISP, I will only mention the bare essentials here. streams A stream is an object to which out-put objects are written and from which in-put objects are read. There are a few global streams whic

The read command returns the next lisp object from the input stream. Note that the default

value of stream is *standard-input*. (write object &key (stream *standard-output*)) stacks.stanford.edu

The write command writes object to the output stream. Note that the default value of stream

is *standard-output*. J ln some older versions of LISP, (cdr nil) causes a run- time error. However, most current versions of LISP return 4 format format is a more powerful output function than write, but it is also more complicated. Consult a reference manual for its precise argu- ments. File operations can be controlled using the with-open-f ile

8 Advanced Topics

There is so much more that I would like you to know about LISP that it almost brings me to tears. Then, of course, I quicklyregain my perspective. But that shouldn't stop you from wanting to learn more. The useful advanced topics you out to know are: property lists, hash tables, macros, type specifiers, scope and CLOS extent, (Common-Lisp object sy

Share on Facebook Share on Whatsapp

Choose PDF

More..

PDF	Introduction to artificial intelligence & expert systems - LPU Distance LISP and Other AI Programming Languages: Introduction to LISP Syntax and Numeric Functions, http://www cs iusb edu/~danav/teach/c311/c311_elisp2 html

PDF	William E Byrd - UAB ternational Lisp Conference (2014) I have given An introduction to relational ( pure logic) programming using the http://www cs indiana edu/classes/c311/

PDF	Relational Programming in miniKanren - Indiana University ciate instructor for Indiana University's undergraduate (C311) and graduate ( B521) introductory programming languages courses, under the enthusiastic leadership Tom Anastasio taught me LISP, cleverly disguised as C Alan Sherman pre-