The Universal Resolving Algorithm: Inverse Computation in a Functional Language-Reference-Cited by-同舟云学术

The Universal Resolving Algorithm: Inverse Computation in a Functional Language

Published:2000 Issue: Volume: Page:187-212
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Abramov Sergei,Glück Robert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10722010_13

Reference30 articles.

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

2. Abramov, S.M.: Metavychislenija i ikh prilozhenija (Metacomputation and its applications). Nauka-Fizmatlit, Moscow (1995) (in Russian)

3. Abramov, S.M., Glück, R.: From standard to non-standard semantics by semantics modifiers. International Journal of Foundations of Computer Science (to appear)

4. Abramov, S.M., Glück, R.: Semantics modifiers: an approach to non-standard semantics of programming languages. In: Sato, M., Toyama, Y. (eds.) Third Intern. Symposium on Functional and Logic Programming, pp. 247–270. World Scientific, Singapore (1998)

5. International Series in Computer Science;R. Bird,1997

Cited by 13 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. Improving Determinization of Grammar Programs for Program Inversion;Logic-Based Program Synthesis and Transformation;2013

4. Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants;Relational and Algebraic Methods in Computer Science;2012

5. Combinators for bidirectional tree transformations;ACM Transactions on Programming Languages and Systems;2007-05