An universal resolving algorithm for inverse computation of lazy languages

DOI10.1007/978-3-540-70881-0_6MaRDI QIDQ3401933zbMATH OpenOpenAlexFDO

Authors Robert Glück, Yuri Klimov, S. A. Abramov

Publication date 2 February 2010

Published in Perspectives of Systems Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70881-0_6

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 1612493
• The universal resolving algorithm and its correctness: Inverse computation in a functional language
• scientific article; zbMATH DE number 1953282
• Reverse universal resolving algorithm and inverse driving
• Metacomputation and logic programming

Cited in

(7)

• Metacomputation and logic programming
• scientific article; zbMATH DE number 1612493 (Why is no real title available?)
• scientific article; zbMATH DE number 1953282 (Why is no real title available?)
• Reverse universal resolving algorithm and inverse driving
• scientific article; zbMATH DE number 7455733 (Why is no real title available?)
• Polynomial-time inverse computation for accumulative functions with multiple data traversals
• The universal resolving algorithm and its correctness: Inverse computation in a functional language

Describes a project that uses

Uses Software

• BABEL

This page was built for publication: An universal resolving algorithm for inverse computation of lazy languages

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