Universally programmable intelligent matter summary (2002)

by Bruce J. Maclennan
Venue:in IEEE Nano 2002. IEEE Press
Citations:7 - 3 self

Active Bibliography

Universally Programmable Intelligent Matter(Exploratory Research Proposal) – unknown authors - 2002
2 Replication, Sharing, Deletion, Lists, and Numerals: Progress on Universally Programmable Intelligent Matter – Bruce J. Maclennan - 2002
Bracket abstraction in the combinator system Cl(K) – Sabine Broda, Luís Damas
Prop – Karim Nour - 905
Prop – Karim Nour
Bracket Abstraction Preserves Typability A formal proof of Diller–algorithm–C in PVS – Sjaak Smetsers, Arjen Van Weelden
RESTRICTIONS ON QUANTIFIER DOMAINS – John Mccarthy, Department Head - 1994
2 Why sets? – Andreas Blass, Yuri Gurevich - 2008
Introduction to Functional Programming using Gofer – E. P. Wentworth - 1990
5 A COMBINATORY ACCOUNT OF INTERNAL STRUCTURE – Barry Jay, Thomas Given-wilson
Lambda-Calculus and Functional Programming – Jonathan P. Seldin
Compiling Lazy Functional Languages: An introduction – Thomas Johnsson - 1987
Building Query Optimizers with Combinators: Dissertation Proposal – Mitch Cherniack - 1997
2 What is an Efficient Implementation of the λ-calculus? – Gudmund S. Frandsen, Carl Sturtivant - 1991
2 What is an Efficient Implementation of the λ-calculus? – Gudmund S. Frandsen, Carl Sturtivant - 1991
29 Total Functional Programming – David Turner - 2004
31 Rule Languages and Internal Algebras for Rule-Based Optimizers – Mitch Cherniack, Stanley B. Zdonik - 1996
1 Normal Forms in Combinatory Logic – Patricia Johann - 1992
5 A proof of the church-rosser theorem for the lambda calculus in higher order logic – Peter V. Homeier - 2001