Year-end Sale % OFF 
Abstract
This paper describes the first implementation of an interpreter for iRho, an imperative version of the Rewriting-calculus, based on pattern-matching, pattern-abstractions, and side-effects. The implementation contains a parser and a call-by-value evaluator in Natural Semantics; everything is written using the programming language Scheme. The core of this implementation (evaluator) is certified using the proof assistant Coq.Performances are honest compared to the minimal essence of the implementation. This document describes, by means of examples, how to use and to play with iRho. The final objective is to make iRho a, so called, agile programming language, in the vein of some useful scripts languages, like, e.g. Python and Ruby, where proof search is not only feasible but easy.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
