Moore, John (2011) Executable rules of encoding. In: 5th Workshop on Dynamic Languages and Applications (DYLA 2011), 1 July 2011, Zürich, Switzerland. (Unpublished)

Full text not available from this repository.

Abstract

Encoding rules can be found in telecommunications standards documents. These documents try to explain in an unambiguous manner how a developer might transform a protocol described in an abstract language into a more concrete binary form by following a set of rules. They are often difficult to read and difficult to understand.
In this paper we show how a dynamic language can be used to help describe and understand a formal process such as applying a set of encoding rules to some data. We achieve this by taking the homoiconic approach of describing the encoding process in the abstract language used to describe protocols and then execute our result in a Scheme REPL.

Item Type:	Conference or Workshop Item (Paper)
Keywords:	Lisp, Scheme, Packedobjects
Subjects:	Computing
Depositing User:	Vani Aul
Date Deposited:	17 Dec 2013 15:14
Last Modified:	28 Aug 2021 07:16
URI:	https://repository.uwl.ac.uk/id/eprint/499

Actions (login required)

View Item