Programming Languages (CSC-302 99S)


Class 18: Scheme Semantics (3)

Back to Program Verification. On to Another Perspective: FP.

Held Friday, March 5

Summary

Contents


Notes


Notation

A web page can't do everything they can do.

Semantic Functions

The meaning of a variable

E[[I]] = \u k . hold (lookup u I) (single (\ e . e = undefined -> wrong ``undefined variable'', send e k))

The meaning of function application

E[[(E E*)]] = \ u k . E* (permute(<E> & E*)) u (\e1* . ((\e2* . applicate (e2* @ 1) (e2* ! 1) k) (unpermute e1*)))

The meaning of lambda abstraction

You're foolish if you think that I'm going to retype the meaning of a lambda abstraction.


History


Back to Program Verification. On to Another Perspective: FP.


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.18.html

Source text last modified Fri Mar 5 13:13:24 1999.

This page generated on Fri Mar 5 13:15:28 1999 by SiteWeaver. Validate this page's HTML.

Contact our webmaster at rebelsky@math.grin.edu