An universal resolving algorithm for inverse computation of lazy languages

DOI10.1007/978-3-540-70881-0_6zbMATH Open1185.68328OpenAlexW1563548877MaRDI QIDQ3401933FDOQ3401933

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

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

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Reverse universal resolving algorithm and inverse driving
• The universal resolving algorithm and its correctness: Inverse computation in a functional language
• Title not available (Why is that?)
• Metacomputation and logic programming
• Polynomial-time inverse computation for accumulative functions with multiple data traversals

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)