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.
Recommendations
Cited in
(12)- Partial evaluation with inference rules
- The origins of structural operational semantics
- Executable structural operational semantics in Maude
- Executable relational specifications of polymorphic type systems using Prolog
- Executable semantic descriptions
- scientific article; zbMATH DE number 512880 (Why is no real title available?)
- On extracting static semantics
- scientific article; zbMATH DE number 765178 (Why is no real title available?)
- scientific article; zbMATH DE number 7453190 (Why is no real title available?)
- DynSem: a DSL for dynamic semantics specification
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Two case studies of semantics execution in Maude: CCS and LOTOS
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)