An Universal Resolving Algorithm for Inverse Computation of Lazy Languages-Reference-Cited by-同舟云学术

An Universal Resolving Algorithm for Inverse Computation of Lazy Languages

Published: Issue: Volume: Page:27-40
ISSN:
Container-title:Perspectives of Systems Informatics
language:
Short-container-title:

Author:

Abramov Sergei,Glück Robert,Klimov Yuri

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70881-0_6.pdf

Reference19 articles.

1. Abramov, S.M.: Metavychislenija i logicheskoe programmirovanie (Metacomputation and logic programming) (In Russian). Programmirovanie 3, 31–44 (1991)

2. Lecture Notes in Computer Science;S.M. Abramov,2000

3. Abramov, S.M., Glück, R.: The universal resolving algorithm and its correctness: inverse computation in a functional language. Science of Computer Programming 43(2-3), 193–229 (2002)

4. Albert, E., Vidal, G.: The narrowing-driven approach to functional logic program specialization. New Generation Computing 20(1), 3–26 (2002)

5. Ershov, A.P.: On the essence of compilation. In: Neuhold, E. (ed.) Formal Description of Programming Concepts, pp. 391–420. North-Holland, Amsterdam (1978)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Haskell⁻¹: automatic function inversion in Haskell;Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell;2021-08-18

2. Research Summary on Implementing Functional Patterns by Synthesizing Inverse Functions;Electronic Proceedings in Theoretical Computer Science;2020-09-19

3. FliPpr: A System for Deriving Parsers from Pretty-Printers;New Generation Computing;2018-07

4. Polynomial-time inverse computation for accumulative functions with multiple data traversals;Higher-Order and Symbolic Computation;2012-03