Kostas Arkoudas

Learn More
Primitive recursion is a well known syntactic restriction on recursive deenitions which guarantees termination. Unfortunately many natural deenitions, such as the most common deenition of Euclid's GCD algorithm, are not primitive recursive. Walther has recently given a proof system for verifying termination of a broader class of deenitions. Although(More)
© 2 0 0 2 m a s s a c h u s e t t s i n s t i t u t e o f t e c h n o l o g y, c a m b r i d g e , m a 0 2 1 3 9 u s a — w w w. a i. m i t. e d u Abstract In this thesis, I designed and implemented a virtual machine (VM) for a monomorphic variant of Athena, a type-ω denotational proof language (DPL). This machine attempts to maintain the minimum state(More)
In this thesis, I designed and implemented a virtual machine (VM) for a monomorphic variant of Athena, a type-w 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.(More)
  • 1