The following papers were presented at EuroForth 2005:
Federico de Ceballos |
|
M. Anton Ertl |
Xchars: Write programs for UTF-8 *and* fixed-width character encodings |
David Gregg |
|
Angel Robert Lynas |
SuDoku Solver Case Study: from specification to RVM-Forth (part I) |
N.J. Nelson |
Bernd Paysan |
Xchars: Write programs for UTF-8 *and* fixed-width character encodings |
Stephen Pelc |
|
Bill Stoddart |
SuDoku Solver Case Study: from specification to RVM-Forth (part I) |
K.B. Swiatlowski |
C. Williams |
|
In his book "Simplicity", celebrated author Edward de Bono (famous for concepts such as "Lateral Thinking" or "Po") put forward ten rules that should be used in every system that tries to define itself as simple. This paper studies how the Forth language meets these rules.
Stack caching speeds Forth up by keeping stack items in registers, reducing the memory accesses for stack items. This paper describes our work on extending forth's stack caching implementation to support more than one register in the canonical state, and presents timing results for the resulting Forth system. For single-representation stack caches, keeping just one stack item in registers is usually best, and provides speedups up to a factor of 2.84 over the straight-forward stack representation. For stack caches with multiple stack representations, using the one-register representation as canonical representation is usually optimal, resulting in an overall speedup of up to a factor of 3.80 (and up to a factor of 1.53 over single-representation stack caching).
A program written to use the xchar word set can work on a system with fixed-width character encodings as well as on a system with certain variable-width character sets (in particular, UTF-8). We have implemented this word set in Gforth with support for classical 8-bit fixed-width encodings and for UTF-8 (selectable on system startup). In this talk we demonstrate the word set, and discuss the current state of the word set and its implementation.
A project is underway to formulate a development cycle from B -- suitably augmenting its implementation language B0 with reversibility constructs -- to a coded implementation in the reversible target language RVM-Forth with translation schemas defined for this final stage. This paper describes the first phase of a case study using the puzzle SuDoku to investigate possible ways of fleshing out such a development cycle. We adopt an experimental approach, using a relatively simple specification as a springboard for what a generated code implementation might look like, and explore correspondences between the specification and implementation.
When creating automation code for mechanical handling equipment which is specially adapted for installation at a wide variety of different sites, it is common for numerous alterations in the code to be required on site, at the last minute. Under pressure, user documentation starts to diverge from code. How nice it would be, if clear, accurate and readable documentation could be regenerated automatically each time the code was recompiled - and translated, also automatically, into the customer's language!
Web services enable applications to exchange data using an extension to HTTP. Implementing web services requires extensions to an HTTP server, parsing and generating XML and then interfacing to other applications. This paper discusses what was needed to extend MPE’s PowerNet to handle web services, and how we took advantage of Forth itself to simplify the solution.
Following the convincing demonstrations at EuroForth 2004, we decided to use the "Microcore" VHDL Forth processor in the design of three new products. This paper will describe our progress in expanding the core design with additional peripherals, performing simulation, board implementation, and early experiments in writing code on the Microcore.
Last Modified: 27th October, 2005 |