Toy LISP Interpreter on a Connex Memory Maschine
| dc.creator | Mîtu,Bogdan | |
| dc.creator | Mîtu,Corina | |
| dc.date | 1996 | |
| dc.date.accessioned | 2024-02-06T12:48:15Z | |
| dc.date.available | 2024-02-06T12:48:15Z | |
| dc.description | The Connex Memory is a new memory structure proposed by G. Stefan as a hardware support for symbolic processing. The powerful set of memory access functions supported by the CM is expected to allow a faster and less resource consuming execution of functional languages on dedicated architectures. This paper presents an interpreter of Chaitin s Toy LISP written for a CM-based system with stack controller. 1.) C. Calude (ed.). The Finite, the Unbounded and the Infinite, Proceedings of the Summer School "Chaitin Complexity and Applications", Mangalia, Romania, 27 June - 6 July, 1995. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-002-05-0427 | |
| dc.identifier | https://lib.jucs.org/article/27250/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/6974 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 2(5): 427-438 | |
| dc.title | Toy LISP Interpreter on a Connex Memory Maschine | |
| dc.type | Research Article |