Polynomial-time inverse computation for accumulative functions with multiple data traversals
DOI10.1007/S10990-013-9097-8zbMATH Open1360.68366DBLPjournals/lisp/MatsudaIN12OpenAlexW1998594782WikidataQ59271114 ScholiaQ59271114MaRDI QIDQ526439FDOQ526439
Authors: Kazutaka Matsuda, Kazuhiro Inaba, Keisuke Nakano 
Publication date: 15 May 2017
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10990-013-9097-8
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
- Program inversion for tail recursive functions
- An universal resolving algorithm for inverse computation of lazy languages
functional programmingtree automatatree transducersprogram transformationinverse computationprogram inversion
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)
Cites Work
- The concept of a supercompiler
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deforestation: Transforming programs to eliminate trees
- A needed narrowing strategy
- Functional and Logic Programming
- Composition of functions with accumulating parameters
- A comparison of pebble tree transducers with macro tree transducers
- Typechecking for XML transformers
- An universal resolving algorithm for inverse computation of lazy languages
- Types and higher-order recursion schemes for verification of higher-order programs
- Macro Tree Translations of Linear Size Increase are MSO Definable
- Macro forest transducers
- Macro tree transducers
- Attribute grammar inversion and source-to-source translation
- Proving and applying program transformations expressed with second-order patterns
- Undecidable properties of deterministic top-down tree transducers
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Title not available (Why is that?)
- The Complexity of Tree Transducer Output Languages
- A grammar-based approach to invertible programs
- Time and space complexity of inside-out macro languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tupling calculation eliminates multiple data traversals
- Program inversion for tail recursive functions
- Title not available (Why is that?)
- On the complexity of typechecking top-down XML transformations
- The narrowing-driven approach to functional logic program specialization
- Perspectives of systems informatics. 6th international Andrei Ershov memorial conference, PSI 2006, Novosibirsk, Russia, June 27--30, 2006. Revised papers
- Deaccumulation techniques for improving provability
Cited In (4)
Uses Software
This page was built for publication: Polynomial-time inverse computation for accumulative functions with multiple data traversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526439)
