[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

2.7 Virtual Code Semantics

As the previous sections explain, virtual code applications are defined in terms of mathematical functions. Up until this point, the discussion has focused on the interface between the function and the virtual machine interpreter, by detailing the arguments passed to the functions under various circumstances and the results they are expected to return in order to achieve various effects.

The purpose of this section is to complete the picture by explaining how a given computable function can be expressed in virtual code, considering only functions operating on the trees described in Raw Material. Functions manipulating trees of nil are undoubtedly a frivolous and abstract subject in themselves. One is obliged to refer back to the previous sections if in need of motivation.

2.7.1 A New Operator  
2.7.2 On Equality  
2.7.3 A Minimal Set of Properties  
2.7.4 A Simple Lisp Like Language  
2.7.5 How avram Thinks  
2.7.6 Variable Freedom  
2.7.7 Metrics and Maintenance  
2.7.8 Deconstruction  
2.7.9 Recursion  
2.7.10 Assignment  
2.7.11 Predicates  
2.7.12 Iteration  
2.7.13 List Combinators  
2.7.14 List Functions  
2.7.15 Exception Handling  
2.7.16 Interfaces to External Code  
2.7.17 Vacant Address Space  
[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

This document was generated on November 8, 2012 using texi2html 1.82.