Substitution: A formal methods case study using monads and transformations

DOI10.1016/0167-6423(94)00022-0MaRDI QIDQ1346686zbMATH OpenOpenAlexFDO

Authors V. Pereyra

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

zbMATH Keywords

substitutionde Bruijn representation

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Recommendations

• Monads, indexes and transformations
• Notions of computation and monads
• Higher-order substitutions
• Publication:4945244
• The Substitution Vanishes

Cited in

(16)

• Map fusion for nested datatypes in intensional type theory
• Implementing a normalizer using sized heterogeneous types
• scientific article; zbMATH DE number 7447767 (Why is no real title available?)
• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
• From signatures to monads in \textsf{UniMath}
• scientific article; zbMATH DE number 2013584 (Why is no real title available?)
• Monads, indexes and transformations
• scientific article; zbMATH DE number 7379288 (Why is no real title available?)
• 2-Dimensional Directed Type Theory
• Efficient substitution in Hoare logic expressions
• A unified treatment of syntax with binders
• On a generalization of substitutions in application to the problem of static analysis of programs
• Heterogeneous substitution systems revisited
• Substitution in non-wellfounded syntax with variable binding
• scientific article; zbMATH DE number 7577567 (Why is no real title available?)
• An induction principle for nested datatypes in intensional type theory

This page was built for publication: Substitution: A formal methods case study using monads and transformations

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