Notes on the -calculus
J.R.B. Cockett
Department of Computer Science, University of Calgary,
Calgary, T2N 1N4, Alberta, Canada
October 19, 2010
1
Introduction
The -calculus was one of the rst descriptions produced of computable functions. It grew out of
a
Typed Lambda Calculus with Fixed Points
Robin Cockett
December 2, 2010
This document describes some basic type theories which can be built on top of the -calculus.
Perhaps one of the most basic is the type theory which underlies most functional style prog
The
Haskell Programmers Guide
to the
IO Monad
Dont Panic
Stefan Klinger
University of Twente, the Netherlands EWI, Database Group CTIT Technical Report
Stefan Klinger. The Haskell Programmers Guide to the IO Monad Dont Panic.
Order-address: Centre for T
Notes on rewriting
Robin Cockett Department of Computer Science University of Calgary October 23, 2008
1
Introduction
Rewriting is a fundamental technique both in algebra and in programming languages. These notes are aimed at giving a brief introduction t
Foundations of Functional Programming
Computer Science Tripos Part IB Easter Term
Lawrence C Paulson Computer Laboratory University of Cambridge lcp@cl.cam.ac.uk
Copyright c 2000 by Lawrence C. Paulson
Contents
1 2 3 4 5 6 7 8 Introduction Equality and No
CPSC 521: midterm exam
Robin Cockett
November 2009
This exam is worth 20% of the course. There are 100 points available.
1. (25 points)
Consider the following Haskell code:
data Exp f v = Var v | Opn f [Exp f v]
deriving Show
instance Monad (Exp f) where
CPSC 521: midterm exam
Robin Cockett
November 9, 2010
This exam is worth 20%. Each question is marked out of 25 points making a total of 100 points
available:
1. (a) (10 points) Give the description of the Monad class and provide as instances the list
mon
CPSC 417: midterm exam
Robin Cockett November 5, 2007
This exam is worth 20% of the course each question is worth 4 points: 1. (Describe the translation from list comprehension syntax to core Haskell code. Translate the following function: pairs: [a] -> [
CPSC 417: Midterm 2006
Robin Cockett November 7, 2006
This exam is worth 20% of the course. It is a take home exam you must return it on Tuesday 14th in class. It is an open book exam but you may not discuss it with each other. There are 45 points availab
P. 1 of 6
THE UNIVERSITY OF CALGARY
FACULTY OF SCIENCE
FINAL EXAMINATION
COMPUTER SCIENCE 417
December, 2006
Time: 2 hrs.
Instructions
The exam contains questions totalling 100 points. Answer all
questions. This exam is closed book.
.2
CPSC 417 Final Exam
P. 1 of 5
THE UNIVERSITY OF CALGARY
FACULTY OF SCIENCE
FINAL EXAMINATION
COMPUTER SCIENCE 417
December, 2007
Time: 2 hrs.
Instructions
The exam contains questions totalling 100 points. Answer all
questions. This exam is closed book.
.2
CPSC 417 Final Exam
Notes on the -calculus
J.R.B. Cockett
Department of Computer Science, University of Calgary,
Calgary, T2N 1N4, Alberta, Canada
October 19, 2010
1
Introduction
The -calculus was one of the rst descriptions produced of computable functions. It grew out of
a
Typed Lambda Calculus with Fixed Points
Robin Cockett
December 2, 2010
This document describes some basic type theories which can be built on top of the -calculus.
Perhaps one of the most basic is the type theory which underlies most functional style prog
Foundations of Functional Programming
Computer Science Tripos Part IB Easter Term
Lawrence C Paulson Computer Laboratory University of Cambridge lcp@cl.cam.ac.uk
Copyright c 2000 by Lawrence C. Paulson
Contents
1 2 3 4 5 6 7 8 Introduction Equality and No
Notes on rewriting
Robin Cockett Department of Computer Science University of Calgary October 23, 2008
1
Introduction
Rewriting is a fundamental technique both in algebra and in programming languages. These notes are aimed at giving a brief introduction t
The
Haskell Programmers Guide
to the
IO Monad
Dont Panic
Stefan Klinger
University of Twente, the Netherlands EWI, Database Group CTIT Technical Report
Stefan Klinger. The Haskell Programmers Guide to the IO Monad Dont Panic.
Order-address: Centre for T
P. 1 of 6
THE UNIVERSITY OF CALGARY
FACULTY OF SCIENCE
FINAL EXAMINATION
COMPUTER SCIENCE 417
December, 2006
Time: 2 hrs.
Instructions
The exam contains questions totalling 100 points. Answer all
questions. This exam is closed book.
.2
CPSC 417 Final Exam
CPSC 521: midterm exam
Robin Cockett
November 9, 2010
This exam is worth 20%. Each question is marked out of 25 points making a total of 100 points
available:
1. (a) (10 points) Give the description of the Monad class and provide as instances the list
mon
CPSC 417: Midterm 2006
Robin Cockett November 7, 2006
This exam is worth 20% of the course. It is a take home exam you must return it on Tuesday 14th in class. It is an open book exam but you may not discuss it with each other. There are 45 points availab
P. 1 of 5
THE UNIVERSITY OF CALGARY
FACULTY OF SCIENCE
FINAL EXAMINATION
COMPUTER SCIENCE 417
December, 2007
Time: 2 hrs.
Instructions
The exam contains questions totalling 100 points. Answer all
questions. This exam is closed book.
.2
CPSC 417 Final Exam
CPSC 521: midterm exam
Robin Cockett
November 2009
This exam is worth 20% of the course. There are 100 points available.
1. (25 points)
Consider the following Haskell code:
data Exp f v = Var v | Opn f [Exp f v]
deriving Show
instance Monad (Exp f) where
CPSC 417: midterm exam
Robin Cockett November 5, 2007
This exam is worth 20% of the course each question is worth 4 points: 1. (Describe the translation from list comprehension syntax to core Haskell code. Translate the following function: pairs: [a] -> [