Viewing control structures as patterns of passing messages

Artificial Intelligence

Volumn 8, Issue 3, 1977, Pages 323-364

  Hewitt, Carl ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL SYSTEMS - THEORY;

COMPUTER PROBEM SOLVING;

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0017504498     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(77)90033-9     Document Type: Article

References (48)

1. Ideas for computer systems organization: A personal survey
2. Garbage collection in a very large address space
3. Stream processing functions
4. Recursive definitions of partial functions and their computations
5. The Calculi of Lambda Conversion
6. TPU Report No. 1
7. A multi-level organization for problem solving using many, diverse, cooperating sources of knowledge
8. pal—A language for teaching programming linguistics
9. Lambda calculus schemata
10. Control structures for programming languages
11. Cons should not evaluate its arguments
12. Semantics of communicating parallel processes
13. Actor semantics of planner-73
14. A lazy evaluator
15. A uniform view of control structure in programming languages
16. planner: A language for manipulating models and proving theorems in a robot
17. Procedural Embedding of Knowledge in planner
18. Protection and synchronization in actor systems
19. A universal modular actor formalism for artificial Intelligence
20. Towards a programming apprentice
21. An actor-based computer animation language
22. flex: A flexible extendible language, Computer Science Dept.
23. A correspondence between algol 60 and Church's lambda-notation
24. Personal dynamic media
25. BEINGS: Knowledge as interacting experts
26. AI Memo No. 259
27. Progress in Perception, Understanding simple plant pictures
28. Processes: A mathematical model of computing agents
29. Some problems of basic organization in problem-solving programs
30. Protected program modules in simula-67
31. gedanken a simple typeless language based on the principle of completeness and the reference concept
32. Definitional interpreters for higher-order programming languages
33. Understanding lisp programs: Towards a programmer's apprentice
34. QA4: A procedural calculus for intuitive reasoning
35. Actor machine architecture
36. scheme: An interpreter for extended lambda calculus
37. Symbolic evaluation of programs as an aid to program construction
38. Correct and optimal implementations of recursion in a simple programming language
39. Semantics and pragmatics of the lambda-calculus
40. Program development by stepwise refinement