Substitution: A formal methods case study using monads and transformations
From MaRDI portal
Publication:1346686
DOI10.1016/0167-6423(94)00022-0zbMath0830.68025OpenAlexW1975911435MaRDI QIDQ1346686
Publication date: 10 April 1995
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(94)00022-0
Grammars and rewriting systems (68Q42) Logic programming (68N17) Combinatory logic and lambda calculus (03B40)
Related Items (12)
A unified treatment of syntax with binders ⋮ Map fusion for nested datatypes in intensional type theory ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 2-Dimensional Directed Type Theory ⋮ Substitution in non-wellfounded syntax with variable binding ⋮ Unnamed Item ⋮ Implementing a normalizer using sized heterogeneous types ⋮ An induction principle for nested datatypes in intensional type theory ⋮ From signatures to monads in \textsf{UniMath} ⋮ Heterogeneous Substitution Systems Revisited ⋮ A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
This page was built for publication: Substitution: A formal methods case study using monads and transformations
