A new one-pass transformation into monadic normal form

DOI10.1007/3-540-36579-6_6MaRDI QIDQ4417784zbMATH OpenFDO

Authors Olivier Danvy

Publication date 30 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2622/26220077.htm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Transforming functional logic programs into monadic functional programs
• Monad transformers as monoid transformers
• Natural transformations as rewrite rules and monad composition
• On the kernel of a monadic transformation
• Monadic Translation of Intuitionistic Sequent Calculus
• Monadic translation of classical sequent calculus
• Formal verification of monad transformers
• Model Transformations in Decidability Proofs for Monadic Theories
• MonadicNLIN and quantifier-free reductions
• Eilenberg-Moore monoids and backtracking monad transformers

Cited in

(3)

• CPS transformation of beta-redexes
• Monadic Translation of Intuitionistic Sequent Calculus
• Evaluation strategies for monadic computations

This page was built for publication: A new one-pass transformation into monadic normal form

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