A Virtual Machine for a Type-omega Denotational Proof Language

dc.creator	III, Teodoro Arvizo
dc.date	2004-10-20T20:29:40Z
dc.date	2004-10-20T20:29:40Z
dc.date	2002-06-01
dc.date.accessioned	2013-10-09T02:48:21Z
dc.date.available	2013-10-09T02:48:21Z
dc.date.issued	2013-10-09
dc.identifier	AITR-2002-004
dc.identifier	http://hdl.handle.net/1721.1/7092
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	In this thesis, I designed and implemented a virtual machine (VM) for a monomorphic variant of Athena, a type-omega denotational proof language (DPL). This machine attempts to maintain the minimum state required to evaluate Athena phrases. This thesis also includes the design and implementation of a compiler for monomorphic Athena that compiles to the VM. Finally, it includes details on my implementation of a read-eval-print loop that glues together the VM core and the compiler to provide a full, user-accessible interface to monomorphic Athena. The Athena VM provides the same basis for DPLs that the SECD machine does for pure, functional programming and the Warren Abstract Machine does for Prolog.
dc.format	106 p.
dc.format	2935187 bytes
dc.format	816842 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AITR-2002-004
dc.subject	AI
dc.subject	virtual machine
dc.subject	SECD
dc.subject	SECD machine
dc.subject	denotational proof language
dc.subject	Athena
dc.title	A Virtual Machine for a Type-omega Denotational Proof Language

Files in this item

Files	Size	Format	View
There are no files associated with this item.