
Universally Programmable Intelligent Matter(Exploratory Research Proposal)
–
 2002

2

Replication, Sharing, Deletion, Lists, and Numerals: Progress on Universally Programmable Intelligent Matter
–
 2002


Bracket abstraction in the combinator system Cl(K)
–


Prop
–
 905


Prop
–


Bracket Abstraction Preserves Typability A formal proof of Diller–algorithm–C in PVS
–


RESTRICTIONS ON QUANTIFIER DOMAINS
–
 1994

2

Why sets?
–
 2008


Introduction to Functional Programming using Gofer
–
 1990

5

A COMBINATORY ACCOUNT OF INTERNAL STRUCTURE
–


LambdaCalculus and Functional Programming
–


Compiling Lazy Functional Languages: An introduction
–
 1987


Building Query Optimizers with Combinators: Dissertation Proposal
–
 1997

2

What is an Efficient Implementation of the λcalculus?
–
 1991

2

What is an Efficient Implementation of the λcalculus?
–
 1991

31

Rule Languages and Internal Algebras for RuleBased Optimizers
–
 1996

30

Total Functional Programming
–
 2004

1

Normal Forms in Combinatory Logic
–
 1992

5

A proof of the churchrosser theorem for the lambda calculus in higher order logic
–
 2001
