scientific article; zbMATH DE number 3860370

From MaRDI portal
Publication:3327701





[For the entire collection see Zbl 0534.00019.] We discuss how semantic specifications written using inference rules may be executed. We present a new formalism for specifying semantics, called Typol, based on notions of pattern-matching, inference rules and operational semantics. Typol program are compiled into Prolog to create executable type-checkers, interpreters, etc... directly from their specifications. We present two experiments carried out with Typol: static verification of an Algol-like language (Asple), and type inference in ML.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3327701)