Table of contentsSTELLA - Lisp-style Symbolic Programming with Delivery in Common-Lisp, C++ and Java Bio What is STELLA? The STELLA - Lisp Connection The STELLA Team STELLA Experience World-Wide as of 10/99 Requirements Guiding STELLA’s Design STELLA Language Overview STELLA Overview: Syntax STELLA Overview: Type System STELLA Overview: Object System STELLA Overview: Control Structure STELLA Overview: Symbolic Programming STELLA Overview: Name Spaces STELLA Overview: Memory Management Influences from Non-Lisp Languages A Few Features Aren’t Finished STELLA System Architecture Translation Instead of Compilation STELLA Code Examples Method Example 1 Method Example 1 - Efficiency via Inlining Method Example 2 - Iteration Method Example 3 - Statement as Expression Class Example 1 Class Example 2 Programming to the “Bare Metal” Type Inference Explicit vs. Implicit Typing Type Inference Example Type Inference Example (cont). Type Inference Information Flow Runtime Type Inference via typecase Program as Data Backquote Example 1 Backquote Example 1 (cont.) Backquote Example 2 Demons STELLA’s Triggers (‘‘Demons’’) Example “Inverse Slot” Demon Discussion STELLA vs. Common Lisp/CLOS STELLA vs. C++ STELLA vs. C++ (cont.) Why a new language, why not extend C++? Alternative Approaches Rapid Prototyping Conclusions Slide 49 |
Author: Hans Chalupsky Best viewed with Download presentation (PowerPoint) Download presentation (StarOffice) |
