scientific article; zbMATH DE number 4097355

MaRDI QIDQ3824397zbMATH OpenFDO

Authors A. L. Rastsvetaev

Publication date 1989

zbMATH Keywords

interpretability of program logicslogic of recursive programsprogram schemespropositional dynamic logicrecursion

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Recursive program schemes and context-free monads
• Monadic logic programs and functional complexity
• The Hoare logic of deterministic and nondeterministic monadic recursion schemes
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs
• On the Hoare theory of monadic recursion schemes
• On optimization of monadic logic programs
• The complexity of monadic recursion schemes: executability problems, nesting depth, and applications
• On structuring functional programs with monoidal profunctors
• On the parameterized intractability of monadic second-order logic

Cited in

(4)

• Decidable properties of monadic recursive schemas with a depth parameter
• Compositions of programs that induce special monotonic functions
• Counting on CTL^*: On the expressive power of monadic path logic
• scientific article; zbMATH DE number 4009792 (Why is no real title available?)

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 Q3824397)